SearcharxivSearch

arXiv · 2302.03403

Simply-laced mixed-sign Coxeter groups, with an associate graph is a line or a simple cycle

Abstract

In 2011 Eriko Hironaka introduced an interesting generalization of Coxeter groups, motivated by studying certain mapping classes. The generalization is by labeling the vertices of a Coxeter graph either by +1 or by -1, and then generalizing the standard geometric representation of the associated Coxeter group by concerning the labels of the vertices. The group which Hironaka get by that generalization is called mixed-sign Coxeter group. In this paper we classify the simply-laced mixed-sign Coxeter groups where the associated graph is either a line or a simple cycle. We show that all the defining relations of the mixed-sign Coxeter groups with the mentioned associated graph (either a line or a simple cycle) are squares or cubes of a product of conjugates of two generators of the mixed-sign Coxeter group and are strongly connected to the labels of the vertices of the associated graph.

Explore related subjects

Keep this discovery

BibTeXRIS

Yiska Efrat Aharoni, Robert Shwartz. 2023-02-07. Simply-laced mixed-sign Coxeter groups, with an associate graph is a line or a simple cycle. https://arxiv.org/abs/2302.03403

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