Barker and Hardin's cyclic-repetition formulas and an extension of Fried's enumeration
Extending Fried's repetition-word enumeration (arXiv:2410.07237v3, 26 October 2024, Theorem 10), we prove Colin Barker's two conjectured formulas in the unpaginated FORMULA section of OEIS A268943, revision 8 (17 January 2019), for the arrays introduced by R. H. Hardin. The labels of successive adjacent equal pairs must advance cyclically through an eight-letter alphabet. A three-state decomposition proves the rational generating function and the radical expression for every positive length. The same decomposition works for every alphabet size at least two, establishing the empirical column recurrences and the first seven row polynomials in Hardin's related table A268944. More generally, the enumeration depends only on the common indegree of a loopless relation allowed between successive event labels; Fried's unequal-label rule is one case. We also count words by their number of equality events.
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.24410604
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- preprint