Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-10T16:34:47.982Z Has data issue: false hasContentIssue false

Subsystems of transitive subshifts with linear complexity

Published online by Cambridge University Press:  17 March 2021

ANDREW DYKSTRA
Affiliation:
Department of Mathematics, Hamilton College, Clinton, NY 13323, USA (e-mail: adykstra@hamilton.edu)
NICHOLAS ORMES
Affiliation:
Department of Mathematics, University of Denver, 2390 S. York St., Denver, CO 80208, USA (e-mail: nic.ormes@du.edu), url: www.math.du.edu/∼rpavlov/
RONNIE PAVLOV*
Affiliation:
Department of Mathematics, University of Denver, 2390 S. York St., Denver, CO 80208, USA (e-mail: nic.ormes@du.edu), url: www.math.du.edu/∼rpavlov/
*
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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 [Counting generic measures for a subshift of linear growth. J. Eur. Math. Soc. 21(2) (2019), 355–380].

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2021. Published by Cambridge University Press