Diagram groups are totally orderable

dc.creatorGuba, Victor
dc.creatorSapir, Mark
dc.date2003-05-10
dc.date.accessioned2026-07-07T04:57:54Z
dc.date.available2026-07-07T04:57:54Z
dc.descriptionIn 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 $F$. As a result, we prove that all diagram groups are totally orderable.
dc.description22 pages
dc.identifierhttps://arxiv.org/abs/math/0305153
dc.identifierhttp://arxiv.org/abs/math/0305153
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/67427
dc.subjectGroup Theory
dc.subjectGeometric Topology
dc.subject20F65
dc.titleDiagram groups are totally orderable
dc.typetext

Files

Collections