Williams' and Graded Equivalence Conjectures for small graphs
Roozbeh Hazrat, Elizabeth Pacheco

TL;DR
This paper proves that for small graphs with three vertices, the Williams and Graded Equivalence Conjectures hold, establishing equivalences between shift equivalence, strong shift equivalence, and Morita equivalence of associated algebras.
Contribution
It confirms the Williams and Graded Equivalence Conjectures for a specific class of small graphs, linking graph dynamics and algebraic equivalences.
Findings
Williams Conjecture holds for small graphs.
Graded Morita Equivalence Conjecture holds for small graphs.
Equivalence of shift and Morita equivalences in this class.
Abstract
We prove what might have been expected: The Williams Conjecture in symbolic dynamics and Graded Morita Equivalence Conjecture for Leavitt/-graph algebras hold for ``small graphs'', i.e., connected graphs with three vertices, no parallel edges, no sinks with no trivial hereditary and saturated subsets. Namely, two small graphs are shift equivalent if and only if they are strong shift equivalent if and only if their Leavitt/-graph algebras are graded/equivariant Morita equivalent.
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.
Taxonomy
TopicsLimits and Structures in Graph Theory · Rings, Modules, and Algebras · Advanced Topology and Set Theory
