On flow-equivalence of R-graph shifts

preprint2014arXivOpen access

Abstract

We show that Property (A)(A) of subshifts and the semigroup, that is associated to subshifts with Property (A), are invariants of flow equivalence. We show for certain R\mathcal R-graphs that their isomorphism is implied by the flow equivalence of their R\mathcal R-graph shifts.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.