A proof of the cyclotomic conjecture and the non-existence of almost Moore digraphs
Jaskaran Kaur, Hitesh Kumar
Abstract
For n>2 and k>1, define the polynomial \[Fn,k(x) = Φn(1 + x + ·s + xk),\] where Φn denotes the n-th cyclotomic polynomial. The cyclotomic conjecture proposed by Gimbert (1999) exactly describes the irreducibility of Fn,k(x) over Q in terms of n and k. Conde, Gimbert, González, Miller and Miret (2014) established that the cyclotomic conjecture, if true, would imply the non-existence of almost Moore digraphs - a well-known open question concerning the directed degree-diameter problem. In this article, we prove the cyclotomic conjecture and, as a consequence, show that there are no almost Moore digraphs with maximum out-degree d and diameter k for any d>1 and k>2.
Create a lesson
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato