SearcharxivSearch

arXiv · 2004.09905

Automorphisms of odd Coxeter groups

Abstract

An odd Coxeter group $W$ is one which admits a Coxeter system $(W,S)$ for which all the exponents $m_{ij}$ are either odd or infinity. The paper investigates the family of odd Coxeter groups whose associated labeled graphs $\mathcal{V}_{(W,S)}$ are trees. It is known that two Coxeter groups in this family are isomorphic if and only if they admit Coxeter systems having the same rank and the same multiset of finite exponents. In particular, each group in this family is isomorphic to a group that admits a Coxeter system whose associated labeled graph is a star shaped tree. We give the complete description of the automorphism group of this group, and derive a sufficient condition for the splitting of the automorphism group as a semi-direct product of the inner and the outer automorphism groups. As applications, we prove that Coxeter groups in this family satisfy the $R_\infty$-property and are (co)-Hopfian. We compare structural properties, automorphism groups, $\R_\infty$-property and (co)-Hopfianity of a special odd Coxeter group whose only finite exponent is three with the braid group and the twin group.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tushar Kanta Naik, Mahender Singh. 2020-11-28. Automorphisms of odd Coxeter groups. https://doi.org/10.1007/s00605-020-01496-3

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