Table of Contents
Fetching ...

Counting Irreducible Representations of a Finite Abelian Group

Thomas Breuer, Prashun Kumar, Geetha Venkataraman

TL;DR

The paper solves the problem of counting irreducible representations of a finite abelian group $G$ over a finite field ${\mathbb F}_q$ of order $q$ with ${\rm char}({\mathbb F}_q)\nmid |G|$. It develops a Brauer-character based framework that assigns irreducible ${\mathbb F}_q$-representations to divisors $d$ of the exponent $e$ of $G$, with each such representation having degree ${\rm ord}(q\bmod d)$ and arising in orbits under the Galois action, yielding the counting formula $(1/n)\sum_{d\in D_n} |{\rm I}_d(G)|$ for the number of irreducibles of degree $n$. The counts factor over Sylow subgroups, giving $|{\rm I}_d(G)|=\prod_{r} |{\rm I}_{d_r}(G_r)|$, and the sizes ${|{\rm I}_{r^l}(G_r)|}$ are computable via kernels $N(G_r,l)$ and quotients $F(G_r,l)$, yielding degrees as ${\rm lcm}$s of ${\rm ord}(q\bmod r^{i_r})$. An explicit algorithm is provided to compute all irreducible degrees and their multiplicities from the prime-power decomposition of $|G|$, together with an example illustrating the method over particular finite fields. Overall, the work gives a concrete, structure-agnostic method to enumerate modular irreducibles of abelian groups and clarifies how degrees and multiplicities depend on the exponent and field data.

Abstract

Let $q$ be a power of a prime $p$, $G$ be a finite abelian group, where $p$ does not divide $|G|$,and let $n$ be a positive integer. In this paper we find a formula for the number of irreducible representations of $G$ of a given dimension $n$ over the field of order $q$, up to equivalence, using Brauer characters. We also provide a formula for such $n$ using the prime decomposition of the exponent of $G$ and an algorithm to compute the irreducible degrees and their multiplicities.

Counting Irreducible Representations of a Finite Abelian Group

TL;DR

The paper solves the problem of counting irreducible representations of a finite abelian group over a finite field of order with . It develops a Brauer-character based framework that assigns irreducible -representations to divisors of the exponent of , with each such representation having degree and arising in orbits under the Galois action, yielding the counting formula for the number of irreducibles of degree . The counts factor over Sylow subgroups, giving , and the sizes are computable via kernels and quotients , yielding degrees as s of . An explicit algorithm is provided to compute all irreducible degrees and their multiplicities from the prime-power decomposition of , together with an example illustrating the method over particular finite fields. Overall, the work gives a concrete, structure-agnostic method to enumerate modular irreducibles of abelian groups and clarifies how degrees and multiplicities depend on the exponent and field data.

Abstract

Let be a power of a prime , be a finite abelian group, where does not divide ,and let be a positive integer. In this paper we find a formula for the number of irreducible representations of of a given dimension over the field of order , up to equivalence, using Brauer characters. We also provide a formula for such using the prime decomposition of the exponent of and an algorithm to compute the irreducible degrees and their multiplicities.

Paper Structure

This paper contains 3 sections, 1 theorem, 6 equations.

Key Result

Theorem 2.1

Let $G$ be a finite abelian group of exponent $e$, and let $q$ be a prime power coprime to $|G|$. Each irreducible representation of $G$ over the field ${\mathbb{F}}_q$ with $q$ elements has degree ${\mathrm{ord}}(q \bmod d)$, for some divisor $d$ of $e$. The number of irreducible representations of where $D_n = \{d \mid e ; \ {\mathrm{ord}}(q \bmod d) = n, \ \textrm{$d$ even if $e$ is even}\}$.

Theorems & Definitions (8)

  • Theorem 2.1
  • proof
  • Remark 2.2
  • Remark 2.3
  • Remark 2.4
  • Remark 2.5
  • Example 2.6
  • Example 2.7