SearcharxivSearch

arXiv · 2306.05852

On the relation of character codegrees and the minimal faithful quasi-permutation representation degree of $p$-groups

Abstract

For a finite group $G$, we denote by $c(G)$, the minimal degree of faithful representation of $G$ by quasi-permutation matrices over the complex field $\mathbb{C}$. For an irreducible character $\chi$ of $G$, the codegree of $\chi$ is defined as $\cod(\chi) = |G/ \ker(\chi)|/ \chi(1)$. In this article, we establish equality between $c(G)$ and a $\mathbb{Q}_{\geq 0}$-sum of codegrees of some irreducible characters of a non-abelian $p$-group $G$ of odd order. We also study the relation between $c(G)$ and irreducible character codegrees for various classes of non-abelian $p$-groups, such as, $p$-groups with cyclic center, maximal class $p$-groups, GVZ $p$-groups, and others.

Explore related subjects

Keep this discovery

BibTeXRIS

Sunil Kumar Prajapati, Ayush Udeep. 2023-06-09. On the relation of character codegrees and the minimal faithful quasi-permutation representation degree of $p$-groups. https://arxiv.org/abs/2306.05852

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