arXiv subjects

Van Cyr

Publications and source records attributed to Van Cyr.

At least 19 recordsLinked to original sources

arXiv2026

Stable covers of subshifts

Given a dynamical system, a characteristic measure is a Borel probability measure invariant under all of its automorphisms. Frisch and Tamuz asked if every symbolic system supports such a measure. Motivated by this problem, we study the natural cover of a subshift by its shift of finite type approximations and two senses in which this cover can be said to stabilize. The first is in terms of entropy decay and the second in terms of periodic points. We show that the first type of stabilization gives a new characterization of the class of language stable shifts and demonstrates that there is a mechanism for producing a characteristic measures that relies only on entropy differences. For the second type of stabilization, we show that this defines a new class of subshifts, invariant under conjugacies, that have characteristic measures.

math.DS↗

arXiv2024

Chaotic almost minimal actions

Motivated by Furstenberg's Theorem on sets in the circle invariant under multiplication by a non-lacunary semigroup, we define a general class of dynamical systems possessing similar topological dynamical properties. We call such systems chaotic almost minimal, reflecting that these systems are chaotic, but in some sense are close to minimal. We study properties of the acting group needed to admit such an action, and show the existence of a chaotic almost minimal $\mathbb{Z}$-action. We show there exists chaotic almost minimal $\mathbb{Z}^{d}$-actions which support multiple distinct nonatomic ergodic probability measures.

math.DS↗

arXiv2023

Strong Approximations of Shifts and the Characteristic Measures Problem

Every symbolic system supports a Borel measure that is invariant under the shift, but it is not known if every such systems supports a measure that is invariant under all of its automorphisms; known as a characteristic measure. We give sufficient conditions to find a characteristic measure, additionally showing when it can be taken to be a measure of maximal entropy. The class of systems to which these sufficient conditions apply is large, containing a dense $G_{\delta}$ set in the space of all shifts on a given alphabet, and is also large in the sense that it is closed under taking factors. We also investigate natural systems to which these sufficient conditions apply.

math.DS↗

arXiv2021

Characteristic measures for language stable subshifts

We consider the problem of when a symbolic dynamical system supports a Borel probability measure that is invariant under every element of its automorphism group. It follows readily from a classical result of Parry that the full shift on finitely many symbols, and more generally any mixing subshift of finite type, supports such a measure. Frisch and Tamuz recently dubbed such measures characteristic, and further showed that every zero entropy subshift has a characteristic measure. While it remains open if every subshift over a finite alphabet has a characteristic measure, we define a new class of shifts, which we call language stable subshifts, and show that these shifts have characteristic measures. This is a large class that is generic in several senses and contains numerous positive entropy examples.

math.DS↗

arXiv2020

The complexity threshold for the emergence of Kakutani inequivalence

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 complexity that admit both loosely Bernoulli and non-loosely Bernoulli ergodic measures and that no minimal subshift with linear complexity can admit inequivalent measures.

math.DS↗

arXiv2020

Boshernitzan's condition, factor complexity, and an application

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 study of discrete Schr\"odinger operators. Of particular interest is the question of how restrictive Boshernitzan's condition is. While it implies zero topological entropy, our main theorem shows how to construct minimal subshifts satisfying the condition whose factor complexity grows faster than any pre-assigned subexponential rate. As an application, via a theorem of Damanik and Lenz, we show that there is no subexponentially growing sequence for which the spectra of all discrete Schr\"odinger operators associated with subshifts whose complexity grows faster than the given sequence, have only finitely many gaps.

math.DS↗

arXiv2019

Realizing ergodic properties in zero entropy subshifts

A subshift with linear block complexity has at most countably many ergodic measures, and we continue of the study of the relation between such complexity and the invariant measures. By constructing minimal subshifts whose block complexity is arbitrarily close to linear but has uncountably many ergodic measures, we show that this behavior fails as soon as the block complexity is superlinear. With a different construction, we show that there exists a minimal subshift with an ergodic measure whose slow entropy grows slower than any given rate tending to infinitely but faster than any other rate majorizing this one yet still growing subexponentially. These constructions lead to obstructions in using subshifts in applications to properties of the prime numbers and in finding a measurable version of the complexity gap that arises for shifts of sublinear complexity.

math.DS↗

arXiv2018

Positive entropy equilibrium states

For transitive shifts of finite type, and more generally for shifts with specification, it is well-known that every equilibrium state for a Holder continuous potential has positive entropy as long as the shift has positive topological entropy. We give a non-uniform specification condition under which this property continues to hold, and demonstrate that it does not necessarily hold for other non-uniform versions of specification that have been introduced elsewhere.

math.DS↗

arXiv2017

The automorphism group of a shift of slow growth is amenable

Suppose $(X,\sigma)$ is a subshift, $P_X(n)$ is the word complexity function of $X$, and ${\rm Aut}(X)$ is the group of automorphisms of $X$. We show that if $P_X(n)=o(n^2/\log^2 n)$, then ${\rm Aut}(X)$ is amenable (as a countable, discrete group). We further show that if $P_X(n)=o(n^2)$, then ${\rm Aut}(X)$ can never contain a nonabelian free semigroup (and, in particular, can never contain a nonabelian free subgroup). This is in contrast to recent examples, due to Salo and Schraudner, of subshifts with quadratic complexity that do contain such a semigroup.

math.DS↗

arXiv2017

The spacetime of a shift endomorphism

