Open Access
2007 Confluence theory for graphs
Adam Sikora, Bruce Westbury
Algebr. Geom. Topol. 7(1): 439-478 (2007). DOI: 10.2140/agt.2007.7.439

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 SU3–skein modules of cylinders over orientable surfaces.

Citation

Download Citation

Adam Sikora. Bruce Westbury. "Confluence theory for graphs." Algebr. Geom. Topol. 7 (1) 439 - 478, 2007. https://doi.org/10.2140/agt.2007.7.439

Information

Received: 9 October 2006; Accepted: 12 January 2007; Published: 2007
First available in Project Euclid: 20 December 2017

zbMATH: 1202.57004
MathSciNet: MR2308953
Digital Object Identifier: 10.2140/agt.2007.7.439

Subjects:
Primary: 57M15 , 57M27
Secondary: 05C10 , 16S15

Keywords: Confluence , Diamond Lemma , knot , link , skein , spider

Rights: Copyright © 2007 Mathematical Sciences Publishers

Vol.7 • No. 1 • 2007
MSP
Back to Top