On subshift presentations
Abstract
We consider partitioned graphs, by which we mean finite strongly connected directed graphs with a partitioned edge set E = E- E+. With additionally given a relation R between the edges in E- and the edges in E+ , and denoting the vertex set of the graph by P, we speak of an an R-graph G R( P, E-, E+) . From R-graphs G R( P, E-, E+) we construct semigroups (with zero) S R( P, E-, E+) that we call R-graph semigroups. We describe a method of presenting subshifts by means of suitably structured labelled directed graphs ( V, ,λ) with vertex set V, edge set , and a label map that asigns to the edges in labels in an R-graph semigroup S R( P, E-, E-). We call the presented subshift an S R( P, E-, E-)-presentation. We introduce a Property (B) and a Property (c), tof subshifts, and we introduce a notion of strong instantaneity. Under an assumption on the structure of the R-graphs G R( P, E-, E-) we show for strongly instantaneous subshifts with Property (A) and associated semigroup S R( P, E-, E-), that Properties (B) and (c) are necessary and sufficient for the existence of an S R( P, E-, E-)-presentation, to which the subshift is topologically conjugate,
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.