Papers
Topics
Authors
Recent
Search
2000 character limit reached

Orbit equivalence of graphs and isomorphism of graph groupoids

Published 31 Oct 2016 in math.DS, math.OA, and math.RA | (1610.09942v3)

Abstract: We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the (topological) isolated points of the boundary path space of a graph. As a result, we are able to show that the groupoids of two directed graphs with finitely many vertices and no sinks are isomorphic if and only if the two graphs are orbit equivalent, and that the groupoids of the stabilisations of two such graphs are isomorphic if and only if the stabilisations of the graphs are orbit equivalent.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.