Skip to content
DraconiticResearch
Search Sources API
190,851 studies31 sourcesUpdated 54 min ago
PreprintarXiv licencearXiv

Lifts of strictly ergodic subshifts by permutative sliding block codes

  • Zeyu Kang
  • Tobias Jäger
Open at sourcePDFDOICite

Abstract

Permutative sliding block codes - in the sense of Hedlund - give rise to finite-to- one extensions of subshifts. We provide criteria under which minimality and unique ergodicity are preserved by this 'lifting procedure'. These findings are illustrated by means of some nat- ural example families, which we use to obtain strictly ergodic finite-to-one extensions of sub- stitution subshifts (including the case of Fibonacci, Tribonacci, silver mean and noble means substitutions). We further study the interplay between permutative sliding block codes and Toeplitz flows. In particular, we find examples which demonstrate that a permutative lift of a strictly ergodic subshift may be minimal, but not uniquely ergodic - a phenomenon which cannot occur for primitive substitution subshifts.

Related

  1. Strictly convex ergodic billiards
    Wentao Fan, Boris Hasselblatt
    arXivPreprintCC BY 4.0Full textDynamical systemsMathematical physicsarXiv
  2. Generating Forbidden Words and Measures of Maximal Entropy for Subshifts
    Xinxing Wu, Xu Zhang
    arXivPreprintCC BY-NC-ND 4.0Full textDynamical systemsarXiv
  3. Maximizing Measures for Subadditive and Almost-Additive Potentials on Countable-Alphabet Subshifts
    Ricardo Freire, Juliano S. Gonschorowski
    arXivPreprintarXiv licenceFull textDynamical systemsarXiv
  4. On the centralizer and normalizer groups of odometers and Toeplitz subshifts
    Jaime Gómez, Samuel Petite
    arXivPreprintCC BY 4.0Full textDynamical systemsarXiv
  5. Entropy and complexity in a strong orbit equivalence class via pseudo-Toeplitz subshifts
    Paulina Cecchi-Bernales, Sebastián Donoso
    arXivPreprintarXiv licenceFull textDynamical systemsarXiv

Cite

BibTeXRIS
BibTeX
@misc{kang2026lifts,
  title = {{Lifts of strictly ergodic subshifts by permutative sliding block codes}},
  author = {Zeyu Kang and Tobias Jäger},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.01140},
  eprint = {2609.01140},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.01140},
}
RIS
TY  - UNPB
TI  - Lifts of strictly ergodic subshifts by permutative sliding block codes
AU  - Zeyu Kang
AU  - Tobias Jäger
PY  - 2026
DA  - 2026/09/01
PB  - arXiv
DO  - 10.48550/arxiv.2609.01140
UR  - https://arxiv.org/abs/2609.01140
AB  - Permutative sliding block codes - in the sense of Hedlund - give rise to finite-to- one extensions of subshifts. We provide criteria under which minimality and unique ergodicity are preserved by this 'lifting procedure'. These findings are illustrated by means of some nat- ural example families, which we use to obtain strictly ergodic finite-to-one extensions of sub- stitution subshifts (including the case of Fibonacci, Tribonacci, silver mean and noble means substitutions). We further study the interplay between permutative sliding block codes and Toeplitz flows. In particular, we find examples which demonstrate that a permutative lift of a strictly ergodic subshift may be minimal, but not uniquely ergodic - a phenomenon which cannot occur for primitive substitution subshifts.
ER  -