The automorphism group of a one dimensional shift space over a finite alphabet exhibits different types of behavior: for a large class with positive entropy, it contains a rich collection of subgroups, while for many shifts of zero entropy, there are strong constraints on the automorphism group. We view this from a different perspective, considering a single automorphism (and sometimes endomorphism) and studying the naturally associated two dimensional shift system. In particular, we describe the relation between nonexpansive subspaces in this two dimensional system and dynamical properties of an automorphism of the shift.

math.DS↗

arXiv2017

Distortion and the automorphism group of a shift

The set of automorphisms of a one-dimensional \shift $(X, σ)$ forms a countable, but often very complicated, group. For zero entropy shifts, it has recently been shown that the automorphism group is more tame. We provide the first examples of countable groups that cannot embed into the automorphism group of any zero entropy \shiftno. In particular, we show that the Baumslag-Solitar groups ${\rm BS}(1,n)$ and all other groups that contain exponentially distorted elements cannot embed into ${\rm Aut}(X)$ when $h_{\rm top}(X)=0$. We further show that distortion in nilpotent groups gives a nontrivial obstruction to embedding such a group in any low complexity shift.

math.DS↗

arXiv2016

Free ergodic $\mathbb{Z}^2$-systems and complexity

Using results relating the complexity of a two dimensional subshift to its periodicity, we obtain an application to the well-known conjecture of Furstenberg on a Borel probability measure on $[0,1)$ which is invariant under both $x\mapsto px \pmod 1$ and $x\mapsto qx \pmod 1$, showing that any potential counterexample has a nontrivial lower bound on its complexity.

math.DS↗

arXiv2015

The automorphism group of a minimal shift of stretched exponential growth

The group of automorphisms of a symbolic dynamical system is countable, but often very large. For example, for a mixing subshift of finite type, the automorphism group contains isomorphic copies of the free group on two generators and the direct sum of countably many copies of $\mathbb{Z}$. In contrast, the group of automorphisms of a symbolic system of zero entropy seems to be highly constrained. Our main result is that the automorphism group of any minimal subshift of stretched exponential growth with exponent $<1/2$, is amenable (as a countable discrete group). For shifts of polynomial growth, we further show that any finitely generated, torsion free subgroup of Aut(X) is virtually nilpotent.

math.DS↗

arXiv2015

Counting generic measures for a subshift of linear growth

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 Boshernitzan's bound is sharp. We further prove that the same bound holds for the, a priori, larger set of nonatomic generic measures, and that this bound remains valid even if one drops the assumption of minimality. Applying these results to interval exchange transformations, we give an upper bound on the number of nonatomic generic measures of a minimal IET, answering a question recently posed by Chaika and Masur.

math.DS↗

arXiv2014

The automorphism group of a shift of linear growth: beyond transitivity

For a finite alphabet $\mathcal{A}$ and shift $X\subseteq\mathcal{A}^{\mathbb{Z}}$ whose factor complexity function grows at most linearly, we study the algebraic properties of the automorphism group ${\rm Aut}(X)$. For such systems, we show that every finitely generated subgroup of ${\rm Aut}(X)$ is virtually ${\mathbb Z}^d$, in contrast to the behavior when the complexity function grows more quickly. With additional dynamical assumptions we show more: if $X$ is transitive, then ${\rm Aut}(X)$ is virtually $\mathbb Z$; if $X$ has dense aperiodic points, then ${\rm Aut}(X)$ is virtually ${\mathbb Z}^d$. We also classify all finite groups that arise as the automorphism group of a shift.

math.DS↗

arXiv2014

Complexity and directional entropy in two dimensions

We study the directional entropy of the dynamical system associated to a $\Z^2$ configuration in a finite alphabet. We show that under local assumptions on the complexity, either every direction has zero topological entropy or some direction is periodic. In particular, we show that all nonexpansive directions in a $\Z^2$ system with the same local assumptions have zero directional entropy.

math.DS↗

arXiv2014

The automorphism group of a shift of subquadratic growth

For a subshift over a finite alphabet, a measure of the complexity of the system is obtained by counting the number of nonempty cylinder sets of length $n$. When this complexity grows exponentially, the automorphism group has been shown to be large for various classes of subshifts. In contrast, we show that subquadratic growth of the complexity implies that for a topologically transitive shift $X$, the automorphism group $\Aut(X)$ is small: if $H$ is the subgroup of $\Aut(X)$ generated by the shift, then $\Aut(X)/H$ is periodic.

math.DS↗

arXiv2013

Nonexpansive Z^2 subdynamics and Nivat's conjecture

For a finite alphabet $\A$ and $η\colon \Z\to\A$, the Morse-Hedlund Theorem states that $η$ is periodic if and only if there exists $n\in\N$ such that the block complexity function $P_η(n)$ satisfies $P_η(n)\leq n$, and this statement is naturally studied by analyzing the dynamics of a $\Z$-action associated to $η$. In dimension two, we analyze the subdynamics of a $\ZZ$-action associated to $η\colon\ZZ\to\A$ and show that if there exist $n,k\in\N$ such that the $n\times k$ rectangular complexity $P_η(n,k)$ satisfies $P_η(n,k)\leq nk$, then the periodicity of $η$ is equivalent to a statement about the expansive subspaces of this action. As a corollary, we show that if there exist $n,k\in\N$ such that $P_η(n,k)\leq \frac{nk}{2}$, then $η$ is periodic. This proves a weak form of a conjecture of Nivat in the combinatorics of words.

math.DS↗