Abstract: We introduce a new geometric approach to Sturmian words by means of a mapping that associates certain lines in the n x n -grid and sets of finite Sturmian words of length n. Using this mapping, we give new proofs of the formulas enumerating the finite Sturmian words and the palindromic finite Sturmian words of a given length. We also give a new proof for the well-known result that a factor of a Sturmian word has precisely two return words.
Recommendations
Cites work
- scientific article; zbMATH DE number 3885787 (Why is no real title available?)
- scientific article; zbMATH DE number 3141365 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
- A characterization of Sturmian words by return words
- COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES
- On the number of factors of Sturmian words
- Return words in Sturmian and episturmian words
- Some combinatorial properties of Sturmian words
Cited in
(13)- scientific article; zbMATH DE number 5279413 (Why is no real title available?)
- Sequences with constant number of return words
- A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
- The perimeter of uniform and geometric words: a probabilistic analysis
- A characterization of Sturmian words by return words
- Counting Berg partitions via Sturmian words and substitution tilings
- Generalized balances in Sturmian words
- Abelian returns in Sturmian words
- Asymptotic formula for balanced words
- Enumeration formulæ in neutral sets
- Return words in Sturmian and episturmian words
- Studies on finite Sturmian words
- A square root map on Sturmian words
This page was built for publication: A new geometric approach to Sturmian words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428857)
