SearcharxivSearch

arXiv · math/0506495

Still another approach to the braid ordering

Abstract

We develop a new approach to the linear ordering of the braid group $B\_n$, based on investigating its restriction to the set $\Div(Δ\_n^d)$ of all divisors of $Δ\_n^d$ in the monoid $B\_\infty^+$, i.e., to positive $n$-braids whose normal form has length at most $d$. In the general case, we compute several numerical parameters attached with the finite orders $(\Div(Δ\_n^d), <)$. In the case of 3 strands, we moreover give a complete description of the increasing enumeration of $(\Div(Δ\_3^d), <)$. We deduce a new and specially direct construction of the ordering on $B\_3$, and a new proof of the result that its restriction to $B\_3^+$ is a well-ordering of ordinal type $ω^ω$.

Explore related subjects

Keep this discovery

BibTeXRIS

Patrick Dehornoy. 2005-06-24. Still another approach to the braid ordering. https://arxiv.org/abs/math/0506495

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR