Factor maps and embeddings for random Z^d shifts of finite type

DOI10.1007/S11856-018-1822-XMaRDI QIDQ2631888zbMATH OpenOpenAlexFDO

Authors Kevin McGoff, Ronnie Pavlov

Publication date 16 May 2019

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1705.00042

zbMATH Keywords

finite extension propertyodometerrandom shifts

Mathematics Subject Classification ID

Symbolic dynamics (37B10)

Abstract: For any $dgeq1$, random $mathbb{Z}^d$ shifts of finite type (SFTs) were defined in previous work of the authors. For a parameter $alphain[0,1]$, an alphabet $mathcalA$, and a scale $ninmathbbN$, one obtains a distribution of random $mathbb{Z}^d$ SFTs by randomly and independently forbidding each pattern of shape ${1,dots,n}^d$ with probability $1-alpha$ from the full shift on $mathcalA$. We prove two main results concerning random $mathbb{Z}^d$ SFTs. First, we establish sufficient conditions on $alpha$, $mathcalA$, and a $mathbb{Z}^d$ subshift $Y$ so that a random $mathbb{Z}^d$ SFT factors onto $Y$ with probability tending to one as $n$ tends to infinity. Second, we provide sufficient conditions on $alpha$, $mathcalA$ and a $mathbb{Z}^d$ subshift $X$ so that $X$ embeds into a random $mathbb{Z}^d$ SFT with probability tending to one as $n$ tends to infinity.

Review text

The authors prove two results dealing with existence of factor maps and embeddings for random $\mathbb{Z}^d$-shift of finite type introduced by them in [J. Mod. Dyn. 10, 287--330 (2016; Zbl 1369.37023)]. Both results are based on a generalization of the second moment method allowing to obtain many patterns with prescribed repeated structure. \par Several open questions in this area are also presented at the end of article. One of them is related to the work of \textit{S. J. Lightwood} [Ergodic Theory Dyn. Syst. 23, No. 2, 587--609 (2003; Zbl 1031.37017)].

Recommendations

• Random \(\mathbb{Z}^d\)-shifts of finite type
• Morphisms from non-periodic \mathbb{Z}^{2} subshifts I: constructing embeddings from homomorphisms
• shifts of finite type without equal entropy full shift factors
• Factoring higher-dimensional shifts of finite type onto the full shift
• A class of $\mathbb {Z}^d$ shifts of finite type which factors onto lower entropy full shifts

Cites work

• Z^d Toeplitz arrays
• A characterization of the entropies of multidimensional shifts of finite type
• Characterizations of periods of multi-dimensional shifts
• Dynamics of self-similar tilings
• Entropy along convex shapes, random tilings and shifts of finite type
• Factoring onto \(\mathbb {Z}^d\) subshifts with the finite extension property
• Factors and extensions of full shifts
• Lower entropy factors of sofic systems
• Morphisms from non-periodic $\mathbb{Z}^2$ subshifts II: constructing homomorphisms to square-filling mixing shifts of finite type
• Morphisms from non-periodic \mathbb{Z}^{2} subshifts I: constructing embeddings from homomorphisms
• Multidimensional constant-length substitution sequences
• Multidimensional sofic shifts without separation and their factors
• On the dynamics and recursive properties of multidimensional symbolic systems
• On the subsystems of topological Markov chains
• Random \(\mathbb{Z}^d\)-shifts of finite type
• Random subshifts of finite type
• Tilings, substitution systems and dynamical systems generated by them
• Turing degrees of multidimensional SFTs

Cited in

(5)

• Finite orbits in random subshifts of finite type
• On intrinsic ergodicity of factors of subshifts
• Random \(\mathbb{Z}^d\)-shifts of finite type
• Random subshifts of finite type
• Pressure and escape rates for random subshifts of finite type

This page was built for publication: Factor maps and embeddings for random \(\mathbb{Z}^d\) shifts of finite type

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631888)