Freeness of multi-reflection arrangements via primitive vector fields

Torsten Hoge; Toshiyuki Mano; Gerhard Roehrle; Christian Stump

Home/Archive/arXiv

arXiv · 1703.08980

Freeness of multi-reflection arrangements via primitive vector fields

Torsten Hoge·Toshiyuki Mano·Gerhard Roehrle·Christian Stump

View original source ↗Read source document ↗Export metadata ↓

Abstract

In 2002, Terao showed that every reflection multi-arrangement of a real reflection group with constant multiplicity is free by providing a basis of the module of derivations. We first generalize Terao's result to multi-arrangements stemming from well-generated unitary reflection groups, where the multiplicity of a hyperplane depends on the order of its stabilizer. Here the exponents depend on the exponents of the dual reflection representation. We then extend our results further to all imprimitive irreducible unitary reflection groups. In this case the exponents turn out to depend on the exponents of a certain Galois twist of the dual reflection representation that comes from a Beynon-Lusztig type semi-palindromicity of the fake degrees.

Explore related subjects

math.GR math.AC math.CO

Keep this discovery

BibTeX RIS

Torsten Hoge, Toshiyuki Mano, Gerhard Roehrle, Christian Stump. 2017-03-27. Freeness of multi-reflection arrangements via primitive vector fields. https://arxiv.org/abs/1703.08980

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↗