On the number of hypercubic bipartitions of an integer

DOI10.1016/j.disc.2013.08.033zbMath1281.05012arXiv1106.4997OpenAlexW2963216527MaRDI QIDQ394278

Geir Agnarsson

Publication date: 27 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.4997

zbMATH Keywords

hypercubeinduced subgraphsrectangular gridbipartitiondivide-and-conquerdivide-and-conquer maximin recurrence

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17)

Related Items (1)

Distribution of the sum-of-digits function of random integers: a survey

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Mathematics for the Analysis of Algorithms.
• Edge-isoperimetric inequalities in the grid
• The ring of \(k\)-regular sequences
• Sur la fonction sommatoire de la fonction 'somme des chiffres'
• A note on the edges of the n-cube
• The ring of \(k\)-regular sequences. II.
• Solution of a Divide-and-Conquer Maximin Recurrence
• The Blancmange Function Continuous Everywhere but Differentiable Nowhere
• The Number of 1’s in Binary Integers: Bounds and Extremal Properties
• Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence
• Assignment of Numbers to Vertices
• An Isoperimetric Inequality on the Discrete Torus
• Maximally Connected Arrays on the n-Cube
• Optimal Assignments of Numbers to Vertices
• On a problem in additive number theory

This page was built for publication: On the number of hypercubic bipartitions of an integer