Kimmerle's prime graph conjecture
Kimmerle's prime graph conjecture
Let be a finite group. Write for the set of primes dividing the order of . The Gruenberg–Kegel graph, or prime graph, of is the graph whose vertices are the primes in , with an edge between distinct primes and when contains an element of order . Define analogously for the normalized unit group . Kimmerle's conjecture. If is a finite group, then
This is a weakened variation of the Zassenhaus conjecture concerning the prime divisors of element orders in finite groups and their normalized integral group-ring units. It was proposed as a related approach to the Zassenhaus problem and has been studied for numerous classes of finite groups.
Sources & referencesView supporting material
Primary source
V. A. Bovdi and A. B. Konovalov, “Integral group ring of the Mathieu simple group M24”, arXiv:0705.1992 (2007).
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.