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

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

collaborators

9 papers

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…

cs.DM20191 cited

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…

physics.bio-ph2018

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…