Character Degree Determination

• Character Degree Determination is the study of how the set or multiset of irreducible character degrees encodes critical structural information of finite groups.
• The field employs techniques such as case-by-case elimination, prime divisor constraints, and CFSG to uniquely identify nonabelian simple groups based on their character degrees.
• Insights from character degree sums and local constraints yield practical criteria for group properties and open avenues for further research in finite group theory.

Character degree determination is the study of how the set or multiset of irreducible complex character degrees of a finite group constrains and, in certain cases, uniquely determines the structure of the group. The main focus lies in analyzing the degrees of irreducible complex representations, their occurrence patterns, and the extent to which this numerical data encodes group-theoretic properties. This area is central to finite group theory, with deep connections to conjectures on group isomorphism, algebraic characterization, local-global phenomena, and the structure theory of specific families like simple groups and solvable groups.

1. Definitions and Invariants

Let $G$ be a finite group. The set of all irreducible complex characters is $\mathrm{Irr}(G)$. The character degree set, denoted $$\mathrm{cd}(G) = \{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}$$, records the distinct degrees of irreducible complex representations, disregarding multiplicity. The multiset $X_1(G)$ corresponds to the first column of the ordinary character table, counting the degrees with multiplicity: $$X_1(G) = \{\!\{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}\!\}.$$ For prime divisor analysis, $T(G) = \pi(|G|)$ is the set of primes dividing the order of $G$, and $p(G)$ the set of all primes occurring as divisors of character degrees.

Further numerical invariants:

• $d_1(G) < d_2(G) < \cdots < d_{t(G)}(G)$: the sequence of nontrivial ascending degrees in $\mathrm{cd}(G)$, with $\mathrm{Irr}(G)$0 the maximal degree.
• $\mathrm{Irr}(G)$1.
• $\mathrm{Irr}(G)$2: normalized sum of character degrees.

These sets form the core data for character degree determination.

2. Determination Results for Simple Groups

A central achievement is the proof that the character degree set (as set or multiset) uniquely determines many finite nonabelian simple groups. Specifically, for simple exceptional groups of Lie type, the main result is:

Theorem ((Tong-Viet, 2011), Theorem 1.1):

If $\mathrm{Irr}(G)$3 is a nonabelian simple exceptional group of Lie type and $\mathrm{Irr}(G)$4 is a nonabelian simple group such that $\mathrm{Irr}(G)$5, then $\mathrm{Irr}(G)$6. For multisets, if $\mathrm{Irr}(G)$7 is any finite group with $\mathrm{Irr}(G)$8, then $\mathrm{Irr}(G)$9.

Analogous theorems hold for simple classical groups of Lie type: $$\mathrm{cd}(G) = \{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}$$0 is determined up to isomorphism by its multiset of character degrees or, equivalently, by the isomorphism class of its complex group algebra $$\mathrm{cd}(G) = \{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}$$1 (Tong-Viet, 2011). This affirms, in these cases, the “Huppert conjecture” that simple groups are characterized by their character degree set.

