On supersolvable reflection arrangements

Torsten Hoge; Gerhard Roehrle

Home/Archive/arXiv

arXiv · 1209.1919

On supersolvable reflection arrangements

Torsten Hoge·Gerhard Roehrle

View original source ↗Read source document ↗Export metadata ↓

Abstract

Let A = (A,V) be a complex hyperplane arrangement and let L(A) denote its intersection lattice. The arrangement A is called supersolvable, provided its lattice L(A) is supersolvable, a notion due to Stanley. Jambu and Terao showed that every supersolvable arrangement is inductively free, a notion due to Terao. So this is a natural subclass of this particular class of free arrangements. Suppose that W is a finite, unitary reflection group acting on the complex vector space V. Let A = (A(W), V) be the associated hyperplane arrangement of W. In a recent paper, we determined all inductively free reflection arrangements. The aim of this note is to classify all supersolvable reflection arrangements. Moreover, we characterize the irreducible arrangements in this class by the presence of modular elements of rank 2 in their intersection lattice.

Explore related subjects

math.GR math.CO

Keep this discovery

BibTeX RIS

Torsten Hoge, Gerhard Roehrle. 2012-09-10. On supersolvable reflection arrangements. https://arxiv.org/abs/1209.1919

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