Three-character covering conjecture for prime divisors of character degrees
Three-character covering conjecture for prime divisors of character degrees
Let be a finite group, and let be the set of primes dividing the degree of some irreducible character of . Write for the set of irreducible characters of . Three-character covering conjecture. There exist such that every prime in divides . If is solvable, two characters suffice. This is proposed as a strong form of Huppert's - conjecture; its status is not specified in the source.
Sources & referencesView supporting material
Primary source
Alexander Moretó, “Methods and questions in character degrees of finite groups”, arXiv:2209.09221 (2022).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.