• Corpus ID: 231979365

Almost everywhere balanced sequences of complexity $2n+1$

@inproceedings{Cassaigne2021AlmostEB,
  title={Almost everywhere balanced sequences of complexity \$2n+1\$},
  author={Julien Cassaigne and S'ebastien Labb'e and Julien Leroy},
  year={2021}
}
. We study ternary sequences associated with a multidimensional continued fraction algorithm introduced by the first author. The algorithm is defined by two matrices and we show that it is measurably isomorphic to the shift on the set { 1 , 2 } N of directive sequences. For a given set C of two substitutions, we show that there exists a C -adic sequence for every vector of letter frequencies or, equivalently, for every directive sequence. We show that their factor complexity is at most 2 n +1 and… 

Figures and Tables from this paper

Coboundaries and eigenvalues of finitary S-adic systems
An S-adic system is a symbolic dynamical system generated by iterating an infinite sequence of substitutions or morphisms, called a directive sequence. A finitary S-adic dynamical system is one where
$\mathcal{S}$-adic characterization of minimal ternary dendric subshifts
TLDR
This paper obtains a characterization of dendric subshifts in the ternary case, involving a directed graph with 9 vertices, heading towards an S-adic characterization ot this family.
-adic characterization of minimal ternary dendric shifts
Dendric shifts are defined by combinatorial restrictions of the extensions of the words in their languages. This family generalizes well-known families of shifts such as Sturmian shifts,
Multidimensional continued fractions and symbolic codings of toral translations
It has been a long standing problem to find good symbolic codings for translations on the $d$-dimensional torus that enjoy the beautiful properties of Sturmian sequences like low complexity and good

References

SHOWING 1-10 OF 72 REFERENCES
Some Monoids of Pisot Matrices
A matrix norm gives an upper bound on the spectral radius of a matrix. Knowledge on the location of the dominant eigenvector also leads to upper bound of the second eigenvalue. We show how this
Représentation géométrique de suites de complexité $2n+1$
— We prove that ail minimal séquences of complexity 2n+ 1, satisfying to a combinatorial condition, can be represented by an interval exchange on six intervais; this generalizes a classical resuit on
3-dimensional Continued Fraction Algorithms Cheat Sheets
TLDR
This document considers multidimensional continued fraction algorithms that acts symmetrically on the positive cone $\mathbb{R}^d_+$ for $d=3$ and gives the code allowing to reproduce any of the results or figures appearing in these cheat sheets.
$\mathcal{S}$-adic characterization of minimal ternary dendric subshifts
TLDR
This paper obtains a characterization of dendric subshifts in the ternary case, involving a directed graph with 9 vertices, heading towards an S-adic characterization ot this family.
A Rauzy fractal unbounded in all directions of the plane
We construct an Arnoux-Rauzy word for which the set of all differences of two abelianized factors is equal to $\mathbb{Z}^3$. In particular, the imbalance of this word is infinite - and its Rauzy
Mathématique
  • 359(4):399–407,
  • 2021
Monatshefte für Mathematik
  • February
  • 2021
On the second Lyapunov exponent of some multidimensional continued fraction algorithms
TLDR
It is proved that the second Lyapunov exponent of Selmer's algorithm is negative and bound it away from zero and heuristic results indicate that all classical multidimensional continued fraction algorithms cease to be strongly convergent for high dimensions.
S-adic characterization of minimal ternary dendric shifts. Ergodic Theory and Dynamical Systems
  • 2021
1a
  • C. Deng
  • ioChem-BD Computational Chemistry Datasets
  • 2020
...
1
2
3
4
5
...