Real-rootedness and Eulerian interlacing conjecture for geometric lattices
Real-rootedness and Eulerian interlacing conjecture for geometric lattices
Let be a finite geometric lattice of rank , and write
Let be the Eulerian polynomial of index . A polynomial is interlaced by another polynomial when their roots satisfy the interlacing relation used in the paper.
Real-rootedness and Eulerian interlacing conjecture. The polynomial has only real roots and is interlaced by the Eulerian polynomial for every geometric lattice of rank .
The conjecture is stronger than the open unimodality question for and had been verified computationally for all geometric lattices with at most nine atoms. No general proof or disproof is given in the supplied text.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Christos A. Athanasiadis and Katerina Kalampogia-Evangelinou, “Chain enumeration, partition lattices and polynomials with only real roots”, arXiv:2205.03796 (2023).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.