Search arXivSearch

arXiv · 2510.17679

Eulerian posets and $Z$-polynomials

Abstract

Let $P$ be a finite partially ordered set. In a recent series of works, Proudfoot introduced the notion of $Z$-polynomials associated with $P$-kernels, providing a unified framework for various intersection cohomology Poincaré polynomials arising in diverse areas of mathematics. One of the problems posed by Proudfoot was to interpret the $Z$-polynomial in a fundamental setting---namely, when $P$ is the lattice of faces of a convex polytope (or, more generally, an Eulerian poset). We resolve this problem by proving that the $Z$-polynomial of any Eulerian poset coincides with the toric $h$-polynomial of the poset of all (possibly empty) closed intervals of $P$, ordered by reverse inclusion. Under suitable polyhedral conditions, this result identifies the $Z$-polynomial of a polytope with the Poincaré polynomial of the intersection cohomology of an associated auxiliary polytope. We prove some results about the Chow polynomials of the poset of intervals of an Eulerian poset and relate them to the Veronese transforms of polynomials.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luis Ferroni, Roberto Riccardi. 2026-08-10. Eulerian posets and $Z$-polynomials. https://doi.org/10.1017/fms.2026.10270

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