
TL;DR
This paper introduces a new framework for representing subshifts using structured labeled graphs and associated semigroups, establishing conditions for when such representations are possible.
Contribution
It develops a novel method for presenting subshifts via ${ m R}$-graph semigroups and characterizes the necessary and sufficient conditions for these presentations.
Findings
Defines properties (B) and (c) for subshifts
Establishes conditions under which subshifts have ${ m R}$-graph semigroup presentations
Links properties (A), (B), and (c) to topological conjugacy with structured graph presentations
Abstract
We consider partitioned graphs, by which we mean finite strongly connected directed graphs with a partitioned edge set . With additionally given a relation between the edges in and the edges in , and denoting the vertex set of the graph by , we speak of an an -graph . From -graphs we construct semigroups (with zero) that we call -graph semigroups. We describe a method of presenting subshifts by means of suitably structured labelled directed graphs with vertex set , edge set , and a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
