Descent formula conjecture for preorder-polytope h-star polynomials
Descent formula conjecture for preorder-polytope h-star polynomials
Let be a totally ordered -element set, let be a preorder on , and let be the number of descents of a word . Define to be the set of words such that, for every order ideal of , the elements of appear at least times in . Descent formula conjecture.
The conjecture extends a formula known for arbor polytopes to all preorder polytopes; its resolution is not specified in the source.
Sources & referencesView supporting material
Primary source
Frédéric Chapoton and Christos A. Athanasiadis, “Polytopes and posets associated to preorders”, arXiv:2605.26916 (2026).
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.