Brenti’s problem on palindromic real-rooted polynomials and h-vectors of polytopes
For every polynomial that is monic, has nonnegative coefficients, is real-rooted, and is palindromic in the sense that for , there exists a simplicial convex polytope such that its -polynomial satisfies .
References
Primary source
Additional references
Progress summary
A new unverified preprint claims to settle Brenti’s long-standing question affirmatively, but no independent confirmation was found.
Brenti’s problem, circulated since 2004, concerns a proposed connection between palindromic real-rooted polynomials and the polynomial data of simplicial convex polytopes.
September 2026 claimed affirmative answer
An unrefereed arXiv preprint claims an affirmative solution to the problem. The retrieved evidence gives no independent verification, referee report, or discussion identifying a gap.
Current status (as of September 2026): An arXiv preprint claims the problem is solved affirmatively, but the claim remains unverified; no contrary result or independently confirmed proof was found.
Sources
- arxiv.org
- d-nb.info
- combinatorics.org
- escholarship.org
- pages.uoregon.edu
- alco.centre-mersenne.org
- arxiv.org
- scientificamerican.com
- quantamagazine.org
- arxiv.org
- arxiv.org
- arxiv.org
- arxiv.org
- ar5iv.labs.arxiv.org
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- quantamagazine.org
- quantamagazine.org
- quantamagazine.org
Solutions 0
No solutions have been posted yet.