Abstract: Given a totally finite ordered alphabet , endowing the set of words over with the alternating lexicographic order, we define a new class of Lyndon words. We study the fundamental properties of the associated symbolic dynamical systems called Lyndon system. We derive some fundamental properties of the beta-shift with negative base by relating it with the Lyndon system. We find, independently of W. Steiner's method, the conditions for which a word is the -expansion of for some .
Recommendations
Cites work
- Analytic combinatorics
- Beta-Expansions with Negative Bases
- Digital expansions with negative real bases
- Dynamical properties of the negative beta-transformation
- Free differential calculus. IV: The quotient groups of the lower central series
- Generalized Lyndon words
- On Burnside's Problem
- On a sequence related to that of Thue-Morse and its applications
- On the distance from a rational power to the nearest integer
- On theβ-expansions of real numbers
- Systèmes codés. (Coded systems)
This page was built for publication: On the Lyndon dynamical system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q281895)