Confluence Theory for Graphs
By Adam S. Sikora, Bruce W. Westbury. 2006
58 citations recorded by the source corpus.
We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie algebra of rank at most 2, gives rise to a confluent system of reduction rules of graphs (via Kuperberg's spiders) in an arbitrary surface. As a further consequence of this result, we find canonical bases of SU_3-skein modules of cylinders over orientable surfaces.
Subfields: Geometry and Topology, Mathematical Physics
View Paper: https://www.semanticscholar.org/paper/3ee160977205164711de3b210bf12d41fcfa74b4
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Geometry and Topology
- S. Morrison
- David E. V. Rose
- Bob Coecke
- Hoel Queffelec
- Paul Wedrich
- Aaron D. Lauda
- Ben Elias
- C. Blanchet
In Mathematical Physics
- S. Morrison
- David E. V. Rose
- Bob Coecke
- Hoel Queffelec
- Paul Wedrich
- Aaron D. Lauda
- Ben Elias
- C. Blanchet
Citations in the corpus
- A diagrammatic category for the representation theory of ( Uqsln ) (2007, background): “• Try to find a ‘confluent’ set of relations, according to the definition of [ 35 ].”