Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1605.01585

Finite groups with non-trivial intersections of kernels of all but one irreducible characters

Mariagrazia Bianchi·Marcel Herzog
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we consider finite groups G satisfying the following condition: G has two columns in its character table which differ by exactly one entry. It turns out that such groups exist and they are exactly the finite groups with a non-trivial intersection of the kernels of all but one irreducible characters or, equivalently, finite groups with an irreducible character vanishing on all but two conjugacy classes. We investigate such groups and in particular we characterize their subclass, which properly contains all finite groups with non-linear characters of distinct degrees, which were characterized by Berkovich, Chillag and Herzog in 1992.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Mariagrazia Bianchi, Marcel Herzog. 2016-05-05. Finite groups with non-trivial intersections of kernels of all but one irreducible characters. https://arxiv.org/abs/1605.01585

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