Polygonal Z2-subshifts

Abstract

Let P⊂ Z2 be a convex polygon with each vertex in it labeled by an element from a finite set and such that the labeling of each vertex v∈ P is uniquely determined by the labeling of all other points in the polygon. We introduce a class of Z2-shift systems, the polygonal shifts, determined by such a polygon: these are shift systems such that the restriction of any x∈ X to some polygon P has this property. These polygonal systems are related to various well studied classes of shift systems, including subshifts of finite type and algebraic shifts, but include many other systems. We give necessary conditions for a Z2-system X to be polygonal, in terms of the nonexpansive subspaces of X, and under further conditions can give a complete characterization for such systems.

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…