Halving-partition nonregularity and dyadic extensions of Alekseyev (2026): arXiv:2611.01243v1, Section 6, paragraph 2, p. 18
Extending Alekseyev's (2026) fixed-length enumeration, we answer negatively the question of whether the halving-partition count is 2-regular, posed in Section 6, second paragraph, page 18, of Halving Partitions and Hyperbinary Expansions (arXiv:2611.01243v1, 2026). An exact classification at n=2^m+1 gives a step function whose first difference has arbitrarily long zero blocks followed by a one. The dyadic length and total-part identities specialize his Theorem 5; the list classification supplies an alternative proof. A finite decimation family would impose a monic linear recurrence on this difference, which is impossible. The argument also excludes finite decimation families over every nonzero commutative ring and shows that the count modulo any integer q>=2 is not 2-automatic. We also give explicit dyadic deficit and digit-weight formulas, a flat length distribution, and the same nonregularity obstruction in every base 2^s, s>=1.
Authors
- Wenlin Zhang (ORCID: https://orcid.org/0009-0005-2414-7968)
- Haobo Ma
Institutions
- National University of Singapore (SG)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24409461
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- preprint