On flow-equivalence of R-graph shifts
Abstract
We show that Property (A) of subshifts and the semigroup, that is associated to subshifts with Property (A), are invariants of flow equivalence. We show for certain R-graphs that their isomorphism is implied by the flow equivalence of their R-graph shifts.
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.