Interlacing conjecture for Ehrhart polynomials of complete multipartite graphs
Interlacing conjecture for Ehrhart polynomials of complete multipartite graphs
Let be a complete -partite graph of type , and let denote its Ehrhart polynomial. Complete multipartite Ehrhart conjecture. The polynomial has only real roots. Moreover, if , then and are -interlaced.
Sources & referencesView supporting material
Primary source
Akihiro Higashitani, Mario Kummer and Mateusz Michałek, “Interlacing Ehrhart Polynomials of Reflexive Polytopes”, arXiv:1612.07538 (2016).
Progress summary
Never refreshed
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.