Factorizable embeddings and the period of an irreducible sofic shift

Brian Marcus; Tom Meyerovitch; Klaus Thomsen; Chengyu Wu

Home/Archive/arXiv

arXiv · 2508.02554

Factorizable embeddings and the period of an irreducible sofic shift

Brian Marcus·Tom Meyerovitch·Klaus Thomsen·Chengyu Wu

View original source ↗Read source document ↗Export metadata ↓

Abstract

Generalizing a result of MacDonald we give necessary and sufficient conditions for an arbitrary subshift to embed into an irreducible sofic shift factoring through a given cover by an irreducible subshift of finite type (SFT). We obtain also necessary and sufficient conditions for an arbitrary subshift to embed into an irreducible sofic shift factoring through \emph{some} sliding block code out of an irreducible SFT. We do that when the code is required to be surjective, and hence a factor code, and when it is required to be injective or almost invertible, or is allowed to be arbitrary. These results require concepts of the period of an irreducible sofic shift as well as a concept of a $p$-periodic subshift. Several equivalent formulations of the period are developed.

Explore related subjects

math.DS

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Brian Marcus, Tom Meyerovitch, Klaus Thomsen, Chengyu Wu. 2025-09-06. Factorizable embeddings and the period of an irreducible sofic shift. https://arxiv.org/abs/2508.02554

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS↗

arXiv2026

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS↗

arXiv2026

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS↗