SearcharxivSearch

arXiv · 2011.12374

Average number of zeros of characters of finite groups

Abstract

There has been some interest on how the average character degree affects the structure of a finite group. We define, and denote by $ \mathrm{anz}(G) $, the average number of zeros of characters of a finite group $ G $ as the number of zeros in the character table of $ G $ divided by the number of irreducible characters of $ G $. We show that if $ \mathrm{anz}(G) < 1 $, then the group $ G $ is solvable and also that if $ \mathrm{anz}(G) < \frac{1}{2} $, then $ G $ is supersolvable. We characterise abelian groups by showing that $ \mathrm{anz}(G) < \frac{1}{3} $ if and only if $ G $ is abelian.

Explore related subjects

Keep this discovery

BibTeXRIS

Sesuai Y. Madanha. 2020-11-24. Average number of zeros of characters of finite groups. https://doi.org/10.1016/j.jalgebra.2021.03.030

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