Parity in Sahasrabudhe's additive-complexity question: extending Banero's morphism criterion
For the even-complexity construction question posed by Sahasrabudhe in Sturmian Words and Constant Additive Complexity (2015, Section 5, p. 7), we extend Banero's common-slope criterion (2013, Theorem 21): a bounded-complexity finite-morphic image of a word containing every finite source word has odd additive complexity at every sufficiently large multiple of the codeword-length gcd, by pairing complementary factor sums. Empty codewords are allowed when the output is infinite; consequently an eventually constant positive complexity is odd. Equal sums of equal-length complete images and complementary windows give a reflection with one fixed point. The argument also applies to lattice-valued sums, including abelian complexity. We give the anchored-word consequence of Banero's criterion and show that uniformly recurrent outputs are periodic.
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.24411971
- Primary Topic
- semigroups and automata theory
- Type
- preprint