SearcharxivSearch

arXiv · 1112.3819

Counting characters in blocks of solvable groups with abelian defect group

Abstract

If $G$ is a solvable group and $p$ is a prime, then the Fong-Swan theorem shows that given any irreducible Brauer character $ϕ$ of $G$, there exists a character $χ\in \irrg$ such that $χ^o = ϕ$, where $^o$ denotes the restriction of $χ$ to the $p$-regular elements of $G$. We say that $χ$ is a {\it{lift}} of $ϕ$ in this case. It is known that if $ϕ$ is in a block with abelian defect group $D$, then the number of lifts of $ϕ$ is bounded above by $|D|$. In this paper we give a necessary and sufficient condition for this bound to be achieved, in terms of local information in a subgroup $V$ determined by the block $B$. We also apply these methods to examine the situation when equality occurs in the $k(B)$ conjecture for blocks of solvable groups with abelian defect group.

Explore related subjects

Keep this discovery

BibTeXRIS

James P. Cossey, Mark L. Lewis. 2011-12-16. Counting characters in blocks of solvable groups with abelian defect group. https://arxiv.org/abs/1112.3819

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