11 citations · 27 across the 7 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
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.DS2019★ 4 cited
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…