Finite groups with a given set of character degrees.
In the summary one finds: ``Let \(G\) be a finite group with \(\{1,q,r,qm,q^2m,rqm\}\) as the character degree set, where \(r\) and \(q\) are distinct primes and \(m>1\) is an integer not divisible by \(q\) and \(r\). It is shown that \(G\) is solvable and the derived length of \(G\) equals 3. Several papers published earlier in time dealt with complex character degree sets, like \(\{1,p,q,r,pq,pr\}\) where \(p\), \(q\), \(r\) are distinct primes, and \(\{1,p\}\), and \(\{1,q,r\}\), etc.. The rich reference list gives (for instance), a paper by \textit{K. Aziziheris} [Algebr. Represent. Theory 14, No. 5, 949-958 (2011; Zbl 1245.20004)], by \textit{M. L. Lewis} [J. Algebra 206, No. 1, 235-260 (1998; Zbl 0915.20003)] and by \textit{T. Noritzsch} [J. Algebra 175, No. 3, 767-798 (1995; Zbl 0839.20014)]. In order to obtain their results, the authors develop a lot of theory to reach their goals. We kindly refer the interested reader to the details of the contents. Knowledge of cyclotomic polynomials, Lie-group representations, Steinberg characters, do play a rôle as well as the classification of the finite simple groups.
- A note on character degrees of finite groups
- Some character degree conditions implying solvability of finite groups.
- The solvability comes from a given set of character degrees
- The set of character degrees of a finite group does not determine its solvability.
- Determining group structure from the sets of character degrees.
- Bounding the derived length for a given set of character degrees.
- Character degree graphs that are complete graphs
- Character degrees of extensions of \(\mathrm{PSL}_2(q)\) and \(\mathrm{SL}_2(q)\).
- Coprime Group Actions Fixing All Nonlinear Irreducible Characters
- Coprimeness among irreducible character degrees of finite solvable groups
- Degrees of Irreducible Characters and Normal p-Complements
- Derived lengths of solvable groups having five irreducible character degrees. I.
- Derived lengths of solvable groups satisfying the one-prime hypothesis
- Determining group structure from sets of irreducible character degrees
- Endliche Gruppen I
- Extending the Steinberg representation
- Fitting heights of solvable groups with few character degrees
- Groups having three complex irreducible character degrees
- Half-Transitive Automorphism Groups
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 3749242 (Why is no real title available?)
- scientific article; zbMATH DE number 3526920 (Why is no real title available?)
- scientific article; zbMATH DE number 479556 (Why is no real title available?)
- scientific article; zbMATH DE number 638171 (Why is no real title available?)
- scientific article; zbMATH DE number 2151357 (Why is no real title available?)
- Irreducible character degrees and normal subgroups
- Nonsolvable groups with few character degrees.
- Nonsolvable groups with no prime dividing three character degrees.
- Orbits and Stabilizers for Solvable Linear Groups
- Solvable groups whose degree graphs have two connected components
- Some character degree conditions implying solvability of finite groups.
- Some simple groups which are determined by the set of their character degrees. I
- Groups having three complex irreducible character degrees
- An overview on the bipartite divisor graph for the set of irreducible character degrees
- The solvability comes from a given set of character degrees
- Finite Groups Whose Irreducible Character Degrees Constitute Two Chains
- Finite groups whose character degree graphs are empty graphs.
- The character degree ratio and composition factors of a finite group.
- The exterior degree of a pair of finite groups.
- scientific article; zbMATH DE number 783428 (Why is no real title available?)
- The character co-degree sets and solvability
This page was built for publication: Finite groups with a given set of character degrees.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287498)
