$ S $-gap shifts are a well-studied class of shift spaces which have led to several proposed generalizations. This paper introduces a new class of shift spaces called $ \mathcal{S} $-graph shifts whose essential structure is encoded in a novel way, as a finite directed graph with a set of natural numbers assigned to each vertex. $ \mathcal{S} $-graph shifts contain $ S $-gap shifts and their generalizations, as well as all vertex shifts and SFTs, as special cases, thereby providing a method to study these shift spaces in a uniform way. The main result in this paper is a formula for the entropy of any $ \mathcal{S} $-graph shift, which, by specialization, resolves a problem proposed by Matson and Sattler. A second result establishes an explicit formula for the zeta functions of $ \mathcal{S} $-graph shifts. Additionally, we show that every entropy value is obtained by uncountably many $ \mathcal{S} $-graph shifts.
Citation: |
[1] |
D. Ahmadi Dastjerdi and S. Jangjoo, Computations on sofic $S$-gap shifts, Qualitative Theory of Dynamical Systems, 12 (2013), 393-406.
doi: 10.1007/s12346-013-0096-2.![]() ![]() ![]() |
[2] |
D. Ahmadi Dastjerdi and S. Jangjoo, Dynamics and topology of $S$-gap shifts, Topology and its Applications, 159 (2012), 2654-2661.
doi: 10.1016/j.topol.2012.04.002.![]() ![]() ![]() |
[3] |
D. Ahmadi Dastjerdi and S. Jangjooye Shaldehi, Equivalencies between beta-shifts and $S$-gap shifts, Turkish Journal of Mathematics, 39 (2015), 212-227.
doi: 10.3906/mat-1406-32.![]() ![]() ![]() |
[4] |
D. Amahdi Dastjerdi and S. Jangjooye Shaldehi, $(S, S')$-gap shifts as a generalization of run-length-limited codes, British Journal of Mathematics and Computer Science, 4 (2014), 2765-2780.
doi: 10.9734/BJMCS/2014/11488.![]() ![]() |
[5] |
S. Baker and A. E. Ghenciu, Dynamical properties of $S$-gap shifts and other shift spaces, Journal of Mathematical Analysis and Applications, 430 (2015), 633-647.
doi: 10.1016/j.jmaa.2015.04.092.![]() ![]() ![]() |
[6] |
R. Bowen, Some systems with unique equilibrium states, Mathematical Systems Theory, 8 (1974), 193-202.
doi: 10.1007/BF01762666.![]() ![]() ![]() |
[7] |
V. Climenhaga and D. J. Thompson, Intrinsic ergodicity beyond specification: $\beta$-shifts, $S$-gap shifts, and their factors, Israel Journal of Mathematics, 192 (2012), 785-817.
doi: 10.1007/s11856-012-0052-x.![]() ![]() ![]() |
[8] |
F. García-Ramos and R. Pavlov, Extender sets and measures of maximal entropy for subshifts, London Mathematical Society, 100 (2019), 1013-1033.
doi: 10.1112/jlms.12252.![]() ![]() ![]() |
[9] |
D. Lind and B. Marcus, An Introduction to Symbolic Dynamics and Coding, 2$^{\text{nd}}$ ed., Cambridge University Press, Cambridge 2021.
![]() ![]() |
[10] |
B. Matson and E. Sattler, $\mathcal{S}$-limited shifts, Real Analysis Exchange, 43 (2018), 393-416.
doi: 10.14321/realanalexch.43.2.0393.![]() ![]() ![]() |
[11] |
R. Naulin and C. Pabst, The roots of a polynomial depend continuously on its coefficients, Revista Colombiana de Matemáticas, 28 (1994), 35-37.
![]() ![]() |
[12] |
R. Pavlov, On entropy and intrinsic ergodicity of coded subshifts, Proceedings of the American Mathematical Society, 148 (2020), 4717-4731.
doi: 10.1090/proc/15145.![]() ![]() ![]() |
[13] |
K. Petersen, Chains, entropy, coding, Ergodic Theory and Dynamical Systems, 6 (1986), 415-448.
doi: 10.1017/S014338570000359X.![]() ![]() ![]() |
[14] |
A. Rényi, Representations for real numbers and their ergodic properties, Acta Mathematica Academiae Scientiarum Hungarica, 8 (1957), 477-493.
doi: 10.1007/BF02020331.![]() ![]() ![]() |
[15] |
C. Spandl, Computing the topological entropy of shifts, Mathematical Logic Quarterly, 53 (2007), 493-510.
doi: 10.1002/malq.200710014.![]() ![]() ![]() |