Search arXivSearch

arXiv · 2609.22078

Stellahedral Geometry of Partially Ordered Sets

Abstract

We introduce a transformation on partially ordered sets, termed the \emph{stellahedral transform}, with notable features. It preserves the properties of being Eulerian, Cohen--Macaulay, and of being the face poset of a polytope. Furthermore, it admits an explicit geometric realization for convex polytopes and specializes to the construction that takes a simplex to the stellahedron. One motivation for this definition comes from the theory of toric $h$-polynomials and (augmented) Chow polynomials of Eulerian posets. We show that the right augmented Chow polynomial of an Eulerian poset $P$ agrees with the toric $h$-polynomial of the stellahedral transform of $P$. We use this perspective, together with $\mathbf{cd}$-index results due to Ehrenborg (2005) and Karu (2006), to prove two positivity results for augmented Chow polynomials: for Gorenstein* posets they are unimodal, and for face posets of polytopes they are $γ$-positive. Along the way we provide negative answers to two open questions concerning Eulerian and Gorenstein* posets. First, the question on the nonnegativity of Eulerian Chow polynomials, posed by Ferroni, Matherne, and Vecchi (2024). Second, the question posed by Athanasiadis and Kalampogia-Evangelinou (2023) on the real-rootedness of chain and Chow polynomials of Gorenstein* posets: these examples provide a novel application of a technique introduced by Murai and Nevo (2014).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tommaso Faustini, Luis Ferroni, Ludovico Piazza. 2026-09-18. Stellahedral Geometry of Partially Ordered Sets. https://arxiv.org/abs/2609.22078

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO