SearcharxivSearch

arXiv · 1006.5229

Parameterization of irreducible characters for p-solvable groups

Abstract

The weights for a finite group G with respect to a prime number p where introduced by Jon Alperin, in order to formulate his celebrated conjecture. In 1992, Everett Dade formulates a refinement of Alperin's conjecture involving ordinary irreducible characters - with their defect - and, in 2000, Geoffrey Robinson proves that the new conjecture holds for p-solvable groups. But this refinement is formulated in terms of a vanishing alternating sum, without giving any possible refinement for the weights. In this note we show that, in the case of the p-solvable finite groups, the method developed in a previous paper [arXiv.org/abs/1005.3748] can be suitably refined to provide, up to the choice of a polarization, a natural bijection - namely compatible with the action of the group of outer automorphisms of G - between the sets of absolutely irreducible characters of G and of G-conjugacy classes of suitable inductive weights, preserving blocks and defects.

Explore related subjects

Keep this discovery

BibTeXRIS

Lluis Puig. 2010-06-27. Parameterization of irreducible characters for p-solvable groups. https://arxiv.org/abs/1006.5229

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