SearcharxivSearch

arXiv · math/0404528

Braids and Permutations

Abstract

E. Artin described all irreducible representations of the braid group B_k to the symmetric group S(k). We strengthen some of his results and, moreover, exhibit a complete picture of homomorphisms of B_k to S(n) for n<2k+1. We show that the image of such ahomomorphism f is cyclic whenever either (*) n 6 there exist, up to conjugation, exactly 3 irreducible representations of B_k into S(2k) with non-cyclic images but they all are imprimitive. We use these results to prove that for n 4 the intersection PB_k\cap B'_k of PB_k with the commutator subgroup B'_k=[B_k,B_k] is a completely characteristic subgroup of B'_k.

Explore related subjects

Keep this discovery

BibTeXRIS

Vladimir Lin. 2004-04-29. Braids and Permutations. https://arxiv.org/abs/math/0404528

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