We prove that every infinite minimal subshift with word complexity $p(q)$ satisfying $\limsup p(q)/q < 3/2$ is measure-theoretically isomorphic to its maximal equicontinuous factor; in particular, it has measurably discrete spectrum. Among other applications, this provides a proof of Sarnak's conjecture for all subshifts with $\limsup p(q)/q < 3/2$ (which can be thought of as a much stronger version of zero entropy). As in [CP23], our main technique is proving that all low-complexity minimal subshifts have a specific type of representation via a sequence $\{\tau_k\}$ of substitutions, usually called an S-adic decomposition. The maximal equicontinuous factor is the product of an odometer with a rotation on an abelian one-dimensional nilman...
The Fibonacci(-like) unimodal maps that have been studied in recent years give rise to a zero=entrop...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. For each ...
International audienceIn this article, we study the automorphism group Aut(X, sigma) of subshifts (X...
We prove results about subshifts with linear (word) complexity, meaning that $\limsup \frac {p(n...
International audienceIn this paper we undertake the general study of the Abelian complexity of an i...
AbstractLet Q be an alphabet on q letters. Let W : Z ≥0 → Q be a word such that each letter of Q occ...
Artículo de publicación ISIIn this article, we study the automorphism group Aut.X; / of subshifts ....
International audienceIn this paper we undertake the general study of the Abelian complexity of an i...
Artículo de publicación ISIIn this article, we study the automorphism group Aut.X; / of subshifts ....
Abstract. We prove two unrelated results about subshifts. First, we give a condition on the lengths ...
any minimal subshift with first difference of complexity bounded by 2 is S-adic with Card(S) ≤ 327. ...
Automata, Logic and SemanticsInternational audienceAn S-adic characterization of minimal subshifts w...
We prove several results about the relationship between the word complexity function of a subshift a...
Automata, Logic and SemanticsAn S-adic characterization of minimal subshifts with first difference o...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. For each ...
The Fibonacci(-like) unimodal maps that have been studied in recent years give rise to a zero=entrop...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. For each ...
International audienceIn this article, we study the automorphism group Aut(X, sigma) of subshifts (X...
We prove results about subshifts with linear (word) complexity, meaning that $\limsup \frac {p(n...
International audienceIn this paper we undertake the general study of the Abelian complexity of an i...
AbstractLet Q be an alphabet on q letters. Let W : Z ≥0 → Q be a word such that each letter of Q occ...
Artículo de publicación ISIIn this article, we study the automorphism group Aut.X; / of subshifts ....
International audienceIn this paper we undertake the general study of the Abelian complexity of an i...
Artículo de publicación ISIIn this article, we study the automorphism group Aut.X; / of subshifts ....
Abstract. We prove two unrelated results about subshifts. First, we give a condition on the lengths ...
any minimal subshift with first difference of complexity bounded by 2 is S-adic with Card(S) ≤ 327. ...
Automata, Logic and SemanticsInternational audienceAn S-adic characterization of minimal subshifts w...
We prove several results about the relationship between the word complexity function of a subshift a...
Automata, Logic and SemanticsAn S-adic characterization of minimal subshifts with first difference o...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. For each ...
The Fibonacci(-like) unimodal maps that have been studied in recent years give rise to a zero=entrop...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. For each ...
International audienceIn this article, we study the automorphism group Aut(X, sigma) of subshifts (X...