Vertex-transitive quantum graphs are defined by analogy to classical graphs and all simple examples in M3(C) are classified up to isomorphism via a new panoramic polynomial invariant.
So ltan, and Mateusz Wasilewski
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Vertex-transitive quantum graphs
Vertex-transitive quantum graphs are defined by analogy to classical graphs and all simple examples in M3(C) are classified up to isomorphism via a new panoramic polynomial invariant.