Metraipolis › archive › dc_7c60c41f65ec
Halving Partitions and Hyperbinary Expansions — arXiv:2611.01243
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01243
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:36:45.249Z
- SHA-256 of the archived text
9beb1e59fa56190802b6d946f8bb5210aafdc58540dd341f983f3d678d458d9e- Stable URL of this page
https://metraipolis.com/documento/dc_7c60c41f65ec
How to cite
Halving Partitions and Hyperbinary Expansions — arXiv:2611.01243 — arXiv (en), https://arxiv.org/abs/2611.01243 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7c60c41f65ec (Metraipolis archive dc_7c60c41f65ec, sha256 9beb1e59fa56190802b6d946f8bb5210aafdc58540dd341f983f3d678d458d9e)
BibTeX
@misc{dc7c60c41f65ec,
title = {Halving Partitions and Hyperbinary Expansions — arXiv:2611.01243},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01243},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7c60c41f65ec; sha256 9beb1e59fa56190802b6d946f8bb5210aafdc58540dd341f983f3d678d458d9e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01243. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Starting from a positive integer, repeatedly halve the current value, rounding up or down. Which resulting sequences have terms that add to the starting integer? A simple balance identity turns the rounding choices into hyperbinary expansions, in which each power of two occurs at most twice. This correspondence gives exact counts by length and an injection into the expansions counted by Stern's diatomic sequence. We characterize equality in the resulting bound by the binary digits of the odd part of the integer. We also determine the unique longest partition and give a short recursive counting algorithm. When the required total is allowed to vary, the chain counts eventually equal Stern's number, and we determine the exact threshold. A direct proof shows that the counts of hyperbinary expansions in the three length classes modulo three differ by at most one. For sufficiently long halving partitions, the counts by length first weakly increase and then weakly decrease, although the full sequence need not do so. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Combinatorics (math.CO) ; Number Theory (math.NT). Pagina del lavoro: https://arxiv.org/abs/2611.01243 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T11:05:22.264Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).