加载中…
Let be a finite group, and write for the degree set of the complex irreducible characters of . The group is said to satisfy the {\it two-prime hypothesis} if, for any distinct degrees , the total number of (not necessarily different) primes of the greatest common divisor is at most . In this paper, we prove an upper bound on the number of irreducible character degrees of a nonsolvable group that has a composition factor isomorphic to for .

生成讲解博客的中文版本

生成AI智能校验的中文版本