Confluence Theory for Graphs
classification
🧮 math.QA
math.GT
keywords
graphsalgorithmconfluenceconfluentreductionrulessurfacessystem
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.