SearcharxivSearch

arXiv · 1902.03170

On zeros of irreducible characters lying in a normal subgroup

Abstract

Let $N$ be a normal subgroup of a finite group $G$. In this paper, we consider the elements $g$ of $N$ such that $\chi(g)\neq 0$ for all irreducible characters $\chi$ of $G$. Such an element is said to be non-vanishing in $G$. Let $p$ be a prime. If all $p$-elements of $N$ satisfy the previous property, then we prove that $N$ has a normal Sylow $p$-subgroup. As a consequence, we also study certain arithmetical properties of the $G$-conjugacy class sizes of the elements of $N$ which are zeros of some irreducible character of $G$. In particular, if $N=G$, then new contributions are obtained.

Explore related subjects

Keep this discovery

BibTeXRIS

M. J. Felipe, N. Grittini, V. Sotomayor. 2019-02-08. On zeros of irreducible characters lying in a normal subgroup. https://arxiv.org/abs/1902.03170

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