These theorems rely on case-by-case elimination, leveraging the Classification of Finite Simple Groups (CFSG). Each possible nonabelian simple candidate is excluded by comparing degree bounds (Landazuri–Seitz–Zalesskii lower bounds on smallest nontrivial degrees, upper bounds for maximal degrees), as well as prime divisibility constraints (Zsigmondy's theorem provides primitive prime divisors that are missing from the putative degree sets in most cases).

3. Proof Strategies and Structural Lemmas

Character degree determination for simple groups is achieved by a multi-step reduction:

1. Reduction to a simple quotient: If a minimal counterexample $$\mathrm{cd}(G) = \{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}$$2 exists, factor out maximal normal subgroups to reach a simple quotient where character degree containment is preserved.
2. Case-by-case elimination: Analyze alternating, sporadic, and Lie type groups in same and cross-characteristic. Exclude all except the correct isomorphism type by:
   • Comparing $$\mathrm{cd}(G) = \{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}$$3 with $$\mathrm{cd}(G) = \{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}$$4 and $$\mathrm{cd}(G) = \{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}$$5 with $$\mathrm{cd}(G) = \{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}$$6.
   • Checking $$\mathrm{cd}(G) = \{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}$$7 by Zsigmondy's theorem.
3. Application of monotonicity: If $$\mathrm{cd}(G) = \{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}$$8 for nonabelian simple groups, then $$\mathrm{cd}(G) = \{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}$$9, $X_1(G)$0, and $X_1(G)$1.

For multisets, isomorphism of group algebras is equivalent to isomorphism of the multiset $X_1(G)$2, since the Wedderburn decomposition is prescribed by the character degree pattern (Tong-Viet, 2011). The existence and isolation of the Steinberg character degree is critical in Lie type groups.

4. Character Degree Sums and Group Structure

Global invariants such as the total character degree sum $X_1(G)$3 and normalized ratio $X_1(G)$4 yield sharp structural constraints (Maroti et al., 2013). Explicit thresholds for $X_1(G)$5 enforce:

• $X_1(G)$6 nilpotent;
• $X_1(G)$7 supersolvable;
• $X_1(G)$8 isoclinic to a small list of groups (abelian, 2-group, 3-group, $X_1(G)$9, $$X_1(G) = \{\!\{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}\!\}.$$0);
• $$X_1(G) = \{\!\{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}\!\}.$$1 solvable of Fitting height $$X_1(G) = \{\!\{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}\!\}.$$2 or $$X_1(G) = \{\!\{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}\!\}.$$3.

These results permit rapid exclusion of families as candidates for a given degree set.

5. Local and Modular Constraints

Sharp number-theoretic and group-theoretic restrictions exist at the local (prime) level and for classes such as solvable and $$X_1(G) = \{\!\{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}\!\}.$$4-groups:

• For solvable groups with order $$X_1(G) = \{\!\{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}\!\}.$$5 and square-free, coprime $$X_1(G) = \{\!\{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}\!\}.$$6, the structure admits $$X_1(G) = \{\!\{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}\!\}.$$7 if and only if there exists a sequence of congruences relating the prime power divisors of $$X_1(G) = \{\!\{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}\!\}.$$8 to the prime factors of $$X_1(G) = \{\!\{\chi(1) \mid \chi \in \mathrm{Irr}(G)\}\!\}.$$9, partitioned to produce Frobenius direct factors (Lewis et al., 2024).
• For finite $T(G) = \pi(|G|)$0-groups with $T(G) = \pi(|G|)$1, existence of a character of degree $T(G) = \pi(|G|)$2 forces degrees $T(G) = \pi(|G|)$3; stronger bounds result in the maximal class, with explicit attainable exponent (Mann, 2016).
• The Ito–Michler theorem and its refinements (Hung et al., 2019) link average or restricted average character degree to structural conclusions: if the average degree on $T(G) = \pi(|G|)$4-singular characters is below a sharp bound, Sylow $T(G) = \pi(|G|)$5-subgroups must be normal/abelian and the group must be $T(G) = \pi(|G|)$6-solvable.

6. Techniques and Open Problems

Major tools in character degree determination include:

• Inductive and quotient reductions using the Fitting series, derived series, and commutator structure;
• Large orbit theorems for solvable groups and module action reductions (Moretó, 2022);
• The construction of extendible irreducible characters in non-solvable settings, employing properties of the generalized Fitting subgroup and the CFSG;
• Orbit-counting on power sets to bound the number of character degree prime divisors.

Several conjectures persist, including:

• Isaacs–Seitz: For solvable $T(G) = \pi(|G|)$7, derived length $T(G) = \pi(|G|)$8.
• Huppert’s p-σ: Existence of characters whose degrees’ prime factors jointly cover $T(G) = \pi(|G|)$9.
• Gluck’s: $G$0 for solvable $G$1 (with extensions to all finite groups by bounding index by a product of large degrees).
• Classification of prime character degree graphs for solvable groups, beyond the explicit $G$2 family (Bissler et al., 2017).

7. Further Context and Implications

The cumulative results establish that, for almost all finite nonabelian simple groups (alternating, sporadic, Lie type), the pattern of character degrees, even without multiplicity, suffices to recover the group up to isomorphism. This rigidity does not extend to abelian groups and can fail for small nonabelian $G$3-groups. The full “Huppert conjecture” remains open in the generality allowing abelian direct factors.

The analysis of character degree data is essential not only for group determination but for structural theorems, quantitative invariants, and connections to local-global group theory. It leverages deep interaction between character theory, arithmetic properties, subgroup structure, and the architecture provided by the Classification of Finite Simple Groups. Current research continues to refine extremal bounds, expand classification of invariants, and pursue the open conjectures at the interface of character theory and finite group structure.