A set of sequences of complexity \(2n+1\)
From MaRDI portal
Publication:1678348
DOI10.1007/978-3-319-66396-8_14zbMath1405.68256arXiv1707.02741OpenAlexW3121286321MaRDI QIDQ1678348
Sébastien Labbé, Julien Leroy, Julien Cassaigne
Publication date: 15 November 2017
Full work available at URL: https://arxiv.org/abs/1707.02741
Combinatorics on words (68R15) Continued fractions and generalizations (11J70) Random dynamical systems aspects of multiplicative ergodic theory, Lyapunov exponents (37H15) Automata sequences (11B85)
Related Items (14)
-adic characterization of minimal ternary dendric shifts ⋮ Fixed points of Sturmian morphisms and their derivated words ⋮ On the dimension group of unimodular \(\mathcal{S}\)-adic subshifts ⋮ Simplicity of spectra for certain multidimensional continued fraction algorithms ⋮ Properties of a ternary infinite word ⋮ Multidimensional continued fractions and symbolic codings of toral translations ⋮ Balancedness and coboundaries in symbolic systems ⋮ On integer partitions and continued fraction type algorithms ⋮ Minimal Complexities for Infinite Words Written with d Letters ⋮ S-adic Sequences: A Bridge Between Dynamics, Arithmetic, and Geometry ⋮ On the second Lyapunov exponent of some multidimensional continued fraction algorithms ⋮ A Rauzy fractal unbounded in all directions of the plane ⋮ Zero measure spectrum for multi-frequency Schrödinger operators ⋮ Almost everywhere balanced sequences of complexity \(2n + 1\)
This page was built for publication: A set of sequences of complexity \(2n+1\)
