The author presents new results concerning the Sturmian words which were conjectured some years ago. The author gives and proves an exact estimation of the size of \(A_ m\) (the set of factors of length m of all the Sturmian words). He also gives a combinatorial version of the Riemann hypothesis.
Recommendations
Cites work
- scientific article; zbMATH DE number 3871492 (Why is no real title available?)
- scientific article; zbMATH DE number 3911733 (Why is no real title available?)
- scientific article; zbMATH DE number 3991618 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- scientific article; zbMATH DE number 3032896 (Why is no real title available?)
- Infinite words with linear subword complexity
- Sequences with minimal block growth
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
- Uniform tag sequences
Cited in
(72)- On \(\theta\)-episturmian words
- On the conjugation of standard morphisms
- Combinatorics on patterns of a bidimensional Sturmian sequence
- Lyndon words and singular factors of sturmian words
- Sturmian morphisms and Rauzy's rules
- The index of Sturmian sequences
- Some combinatorial properties of Sturmian words
- Sturmian words: structure, combinatorics, and their arithmetics
- A representation theorem of the suffixes of characteristic sequences
- Weak repetitions in Sturmian strings.
- Hierarchical structures in Sturmian dynamical systems
- Some properties of the factors of Sturmian sequences.
- Well-balanced sequences
- Special factors, periodicity, and an application to Sturmian words
- The complexity of functions on lattices
- Balance properties of multi-dimensional words
- Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution
- On low-complexity bi-infinite words and their factors
- Generalized balances in Sturmian words
- Complexity and growth for polygonal billiards
- Partitioned factors in Christoffel and Sturmian words
- Sturmian numeration systems and decompositions to palindromes
- Digital straightness -- a review
- Powers in Sturmian sequences
- Random generation of finite Sturmian words
- Positions of the ranks of factors in certain finite long length words
- Sturmian morphisms and -words
- Flexibility of the pressure function
- Studies on finite Sturmian words
- Billiard complexity in the hypercube
- A connection between palindromic and factor complexity using return words
- Fractional parts of powers of large rational numbers
- Balancedness and coboundaries in symbolic systems
- Counting minimal semi-Sturmian words
- On the structure of bispecial Sturmian words
- Lochs-type theorems beyond positive entropy
- Generalized Hausdorff dimensions of sets of real numbers with zero entropy expansion
- On the characterization of absentee-voxels in a spherical surface and volume of revolution in \({\mathbb Z}^3\)
- Sturmian and Episturmian Words
- On covering a digital disc with concentric circles in \(\mathbb Z^2\)
- A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
- Iterated Floor Function, Algebraic Numbers, Discrete Chaos, Beatty Subsequences, Semigroups
- A new geometric approach to Sturmian words
- Optimal policies for observing time series and related restless bandit problems
- Digital straightness, circularity, and their applications to image analysis
- A Note on a Conjecture of Duval and Sturmian Words
- Digital straightness
- The recurrence function of a random Sturmian word
- Randomness and non-randomness properties of Piatetski-Shapiro sequences modulo \(m\)
- Weak colored local rules for planar tilings
- The doubling map with asymmetrical holes
- Abelian repetitions in Sturmian words
- COMBINATORIAL PROPERTIES OF ARNOUX–RAUZY SUBSHIFTS AND APPLICATIONS TO SCHRÖDINGER OPERATORS
- Squares and cubes in Sturmian sequences
- About the Frequencies of Some Patterns in Digital Planes Application to Area Estimators
- Factors of characteristic words of irrational numbers
- Languages under substitutions and balanced words
- Crochemore Factorization of Sturmian and Other Infinite Words
- Double sequences of low complexity
- On the complexity functions of Sturmian words
- Some results on digital segments and balanced words
- Triangular partitions: enumeration, structure, and generation
- Combinatorial properties of sequences defined by the billiard in the tesselation triangles
- Frequencies of factors of Sturmian sequences
- On the fragmentary complexity of symbolic sequences
- On a combinatorial property of Sturmian words
- Classification of periodic orbits for square and rectangular billiards
- Enumeration formula for \((2,n)\)-cubes in discrete planes
- Spectral regularity and defects for the Kohmoto model
- Combinatorial properties of triangular partitions
- Farey codes and languages
- Number-theoretic interpretation and construction of a digital circle
This page was built for publication: On the number of factors of Sturmian words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805261)
