23 citations · 78 across the 31 of their papers we have counts for
38 papers
Periodic structure and Schrodinger operators for codings of circle rotations
Luke Hetzel, Ronnie Pavlov
We consider, for any irrational and interval , the 2-interval coding subshift induced by coding orbits under repeated rotation by via mem…
Stable covers of subshifts
Solly Coles, Van Cyr, Bryna Kra +1
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…
Computability of Pressure for Subshifts on Countable Amenable Groups
C. Evans Hedges, Ronnie Pavlov
There are a variety of results in the literature proving forms of computability for topological entropy and pressure on subshifts. In this work, we prove two quite general results,…
The extended Hausdorff dimension spectrum of a conformal iterated function system is maximal
Andrei E. Ghenciu, Ronnie Pavlov
For any conformal iterated function system (CIFS) consisting of finitely or countably many maps, and any closed shift-invariant set of right-infinite sequences of such maps, one ca…
Minimal zero entropy subshifts can be unrestricted along any sparse set
Ronnie Pavlov
We present a streamlined proof of a result essentially present in previous work of the author, namely that for every set of zero Banac…
On minimal subshifts of linear word complexity with slope less than 3/2
Darren Creutz, Ronnie Pavlov
We prove that every infinite minimal subshift with word complexity satisfying is measure-theoretically isomorphic to its maximal equicontinuous factor…
Low Complexity Subshifts have Discrete Spectrum
Darren Creutz, Ronnie Pavlov
We prove results about subshifts with linear (word) complexity, meaning that , where for every , is the number of -letter words appear…
Measures of maximal entropy of bounded density shifts
Felipe García-Ramos, Ronnie Pavlov, Carlos Reyes
We find sufficient conditions for bounded density shifts to have a unique measure of maximal entropy. We also prove that every measure of maximal entropy of a bounded density shift…
On the structure of generic subshifts
Ronnie Pavlov, Scott Schmieding
We investigate generic properties (i.e. properties corresponding to residual sets) in the space of subshifts with the Hausdorff metric. Our results deal with four spaces: the space…
Subsystem entropies of shifts of finite type and sofic shifts on countable amenable groups
Robert Bland, Kevin McGoff, Ronnie Pavlov
In this work we study the entropies of subsystems of shifts of finite type (SFTs) and sofic shifts on countable amenable groups. We prove that for any countable amenable group ,…
Measure-Theoretically Mixing Subshifts with Low Complexity
Darren Creutz, Ronnie Pavlov, Shaun Rodock
We introduce a class of rank-one transformations, which we call extremely elevated staircase transformations. We prove that they are measure-theoretically mixing and, for any $f :…
Local finiteness and automorphism groups of low complexity subshifts
Ronnie Pavlov, Scott Schmieding
We prove that for any transitive subshift with word complexity function , if , then the quotient group $\textrm{Au…
Ubiquity of entropies of intermediate factors
Kevin McGoff, Ronnie Pavlov
We consider topological dynamical systems , where is a compact metrizable space and denotes an action of a countable amenable group on by homeomorphisms. For…
On subshifts with slow forbidden word growth
Ronnie Pavlov
In this work, we treat subshifts, defined in terms of an alphabet and (usually infinite) forbidden list , where the number of -letter words in has "slow growth rate"…
On the complexity function for sequences which are not uniformly recurrent
Nic Ormes, Ronnie Pavlov
We prove that every non-minimal transitive subshift satisfying a mild aperiodicity condition satisfies , and give a class of examples which show…
Subsystems of transitive subshifts with linear complexity
Andrew Dykstra, Nicholas Ormes, Ronnie Pavlov
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…
The relationship between word complexity and computational complexity in subshifts
Ronnie Pavlov, Pascal Vanier
We prove several results about the relationship between the word complexity function of a subshift and the set of Turing degrees of points of the subshift, which we call the Turing…
Learning Moment Closure in Reaction-Diffusion Systems with Spatial Dynamic Boltzmann Distributions
Oliver K. Ernst, Tom Bartol, Terrence Sejnowski +1
Many physical systems are described by probability distributions that evolve in both time and space. Modeling these systems is often challenging to due large state space and analyt…
On entropy and intrinsic ergodicity of coded subshifts
Ronnie Pavlov
Any coded subshift X defined by a set C of code words contains a subshift, which we call L, consisting of limits of single code words. We show that when C satisfies a unique decomp…
Follower, Predecessor, and Extender Entropies
Thomas French, Ronnie Pavlov
Using follower/predecessor/extender set sequences, we define quantities which we call the follower/predecessor/extender entropies, which can be associated to any shift space. We an…
Factor maps and embeddings for random shifts of finite type
Kevin McGoff, Ronnie Pavlov
For any , random shifts of finite type (SFTs) were defined in previous work of the authors. For a parameter , an alphabet , and a…
On non-uniform specification and uniqueness of the equilibrium state in expansive systems
Ronnie Pavlov
In [2], Bowen showed that for an expansive system (X, T) with specification and a potential with the Bowen property, the equilibrium state is unique and fully supported. We general…
Factoring onto subshifts with the finite extension property
Raimundo Briceño, Kevin McGoff, Ronnie Pavlov
We define the finite extension property for -dimensional subshifts, which generalizes the topological strong spatial mixing condition defined by Briceño (2016), and we prove tha…
One-sided almost specification and intrinsic ergodicity
Vaughn Climenhaga, Ronnie Pavlov
Shift spaces with the specification property are intrinsically ergodic, i.e. they have a unique measure of maximal entropy. This can fail for shifts with the weaker almost specific…