Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1208.3131

On inductively free reflection arrangements

Torsten Hoge·Gerhard Roehrle
View original source ↗Read source document ↗Export metadata ↓

Abstract

Suppose that W is a finite, unitary reflection group acting on the complex vector space V. Let A = A(W) be the associated hyperplane arrangement of W. Terao has shown that each such reflection arrangement A is free. There is the stronger notion of an inductively free arrangement. In 1992, Orlik and Terao conjectured that each reflection arrangement is inductively free. It has been known for quite some time that the braid arrangement as well as the Coxeter arrangements of type B and type D are inductively free. Barakat and Cuntz completed this list only recently by showing that every Coxeter arrangement is inductively free. Nevertheless, Orlik and Terao's conjecture is false in general. In a recent paper, we already gave two counterexamples to this conjecture among the exceptional complex reflection groups. In this paper we classify all inductively free reflection arrangements. In addition, we show that the notions of inductive freeness and that of hereditary inductive freeness coincide for reflection arrangements. As a consequence of our classification, we get an easy, purely combinatorial characterization of inductively free reflection arrangements A in terms of exponents of the restrictions to any hyperplane of A.

Explore related subjects

math.GRmath.CO

Keep this discovery

BibTeXRIS

Torsten Hoge, Gerhard Roehrle. 2012-08-15. On inductively free reflection arrangements. https://arxiv.org/abs/1208.3131

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↗