Generators and normal forms of Richard Thompson's group F and the four-color theorem

DOI10.1007/S10801-015-0643-9zbMATH Open1337.05038OpenAlexW2284269730MaRDI QIDQ289030FDOQ289030

Authors: Ryan Hicks, Kurt Virgin, John R. Donnelly 

Publication date: 27 May 2016

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-015-0643-9

zbMATH Keywords

binary treesThompson's groupfour-color theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Introductory notes on Richard Thompson's groups
• Map coloring and the vector cross product
• Minimal length elements of Thompson's group \(F\)
• Restricted rotation distance between binary trees.
• Coloring planar graphs via colored paths in the associahedra
• Title not available (Why is that?)

Cited In (1)

• Le coloriage des familles de positions équivalentes générales et spéciales dans les groupes d'espace bidimensionnels quadricolorés

This page was built for publication: Generators and normal forms of Richard Thompson's group \(F\) and the four-color theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289030)