Related papers: On the complexity function for sequences which are…
Boshernitzan found a decay condition on the measure of cylinder sets that implies unique ergodicity for minimal subshifts. Interest in the properties of subshifts satisfying this condition has grown recently, due to a connection with the…
We bound the number of distinct minimal subsystems of a given transitive subshift of linear complexity, continuing work of Ormes and Pavlov [7]. We also bound the number of generic measures such a subshift can support based on its…
We characterize the complexity functions of subshifts up to asymptotic equivalence. The complexity function of every aperiodic function is non-decreasing, submultiplicative and grows at least linearly. We prove that conversely, every…
We show that linear complexity is the threshold for the emergence of Kakutani inequivalence for measurable systems supported on a minimal subshift. In particular, we show that there are minimal subshifts of arbitrarily low super-linear…
We prove results about subshifts with linear (word) complexity, meaning that $\limsup \frac{p(n)}{n} < \infty$, where for every $n$, $p(n)$ is the number of $n$-letter words appearing in sequences in the subshift. Denoting this limsup by…
We prove that for any transitive subshift $X$ with word complexity function $c_n(X)$, if $\liminf \frac{\log (c_n(X)/n)}{\log \log \log n} = 0$, then the quotient group $\textrm{Aut}(X,\sigma) / \langle \sigma\rangle$ of the automorphism…
In 1985, Boshernitzan showed that a minimal (sub)shift satisfying a linear block growth condition must have a bounded number of ergodic probability measures. Recently, this bound was shown to be sharp through examples constructed by Cyr and…
Partial rigidity is a quantitative notion of recurrence and provides a global obstruction which prevents the system from being strongly mixing. A dynamical system $(X, \mathcal{X}, \mu, T)$ is partially rigid if there is a constant $\delta…
We give a lower bound on the growth of a subshift based on a simple condition on the set of forbidden patterns defining that subshift. Aubrun et Al. showed a similar result based on the Lov\'asz Local Lemma for subshift over any countable…
We obtain complementary recurrence and transience criteria for processes $X=(X_n)_{n \ge 0}$ with values in $\mathbb R^d_+$ fulfilling a non-linear equation $X_{n+1}=MX_n+g(X_n)+ \xi_{n+1}$. Here $M$ denotes a primitive matrix having…
In 1984 Boshernitzan proved an upper bound on the number of ergodic measures for a minimal subshift of linear block growth and asked if it could be lowered without further assumptions on the shift. We answer this question, showing that…
For a finite alphabet $\mathcal{A}$ and a sequence $x \in \mathcal{A}^{\mathbb{N}}$, Kamae and Zamboni defined the maximal pattern complexity function $p^*_x(n)$ as a natural generalization of usual word complexity. They defined a…
In this paper, we prove the following version of the famous Bernstein's theorem: Let $X\subset \mathbb R^{n+k}$ be a closed and connected set with Hausdorff dimension $n$. Assume that $X$ satisfies the monotonicity formula at $p\in X$.…
We show that within any strong orbit equivalent class, there exist minimal subshifts with arbitrarily low superlinear complexity. This is done by proving that for any simple dimension group with unit $(G,G^+,u)$ and any sequence of positive…
In this work, we investigate the dynamics of a general non-autonomous system generated by a commutative family of homeomorphisms. In particular, we investigate properties such as periodicity, equicontinuity, minimality and transitivity for…
Given a sequence of Boolean functions $(f_n)_{n \geq 1}$, $f_n \colon \{ 0,1 \}^{n} \to \{ 0,1 \}$, and a sequence $(X^{(n)})_{n\geq 1} $ of continuous time $p_n $-biased random walks $ X^{(n)} = (X_t^{(n)})_{t \geq 0}$ on $ \{ 0,1 \}^{n}$,…
This paper aims to better understand the link better understand the links between aperiodicity in subshifts and pattern complexity. Our main contribution deals with substitutive subshifts, an equivalent to substitutive tilings in the…
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…
Let $(X,d)$ be a metric space and $f_{1,\infty}=\{f_n\}_{i=0}^{\infty}$ be a sequence of continuous maps $f_n:X\rightarrow X$ such that $(f_n)$ converges uniformly to a continuous map $f$. We investigate which conditions ensure that the…
In this paper we give an answer to Furstenberg's problem on topological disjointness. Namely, we show that a transitive system $(X,T)$ is disjoint from all minimal systems if and only if $(X,T)$ is weakly mixing and there is some countable…