The Universal Greedy Word: A Canonical Construction for Arbitrary Additive Bases
Authors/Creators
Description
We establish a universal construction that assigns to every finite additive basis B =
{b1, . . . , bk} containing unity a unique canonical infinite word WB over the alphabet B.
The construction employs a two-stage greedy principle: globally maximize occurrences
of the largest element bmax, then minimize length and maximize lexicographic order for
the unavoidable remainder. We prove that every integer n ≥ 1 admits a unique canonical
greedy expansion GB(n), and that the infinite concatenation of these expansions can be
generated by a deterministic automaton with variable-length reduction rules. The au-
tomaton achieves polynomial-time complexity O(N 3/bmax) for generating N terms. We
establish density theorems showing that bmax has asymptotic density 1 under regularity
conditions, and provide complete computational verification for four diverse bases includ-
ing the prime basis {1, 2, 3, 5, 7} that motivated this work. This framework generalizes
the classical Zeckendorf representation to arbitrary bases and reveals the Prime-Recursive
Word as the first instance of a completely universal phenomenon.
Files
_PUB_READY__FINAL_Draft_GREEDY_WORD_PAPER_1__The_Universal_Greedy_Word__A_Canonical_Construction_for_Arbitrary_Additive_Bases.pdf
Additional details
References
- E. Zeckendorf, Représentation des nombres naturels par une somme de nombres de Fi- bonacci ou de nombres de Lucas, Bull. Soc. Roy. Sci. Liège 41 (1972), 179–182.
- G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 6th ed., Oxford University Press, 2008
- M. Lothaire, Algebraic Combinatorics on Words, Cambridge University Press, 2002.
- J.-P. Allouche and J. Shallit, Automatic Sequences: Theory, Applications, Generaliza- tions, Cambridge University Press, 2003.
- D. N. Betzer, The Prime-Recursive Word of the Natural Numbers: A Canonical Infinite Additive Encoding Using Only the Digits 1, 2, 3, 5, 7, preprint (2025).