Gimbert's cyclotomic irreducibility conjecture
Gimbert's cyclotomic irreducibility conjecture
For integers and , define the cyclotomic polynomial and
Gimbert's cyclotomic irreducibility conjecture. If is even, then is reducible in if and only if , and in that case it has exactly two factors. If is odd, then is irreducible in if and only if , and in that case it has exactly two factors. The conjecture concerns the factorization over of characteristic polynomials associated with almost Moore digraphs and was attributed in the source to Gimbert; the supplied text gives no resolution status.
Sources & referencesView supporting material
Primary source
Arnau Messegué and Josep Maria Miret, “On the nonexistence of almost Moore digraphs with self-repeats”, arXiv:2410.20226 (2024).
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.