Skip to main navigation Skip to search Skip to main content

Confluence theory for graphs

  • University of Warwick

Research output: Contribution to journalArticlepeer-review

40 Scopus citations

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.

Original languageEnglish
Pages (from-to)439-478
Number of pages40
JournalAlgebraic and Geometric Topology
Volume7
Issue number1
DOIs
StatePublished - 2007

Keywords

  • Confluence
  • Diamond lemma
  • Knot
  • Link
  • Skein
  • Spider

Fingerprint

Dive into the research topics of 'Confluence theory for graphs'. Together they form a unique fingerprint.

Cite this