3 papers
math.DS2026
A Krieger Embedding Theorem for Near Markov Sofic Shifts
Brian Marcus, Tom Meyerovitch, Chengyu Wu
Krieger's classical embedding theorem gives necessary and sufficient conditions for embedding a subshift into a mixing shift of finite type (SFT) as a proper subshift. The same res…
math.DS2025
Factorizable embeddings and the period of an irreducible sofic shift
Brian Marcus, Tom Meyerovitch, Klaus Thomsen +1
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…
math.DS2024
Shifts of Finite Type Obtained by Forbidding a Single Pattern
Nishant Chandgotia, Brian Marcus, Jacob Richey +1
Given a finite word , Guibas and Odlyzko (J. Combin. Theory Ser. A, 30, 1981, 183-208) showed that the autocorrelation polynomial of , which records the set of self-…