A minimal subshift $(X,T)$ is linearly recurrent if there exists a constant $K$ so that for each clopen set $U$ generated by a finite word $u$ the return time to $U$, with respect to $T$, is bounded by $K|u|$. We prove that given a linearly recurrent subshift $(X,T)$ the set of its non-periodic subshift factors is finite up to isomorphism. We also give a constructive characterization of these subshifts.
We prove that a subshift $(X,T)$ is linearly recurrent if and only if it is a primitive and proper $S$-adic subshift. This corrects Proposition 6 in F. Durand ({\it Ergod. Th. & Dynam. Sys. {\bf 20}} (2000), 1061--1078).
The class of linearly recurrent Cantor systems contains the substitution subshifts and some odometers. For substitution subshifts and odometers measure--theoretical and continuous eigenvalues are the same. It is natural to ask whether this rigidity property remains true for the class of linearly recurrent Cantor systems. We give partial answers to this question.
Let $X$ be a compact metric space and let $f:X\rightarrow X$ be a homeomorphism on $X$. We show that if $f$ is both pointwise recurrent and expansive, then the dynamical system $(X, f)$ is topologically conjugate to a subshift of some symbolic system. Moreover, if $f$ is pointwise positively recurrent, then the subshift is semisimple; a counterexample is given to show the necessity of positive recurrence to ensure the semisimilicity.
The main object of this work is to present a powerful method of construction of subshifts which we use chiefly to construct WAP systems with various properties. Among many other applications of this so called labeled subshifts, we obtain examples of null as well as non-null WAP subshifts, WAP subshifts of arbitrary countable (Birkhoff) height, and completely scrambled WAP systems of arbitrary countable height. We also construct LE but not HAE subshifts, and recurrent non-tame subshifts.
We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding whether, given p $\in$ N, there exists such a constant subsequence along an arithmetic progression of common difference p. In the special case of uniformly recurrent automatic sequences we explicitely describe the sets of such p by means of automata.
In the study of substitution minimal subshifts, some complicated trivialities have hindered simple and general approaches. Recently, Maloney and Rust introduced the term "tame," simplifying the study. We introduce another term "$l$-primitive" for the substitutions and show that the combination of these two conditions can characterize the minimality of substitution subshifts. We shall show that all substitution minimal subshifts can be generated by substitutions that satisfy both conditions; conversely, all substitutions that satisfy the two conditions always generate minimal subshifts. As an a…
This paper studies several aspects of symbolic factors of $\mathcal{S}$-adic subshifts of finite alphabet rank. First, we address a problem raised in [DDPM20] about the topological rank of symbolic factors of $\mathcal{S}$-adic subshifts and prove that this rank is at most the one of the extension system, improving results from [E20] and [GH2020]. As a consequence of our methods, we prove that finite topological rank systems are coalescent. Second, we investigate the structure of fibers $π^{-1}(y)$ of factor maps $π\colon(X,T)\to(Y,T)$ between minimal $\mathcal{S}$-adic subshifts of finite alp…
This paper studies several aspects of symbolic ({\em i.e.}\ subshift) factors of $\mathcal{S}$-adic subshifts of finite alphabet rank. First, we address a problem raised in [DDPM20] about the topological rank of symbolic factors of $\mathcal{S}$-adic subshifts and prove that this rank is at most the one of the extension system, improving results from [E20] and [GH2020]. As a consequence of our methods, we prove that finite topological rank systems are coalescent. Second, we investigate the structure of fibers $π^{-1}(y)$ of factor maps $π\colon(X,T)\to(Y,S)$ between minimal $\mathcal{S}$-adic …
In this article we study the automorphism group ${\rm Aut}(X,σ)$ of subshifts $(X,σ)$ of low word complexity. In particular, we prove that Aut$(X,σ)$ is virtually $\mathbb{Z}$ for aperiodic minimal subshifts and certain transitive subshifts with non-superlinear complexity. More precisely, the quotient of this group relative to the one generated by the shift map is a finite group. In addition, we show that any finite group can be obtained in this way. The class considered includes minimal subshifts induced by substitutions, linearly recurrent subshifts and even some subshifts which simultaneous…
It is possible to define mixing properties for subshifts according to the intensity which allows to concatenate two rectangular blocks. We study the interplay between this intensity and computational properties. In particular we prove that there exists linearly block gluing subshift of finite type which are aperiodic and that all right-recursively enumerable positive number can be realized as entropy of linearly block gluing Z 2-subshift of finite type. Like linearly block gluing imply transitivity, this last point answer a question asked in [HM10] about the characterization of the entropy of …
We give necessary and sufficient conditions to have measurable and continuous eigenfunctions for linearly recurrent Cantor dynamical systems. We also construct explicitly an example of linearly recurrent system with nontrivial Kronecker factor and a trivial maximal equicontinuous factor.
We prove that the skew product over a linearly recurrent interval exchange transformation defined by almost any real-valued, mean-zero linear combination of characteristic functions of intervals is ergodic with respect to Lebesgue measure.
We study random walk on topological full groups of subshifts, and show the existence of infinite, finitely generated, simple groups with the Liouville property. Results by Matui and Juschenko-Monod have shown that the derived subgroups of topological full groups of minimal subshifts provide the first examples of finitely generated, simple amenable groups. We show that if the (not necessarily minimal) subshift has a complexity function that grows slowly enough (e.g. linearly), then every symmetric and finitely supported probability measure on the topological full group has trivial Poisson-Furst…
We prove that every non-minimal transitive subshift $X$ satisfying a mild aperiodicity condition satisfies $\limsup c_n(X) - 1.5n = \infty$, and give a class of examples which shows that the threshold of $1.5n$ cannot be increased. As a corollary, we show that any transitive $X$ satisfying $\limsup c_n(X) - n = \infty$ and $\limsup c_n(X) - 1.5n < \infty$ must be minimal. We also prove some restrictions on the structure of transitive non-minimal $X$ satisfying $\liminf c_n(X) - 2n = -\infty$, which imply unique ergodicity (for a periodic measure) as a corollary, which extends a result of Boshe…
At the turn of this century Durand, and Lagarias and Pleasants established that key features of minimal subshifts (and their higher-dimensional analogues) to be studied are linearly repetitive, repulsive and power free. Since then, generalisations and extensions of these features, namely $α$-repetitive, $α$-repulsive and $α$-finite ($α\geq 1$), have been introduced and studied. We establish the equivalence of $α$-repulsive and $α$-finite for general subshifts over finite alphabets. Further, we studied a family of aperiodic minimal subshifts stemming from Grigorchuk's infinite $2$-group $G$. In…
We prove that irreducible, linearly recurrent, type W interval exchange transformations are always mild mixing. For every irreducible permutation the set of linearly recurrent interval exchange transformations has full Hausdorff dimension.
We show that if the complexity difference function p(n+1)-p(n) of a infinite minimal shift is bounded, then the the automorphism group of the one-sided shift is finite, and the automorphism group of the corresponding two-sided shift "modulo the shift" is finite. For the minimal Sturmian and minimal substitution shifts, the bounds can be explicitly computed, and for linearly recurrent shifts, the bound can be expressed as a function of the linear recurrence constant. We also show that any endomorphism of a linearly recurrent shift is a root of a power of the shift map.
Mechanical and Aerospace Engineering, Princeton University（普林斯顿大学机械与航空航天工程系（注：此处按要求提取到大学级别，故保留系名与大学名））；Princeton University（普林斯顿大学）
This paper describes a method for learning low-dimensional approximations of nonlinear dynamical systems, based on neural-network approximations of the underlying Koopman operator. Extended Dynamic Mode Decomposition (EDMD) provides a useful data-driven approximation of the Koopman operator for analyzing dynamical systems. This paper addresses a fundamental problem associated with EDMD: a trade-off between representational capacity of the dictionary and over-fitting due to insufficient data. A new neural network architecture combining an autoencoder with linear recurrent dynamics in the encode…
We study the spectral properties of ergodic Schrödinger operators that are associated to a certain family of non-primitive substitutions on a binary alphabet. The corresponding subshifts provide examples of dynamical systems that go beyond minimality, unique ergodicity and linear complexity. In some parameter region, we are naturally in the setting of an infinite ergodic measure. The almost sure spectrum is singular and contains an interval. Some criteria for the exclusion of eigenvalues are fully characterized, including the existence of strongly palindromic sequences. Many of our structural …
In this paper we study conditions under which a free minimal $\mz^d$-action on the Cantor set is a topological extension of the action of $d$ rotations, either on the product $\mt^d$ of $d$ 1-tori or on a single 1-torus $\mt^1$. We extend the notion of {\it linearly recurrent} systems defined for $\mz$-actions on the Cantor set to $\mz^d$-actions and we derive in this more general setting, a necessary and sufficient condition, which involves natural combinatorial data associated with the action, allowing the existence of a rotation topological factor of one these two types.
