2000 character limit reached
Williams' and Graded Equivalence Conjectures for small graphs (2411.01741v2)
Published 4 Nov 2024 in math.RA and math.OA
Abstract: We prove what might have been expected: The Williams Conjecture in symbolic dynamics and Graded Morita Equivalence Conjecture for Leavitt/$C*$-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/$C*$-graph algebras are graded/equivariant Morita equivalent.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.