Unimodality conjecture for Toda eigenfunction numerators
Unimodality conjecture for Toda eigenfunction numerators
For , let be the Toda eigenfunction and let be the associated -factorial. A polynomial is unimodal if its coefficient sequence weakly increases to a maximum and then weakly decreases. Unimodality conjecture. The polynomial
is unimodal. This is motivated by empirical observations after the positivity conjecture; the source gives no proof or resolution.
Progress summary
The conjecture remains unproved: experiments support it, but the proposed geometric route depends on another unproved conjecture.
A. Labelle formulates the conjecture for every nonnegative root-lattice element: the numerator should have coefficients that rise and then fall. The paper records empirical support but gives no general proof or resolution.
Known results
- In type , unimodality would follow from Labelle's Conjecture 6.1, which predicts a smooth projective variety with the relevant Poincare polynomial; this implication is conditional.
- Positivity in type is established by Labelle's Theorem 1.2, but positivity in general remains conjectural.
Current status (as of August 2026): The conjecture is recorded and empirically supported, but no proof, verified counterexample, or resolution of general unimodality is reported.
Sources
Sources & referencesView supporting material
Primary source
Antoine Labelle, “On a specialization of Toda eigenfunctions”, arXiv:2502.10655 (2026).
Solutions 1
Sign in to submit a solution.
Counterexample: the conjecture fails in every non-simply-laced irreducible Dynkin type.
The exact current statement is Conjecture 7.3 of A. Labelle, arXiv:2502.10655v3, revised July 28, 2026. It asserts unimodality of
for every nonnegative root-lattice element of an arbitrary split semisimple root system.
Write
The source's defining recursion is
Substituting gives the exact integral triangular recurrence
Now take type , ordering the long root first. Then
Applying (2) gives the complete small-index table
In particular, for ,
Every coefficient is strictly positive, and the polynomial is palindromic, but
Hence is not unimodal.
The obstruction extends to every doubly-laced irreducible type. If a coefficient , every in (1) also has ; thus the recursion depends only on the full Dynkin subdiagram supporting . Each for , and , contains a double-edge subdiagram. Put coefficient on its two vertices and elsewhere to obtain exactly the same nonunimodal polynomial.
For the remaining non-simply-laced type , take
The exact coefficient sequence from (2) is
It again has positive full support and is palindromic, but contains
Thus Conjecture 7.3 is false in every non-simply-laced irreducible Dynkin type. The separate simply-laced and type- questions are not claimed here.