Search arXivSearch

arXiv · 2402.06219

Local $h$-polynomials, uniform triangulations and real-rootedness

Abstract

The local $h$-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 $h$-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 $h$-polynomial of $Δ$, which is valid when $Δ$ is any uniform triangulation of $Γ$. A combinatorial interpretation of the local $h$-polynomial of the second barycentric subdivision of the simplex is deduced.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christos A. Athanasiadis. 2025-06-27. Local $h$-polynomials, uniform triangulations and real-rootedness. https://arxiv.org/abs/2402.06219

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO