Polygonal Z2-subshifts

John Franks, Bryna Kra*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


Let (Formula presented.) 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 (Formula presented.) is uniquely determined by the labeling of all other points in the polygon. We introduce a class of (Formula presented.) -shift systems, the polygonal shifts, determined by such a polygon: These are shift systems such that the restriction of any (Formula presented.) to some polygon (Formula presented.) 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 also many other systems. We give necessary conditions for a (Formula presented.) -system (Formula presented.) to be polygonal, in terms of the nonexpansive subspaces of (Formula presented.), and under further conditions can give a complete characterization for such systems.

Original languageEnglish (US)
Pages (from-to)252-286
Number of pages35
JournalProceedings of the London Mathematical Society
Issue number2
StatePublished - Aug 1 2020


  • 37B10
  • 37B15
  • 37B40
  • 37B50 (primary)

ASJC Scopus subject areas

  • Mathematics(all)


Dive into the research topics of 'Polygonal Z2-subshifts'. Together they form a unique fingerprint.

Cite this