Abstract
dc:description.abstractFor a finite alphabet π and a sequence π₯ β πββ¬ , Kamae and Zamboni combined the ideas of block complexity and topological sequence entropy to define the maximal pattern complexity, πβπ (π₯). They defined an aperiodic sequence π₯ over two letters as pattern Sturmian if it had the lowest possible maximal pattern complexity, 2π. Later, Kamae and Rao extended their definition of pattern Sturmian sequences to be sequences over β β₯ 2 letters which are not periodic by projection and have maximal pattern complexity βπ. This dissertation answers a question posed by Kamae and Zamboni by characterizing recurrent pattern Sturmian sequences as either a coding of an irrational circle rotation by two intervals, or an element of a nearly simple Toeplitz subshift. We also show that nonrecurrent pattern Sturmian sequences are either very close to constant (such examples were given by Kamae and Zamboni) or a (nonrecurrent) coding of an irrational circle rotation by two intervals. We further examine the structure of sequences over more than two letters which have low maximal pattern complexity and provide a characterization for the structure of sequence over more than two letters with the lowest possible maximal pattern complexity.
Degree
thesis:*- Name thesis:degree_name
- Ph.D. in Mathematics
- Level thesis:degree_level
- Dissertation
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Schlortt, Casey
- Contributors dc:contributor
-
- Ronnie Pavlov
- Nicholas Ormes
- Anh N. Le
- Mei Yin
Subjects
dc:subject × 4Rights
dc:rights- Statement dc:rights
-
- <p>Copyright is held by the author. User is responsible for all copyright compliance.</p>
- Casey Schlortt
- Language dc:language
- English (eng)