Diagram groups are totally orderable
群论
2007-05-23 v1 几何拓扑
摘要
In this paper, we introduce the concept of the independence graph of a directed 2-complex. We show that the class of diagram groups is closed under graph products over independence graphs of rooted 2-trees. This allows us to show that a diagram group containing all countable diagram groups is a semi-direct product of a partially commutative group and R. Thompson's group . As a result, we prove that all diagram groups are totally orderable.
引用
@article{arxiv.math/0305153,
title = {Diagram groups are totally orderable},
author = {Victor Guba and Mark Sapir},
journal= {arXiv preprint arXiv:math/0305153},
year = {2007}
}
备注
22 pages