Search arXivSearch

arXiv · math/0201150

Equivariant Euler characteristics of discriminants of reflection groups

Abstract

Let G be a finite, complex reflection group and f its discriminant polynomial. The fibers of f admit commuting actions of G and a cyclic group. The virtual $G\times C_m$ character given by the Euler characteristic of the fiber is a refinement of the zeta function of the geometric monodromy, calculated in a paper of Denef and Loeser. We compute the virtual character explicitly, in terms of the poset of normalizers of centralizers of regular elements of G, and of the subspace arrangement given by proper eigenspaces of elements of G. As a consequence, we compute orbifold Euler characteristics and find some new "case-free" information about the discriminant.

Explore related subjects

Keep this discovery

BibTeXRIS

Graham Denham, Nicole Lemire. 2002-01-16. Equivariant Euler characteristics of discriminants of reflection groups. https://arxiv.org/abs/math/0201150

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