Finite groups with few character values
Sesuai Y. Madanha
Abstract
Open-access reader
Sesuai Y. Madanha
Abstract
Open-access reader
A classical theorem on character degrees states that if a finite group has fewer than four character degrees, then the group is solvable. We prove a corresponding result on character values by showing that if a finite group has fewer than eight character values in its character table, then the group is solvable. This confirms a conjecture of T. Sakurai. We also classify non-solvable groups with exactly eight character values.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A classical theorem on character degrees states that if a finite group has fewer than four character degrees, then the group is solvable. We prove a corresponding result on character values by showing that if a finite group has fewer than eight character values in its character table, then the group is solvable. This confirms a conjecture of T. Sakurai. We also classify non-solvable groups with exactly eight character values.
Key concepts: Character (mathematics), Character table, Conjecture, Group (periodic table), Mathematics, Finite group, Solvable group, Combinatorics