SearcharxivSearch

arXiv · 2409.14811

On common zeros of characters of finite groups

Abstract

Let $G$ be a finite group, and let $\text{Irr}(G)$ denote the set of the irreducible complex characters of $G$. An element $g\in G$ is called a vanishing element of $G$ if there exists $\chi\in\text{Irr}(G)$ such that $\chi(g)=0$ (i.e., $g$ is a zero of $\chi$) and, in this case, the conjugacy class $g^G$ of $g$ in $G$ is called a vanishing conjugacy class. In this paper we consider several problems concerning vanishing elements and vanishing conjugacy classes; in particular, we consider the problem of determining the least number of conjugacy classes of a finite group $G$ such that every non-linear $\chi\in\text{Irr}(G)$ vanishes on one of them. We also consider the related problem of determining the minimum number of non-linear irreducible characters of a group such that two of them have a common zero.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mark L. Lewis, Lucia Morotti, Emanuele Pacifici, Lucia Sanus, Hung P. Tong-Viet. 2024-09-23. On common zeros of characters of finite groups. https://arxiv.org/abs/2409.14811

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