Alphabets, rewriting trails and periodic representations in algebraic bases
Denys Dutykh (LAMA, USMB [Universit\'e de Savoie] [Universit\'e de, Chamb\'ery], INSMI), Jean-Louis Verger-Gaugry (LAMA, USMB [Universit\'e de, Savoie] [Universit\'e de Chamb\'ery], INSMI)

TL;DR
This paper investigates the structure of alphabets and representations in algebraic bases, introducing rewriting trails and analyzing their relation to algebraic properties, with applications to Galois conjugation and dynamical zeta functions.
Contribution
It introduces the concept of rewriting trails for constructing intermediate alphabets and explores their implications for algebraic base representations and related number theoretic problems.
Findings
Maximal alphabets relate to Pierce numbers and Lehmer's problem.
Rewriting trails help construct intermediate alphabets with small polynomial values.
Poles of the dynamical zeta function are roots of the minimal polynomial of the base.
Abstract
For a real algebraic integer ({\it the base}), the finite alphabets which realize the identity , where is the set of complex numbers which are -eventually periodic representations, are investigated. Comparing with the greedy algorithm, minimal and maximal alphabets are defined. The maximal alphabets are shown to be correlated to the asymptotics of the Pierce numbers of the base and Lehmer's problem. The notion of rewriting trail is introduced to construct intermediate alphabets associated with small polynomial values of the base. Consequences on the representations of neighbourhoods of the origin in , generalizing Schmidt's theorem related to Pisot numbers, are investigated. Applications to Galois conjugation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Combinatorial Mathematics · Polynomial and algebraic computation
