SearcharxivSearch

arXiv · 2105.14456

On the multiplicities of the character codegrees

Abstract

Let G be a finite group and ? be an irreducible character of G, the number cod(?) = jG : Let $ G $ be a finite group and $ \chi $ be an irreducible character of $ G $, the number $ \cod(\chi) = |G: \kernel(\chi)|/\chi(1) $ is called the codegree of $ \chi $. Also, $ \cod(G) = \{ \cod(\chi) \ | \ \chi \in \Irr(G) \} $. For $d\in\cod(G)$, the multiplicity of $d$ in $G$, denoted by $m'_G(d)$, is the number of irreducible characters of $G$ having codegree $d$. A finite group $G$ is called a $T'_k$-group for some integer $k\geq 1$, if there exists $d_0\in\cod(G)$ such that $m'_G(d_0)=k$ and for every $d\in\cod(G)-\{d_0\}$, we have $m'_G(d)=1$. In this note we characterize finite $T'_k$-groups completely, where $k\geq 1$ is an integer.

Explore related subjects

Keep this discovery

BibTeXRIS

Zeinab Akhlaghi, Mehdi Ebrahimi, Maryam Khatami. 2021-05-30. On the multiplicities of the character codegrees. https://arxiv.org/abs/2105.14456

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