Matching groups and gliding systems
arXiv:1401.3282 · doi:10.1016/j.geomphys.2014.03.009
Abstract
With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems.
24 pages, 1 figure. This paper generalizes and replaces my paper on dimer spaces, arXiv:1211.3975