activity
20102026
most citedThe relationship between word complexity and computational complexity in subshifts

1 citations · 1 across the 6 of their papers we have counts for

collaborators
Showing math.DSShow all

8 papers · 1 filter

math.DS2026

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…

math.DS2022

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…

math.DS2021

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…

math.DS2020

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…

math.DS2019

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…

math.DS2018

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…