pith. sign in

arxiv: math/0305153 · v1 · submitted 2003-05-10 · 🧮 math.GR · math.GT

Diagram groups are totally orderable

classification 🧮 math.GR math.GT
keywords diagramgroupsgroupgraphindependenceorderabletotallyallows
0
0 comments X
read the original abstract

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 $F$. As a result, we prove that all diagram groups are totally orderable.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.