{"id":{"repo_id":"denver","oai_identifier":"oai:digitalcommons.du.edu:etd-3978"},"canonical_url":"https://search.ndltd.org/etd/denver/oai:digitalcommons.du.edu:etd-3978","repository":{"repo_id":"denver","name":"University of Denver","base_url":"https://digitalcommons.du.edu/do/oai/"},"display":{"title":"Some Results in Maximal Pattern Complexity","abstract":"For 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.","abstract_html":"For 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.","abstract_has_math":false,"creators":["Schlortt, Casey"],"institution":null,"degree_name":"Ph.D. in Mathematics","degree_level":"Dissertation","degree_discipline":null,"degree_department":null,"school":null,"contributors":["Ronnie Pavlov","Nicholas Ormes","Anh N. Le","Mei Yin"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:55:22Z","subjects":["maximal pattern Complexity","Symbolic dynamics","Discrete Mathematics and Combinatorics","Mathematics"],"languages":["English (eng)"],"rights":["<p>Copyright is held by the author. User is responsible for all copyright compliance.</p>","Casey Schlortt"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["ETDCRP.2026.121","<a href=\"https://doi.org/10.56902/ETDCRP.2026.121\">https://doi.org/10.56902/ETDCRP.2026.121</a>","https://digitalcommons.du.edu/etd/2742"],"render_values":[{"text":"ETDCRP.2026.121","href":null,"code":true},{"text":"<a href=\"https://doi.org/10.56902/ETDCRP.2026.121\">https://doi.org/10.56902/ETDCRP.2026.121</a>","href":"https://doi.org/10.56902/ETDCRP.2026.121\">https://doi.org/10.56902/ETDCRP.2026.121</a>","code":true},{"text":"https://digitalcommons.du.edu/etd/2742","href":"https://digitalcommons.du.edu/etd/2742","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/10.56902/ETDCRP.2026.121","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/10.56902/ETDCRP.2026.121","record_label":"Repository record","record_kind":"doi","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.du.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.du.edu%3Aetd-3978","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Ronnie Pavlov","Nicholas Ormes","Anh N. Le","Mei Yin"]},{"key":"dc:creator","label":"Author","values":["Schlortt, Casey"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.copyright","label":"Dc Date Copyright","values":["2026-06-01T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2026-06-12T07:00:00Z"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D. in Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["maximal pattern Complexity","Symbolic dynamics","Discrete Mathematics and Combinatorics","Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English (eng)"]},{"key":"dc:rights","label":"Dc Rights","values":["<p>Copyright is held by the author. User is responsible for all copyright compliance.</p>"]},{"key":"dc:rights.holder","label":"Dc Rights Holder","values":["Casey Schlortt"]},{"key":"dc:rights.license","label":"Dc Rights License","values":["all_rights_reserved"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["ETDCRP.2026.121","https://doi.org/10.56902/ETDCRP.2026.121","<a href=\"https://doi.org/10.56902/ETDCRP.2026.121\">https://doi.org/10.56902/ETDCRP.2026.121</a>","https://digitalcommons.du.edu/etd/2742"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["For 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."]},{"key":"dc:description.provenance","label":"Dc Description Provenance","values":["Received from ProQuest"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:format.extent","label":"Dc Format Extent","values":["78 pgs","440 KB"]},{"key":"dc:title","label":"Title","values":["Some Results in Maximal Pattern Complexity"]}]}],"canonical_facts":{"dc:contributor":["Ronnie Pavlov","Nicholas Ormes","Anh N. Le","Mei Yin"],"dc:creator":["Schlortt, Casey"],"dc:date.copyright":["2026-06-01T07:00:00Z"],"dc:date.created":["2026-06-12T07:00:00Z"],"dc:description.abstract":["For 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."],"dc:description.provenance":["Received from ProQuest"],"dc:format":["application/pdf"],"dc:format.extent":["78 pgs","440 KB"],"dc:identifier":["ETDCRP.2026.121","https://doi.org/10.56902/ETDCRP.2026.121","<a href=\"https://doi.org/10.56902/ETDCRP.2026.121\">https://doi.org/10.56902/ETDCRP.2026.121</a>","https://digitalcommons.du.edu/etd/2742"],"dc:language":["English (eng)"],"dc:rights":["<p>Copyright is held by the author. User is responsible for all copyright compliance.</p>"],"dc:rights.holder":["Casey Schlortt"],"dc:rights.license":["all_rights_reserved"],"dc:subject":["maximal pattern Complexity","Symbolic dynamics","Discrete Mathematics and Combinatorics","Mathematics"],"dc:title":["Some Results in Maximal Pattern Complexity"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D. in Mathematics"]},"updated_at":"2026-11-19T07:55:22Z"}