A uniform model for almost convexity and rewriting systems
Group Theory
2014-10-10 v1
Abstract
We introduce a topological property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a particular finite presentation. We also define algorithmically stackable groups, for which this procedure is an algorithm. This property gives a common model for algorithms arising from both rewriting systems and almost convexity for groups.
Cite
@article{arxiv.1410.2342,
title = {A uniform model for almost convexity and rewriting systems},
author = {Mark Brittenham and Susan Hermiller},
journal= {arXiv preprint arXiv:1410.2342},
year = {2014}
}
Comments
This paper was derived from part of the paper at arXiv:1109.6309