Search arXivSearch

arXiv · 0705.2623

Densely ordered braid subgroups

Abstract

Dehornoy showed that the Artin braid groups $B_n$ are left-orderable. This ordering is discrete, but we show that, for $n >2$ the Dehornoy ordering, when restricted to certain natural subgroups, becomes a dense ordering. Among subgroups which arise are the commutator subgroup and the kernel of the Burau representation (for those $n$ for which the kernel is nontrivial). These results follow from a characterization of least positive elements of any normal subgroup of $B_n$ which is discretely ordered by the Dehornoy ordering.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Adam Clay, Dale Rolfsen. 2007-05-18. Densely ordered braid subgroups. https://arxiv.org/abs/0705.2623

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Margulis-Soifer theorem for one-relator groups

We establish the Margulis-Soifer dichotomy for one-relator groups: every one-relator group is either virtually solvable or has a maximal subgroup of infinite index. We also present examples of one-relator groups with and without free maximal subgroups of infinite index, as well as examples that possess both free and non-free infinite index maximal subgroups. Triviality of the Frattini subgroup is also shown for all non-solvable one-relator groups. We close the paper with a short list of questions.

math.GR

Finite quotients of spherical Artin groups

We show the smallest non-abelian quotients of spherical and affine Artin groups are isomorphic to the smallest non-abelian quotients of the corresponding Coxeter groups. We deduce irreducible spherical Artin groups are determined by their finite quotient groups.

math.GR

Cosets with constant characteristic polynomial

Let H be a linear group. We show that if there is an invertible matrix x such that all the elements of xH share the same characteristic polynomial then H is virtually solvable. There are plenty of applications that will be presented in future paper. Here, we discuss some applications to the generalized Weigold conjecture and present an alternative straightforward proof of the Formanek--Procesi nonlinearity theorem for Aut(F_n), n>2, over every field. When n>5 our non-linearity proof gives a stronger result than the original Formanek--Procesi theorem.

math.GR