Local $h$-polynomials, uniform triangulations and real-rootedness
Christos A. Athanasiadis

TL;DR
This paper proves that the local $h$-polynomial of certain triangulations is real-rooted, strengthening known properties and providing new combinatorial formulas, with implications for understanding the polynomial's structure.
Contribution
The paper establishes the real-rootedness of local $h$-polynomials for barycentric and edgewise subdivisions, introducing a new combinatorial formula for uniform triangulations.
Findings
Local $h$-polynomial is real-rooted for barycentric subdivisions.
A new combinatorial formula for local $h$-polynomial of uniform triangulations.
Derived combinatorial interpretation for the second barycentric subdivision.
Abstract
The local -polynomial was introduced by Stanley as a fundamental enumerative invariant of a triangulation of a simplex. This polynomial is known to have nonnegative and symmetric coefficients and is conjectured to be -positive when is flag. This paper shows that the local -polynomial has the stronger property of being real-rooted when is the barycentric subdivision of an arbitrary geometric triangulation of the simplex. An analogous result for edgewise subdivisions is proven. The proofs are based on a new combinatorial formula for the local -polynomial of , which is valid when is any uniform triangulation of . A combinatorial interpretation of the local -polynomial of the second barycentric subdivision of the simplex is deduced.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra · Polynomial and algebraic computation · Algebraic structures and combinatorial models
