SearcharxivSearch

arXiv · math/0502269

A class of reflection rigid Coxeter systems

Abstract

In this paper, we give a class of reflection rigid Coxeter systems. Let $(W,S)$ be a Coxeter system. Suppose that (1) for each $s,t\in S$ such that $m(s,t)$ is odd, $\{s,t\}$ is a maximal spherical subset of $S$, (2) there does not exist a three-points subset $\{s,t,u\}\subset S$ such that $m(s,t)$ and $m(t,u)$ are odd, and (3) for each $s,t\in S$ such that $m(s,t)$ is odd, the number of maximal spherical subsets of $S$ intersecting with $\{s,t\}$ is at most two, where $m(s,t)$ is the order of $st$ in the Coxeter group $W$. Then we show that the Coxeter system $(W,S)$ is reflection rigid. This is an extension of a result of N.Brady, J.P.McCammond, B.Mühlherr and W.D.Neumann.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tetsuya Hosaka. 2005-02-13. A class of reflection rigid Coxeter systems. https://arxiv.org/abs/math/0502269

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