Factor maps and embeddings for random Zd shifts of finite type

Abstract

For any d ≥ 1, random Zd shifts of finite type (SFTs) were defined in previous work of the authors. For a parameter α ∈ [0,1], an alphabet A, and a scale n ∈ N, one obtains a distribution of random Zd SFTs by randomly and independently forbidding each pattern of shape \1,…,n\d with probability 1-α from the full shift on A. We prove two main results concerning random Zd SFTs. First, we establish sufficient conditions on α, A, and a Zd subshift Y so that a random Zd SFT factors onto Y with probability tending to one as n tends to infinity. Second, we provide sufficient conditions on α, A and a Zd subshift X so that X embeds into a random Zd SFT with probability tending to one as n tends to infinity.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…