Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
- Publication Type
Articles 1 - 7 of 7
Full-Text Articles in Dynamical Systems
Measure-Theoretically Mixing Subshifts With Low Complexity, Darren Creutz, Ronnie Pavlov, Shaun Rodock
Measure-Theoretically Mixing Subshifts With Low Complexity, Darren Creutz, Ronnie Pavlov, Shaun Rodock
Mathematics: Faculty Scholarship
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 : N → N with f (n)/n increasing and ∑ 1/f (n) < ∞, that there exists an extremely elevated staircase with word complexity p(n) = o(f (n)). This improves the previously lowest known complexity for mixing subshifts, resolving a conjecture of Ferenczi.
Local Finiteness And Automorphism Groups Of Low Complexity Subshifts, Ronnie Pavlov, Scott Schmieding
Local Finiteness And Automorphism Groups Of Low Complexity Subshifts, Ronnie Pavlov, Scott Schmieding
Mathematics: Faculty Scholarship
We prove that for any transitive subshift X with word complexity function cn(X), if lim inf(log(cn(X)/n)/(log log log n)) = 0, then the quotient group Aut(X, σ)/〈 σ〉 of the automorphism group of X by the subgroup generated by the shift σ is locally finite. We prove that significantly weaker upper bounds on cn(X) imply the same conclusion if the gap conjecture from geometric group theory is true. Our proofs rely on a general upper bound for the number of automorphisms of X of range n in terms of word complexity, which may be …
Subsystems Of Transitive Subshifts With Linear Complexity, Andrew Dykstra, Nicholas Ormes, Ronnie Pavlov
Subsystems Of Transitive Subshifts With Linear Complexity, Andrew Dykstra, Nicholas Ormes, Ronnie Pavlov
Mathematics: Faculty Scholarship
We bound the number of distinct minimal subsystems of a given transitive subshift of linear complexity, continuing work of Ormes and Pavlov [On the complexity function for sequences which are not uniformly recurrent. Dynamical Systems and Random Processes (Contemporary Mathematics, 736). American Mathematical Society, Providence, RI, 2019, pp. 125--137]. We also bound the number of generic measures such a subshift can support based on its complexity function. Our measure-theoretic bounds generalize those of Boshernitzan [A unique ergodicity of minimal symbolic flows with linear block growth. J. Anal. Math.44(1) (1984), 77–96] and are closely related to those of Cyr and Kra …
On Subshifts With Slow Forbidden Word Growth, Ronnie Pavlov
On Subshifts With Slow Forbidden Word Growth, Ronnie Pavlov
Mathematics: Faculty Scholarship
In this work, we treat subshifts, defined in terms of an alphabet A and (usually infinite) forbidden list F, where the number of n-letter words in F has ‘slow growth rate’ in n. We show that such subshifts are well behaved in several ways; for instance, they are boundedly supermultiplicative in the sense of Baker and Ghenciu [Dynamical properties of S-gap shifts and other shift spaces. J. Math. Anal. Appl.430(2) (2015), 633–647] and they have unique measures of maximal entropy with the K-property and which satisfy Gibbs bounds on large (measure-theoretically) sets. The main tool in our proofs is a …
Extensions Of The Morse-Hedlund Theorem, Eben Blaisdell
Extensions Of The Morse-Hedlund Theorem, Eben Blaisdell
Honors Theses
Bi-infinite words are sequences of characters that are infinite forwards and backwards; for example "...ababababab...". The Morse-Hedlund theorem says that a bi-infinite word f repeats itself, in at most n letters, if and only if the number of distinct subwords of length n is at most n. Using the example, "...ababababab...", there are 2 subwords of length 3, namely "aba" and "bab". Since 2 is less than 3, we must have that "...ababababab..." repeats itself after at most 3 letters. In fact it does repeat itself every two letters. …
Asymptotic Counting Formulas For Markoff-Hurwitz Tuples, Ryan Ronan
Asymptotic Counting Formulas For Markoff-Hurwitz Tuples, Ryan Ronan
Dissertations, Theses, and Capstone Projects
The Markoff equation is a Diophantine equation in 3 variables first studied in Markoff's celebrated work on indefinite binary quadratic forms. We study the growth of solutions to an n variable generalization of the Markoff equation, which we refer to as the Markoff-Hurwitz equation. We prove explicit asymptotic formulas counting solutions to this generalized equation with and without a congruence restriction. After normalizing and linearizing the equation, we show that all but finitely many solutions appear in the orbit of a certain semigroup of maps acting on finitely many root solutions. We then pass to an accelerated subsemigroup of maps …
Ergodic And Combinatorial Proofs Of Van Der Waerden's Theorem, Matthew Samuel Rothlisberger
Ergodic And Combinatorial Proofs Of Van Der Waerden's Theorem, Matthew Samuel Rothlisberger
CMC Senior Theses
Followed two different proofs of van der Waerden's theorem. Found that the two proofs yield important information about arithmetic progressions and the theorem. van der Waerden's theorem explains the occurrence of arithmetic progressions which can be used to explain such things as the Bible Code.