1 Introduction
In his seminal work [Reference Stanley31], Stanley introduced a powerful framework to investigate polynomial invariants naturally associated with partially ordered sets and special incidence algebra elements called kernels. This construction provides a unified setting encompassing several, at first sight unrelated, theories that play a central role across mathematics. The three most representative instances are:
-
(i) The geometry and representation theory of Bruhat intervals of Weyl (or, more generally, Coxeter) groups [Reference Kazhdan and Lusztig24, Reference Elias and Williamson14], and references therein.
-
(ii) The enumeration of points, lines, planes, etc. in a hyperplane arrangement (or, more generally, a matroid) [Reference Huh and Wang20, Reference Braden, Huh, Matherne, Proudfoot and Wang9].
-
(iii) The enumeration of (flags of) faces of rational convex polytopes [Reference Stanley30, Reference Stanley31] (or, more generally, arbitrary polytopes [Reference Karu22], regular CW-spheres and Cohen–Macaulay Eulerian posets [Reference Karu23], or arbitrary posets [Reference Bayer and Ehrenborg7]).
This framework is often referred to as the Kazhdan–Lusztig–Stanley (KLS) theory of posets. For a comprehensive overview and an exposition of its algebro-geometric aspects, we refer the reader to the survey of Proudfoot [Reference Proudfoot28]. In what follows, we briefly recall the general setup of the KLS theory, adhering closely to the notation of [Reference Ferroni, Matherne and Vecchi17].
To each partially ordered set
$P$
along with a
$P$
-kernel, one may associate two special incidence algebra elements called, respectively, the left and right Kazhdan–Lusztig–Stanley functions. A third object, recently introduced by Proudfoot in the context of KLS theory [Reference Proudfoot28], is the so-called
$Z$
-function.
For the sake of having simpler statements, we define the Z-polynomial of an Eulerian poset with minimum element
$\widehat {0}$
and maximum element
$\widehat {1}$
as the value that its
$Z$
-function assumes at the interval
$[\widehat {0},\widehat {1}]$
. Similarly, the right (resp. left) Kazhdan–Lusztig polynomials are the polynomials that the right (resp. left) Kazhdan–Lusztig function associates to the interval
$[\widehat {0},\widehat {1}]$
.
In the three examples above, using adequate kernels, one has:
-
(i) The right Kazhdan–Lusztig–Stanley polynomial of a Bruhat interval $[v,w]$
in a Weyl group
$W$
(often just called the Kazhdan–Lusztig polynomial of
$[v,w]$
) encodes the local intersection cohomology Betti numbers of the Schubert variety
$X_w$
at the point
$e_v$
(see [Reference Kazhdan and Lusztig25, Corollary 4.8]). The
$Z$
-polynomial, in turn, encodes the intersection cohomology Betti numbers of the Richardson variety
$\overline {C}_v\cap \overline {X}_w$
(see [Reference Proudfoot28, Theorem 4.3]). -
(ii) The right Kazhdan–Lusztig–Stanley polynomial of (the lattice of flats of) a loopless matroid $\mathsf {M}$
encodes the Betti numbers of the stalk at the empty flat of the intersection cohomology module of
$\mathsf {M}$
(see [Reference Elias, Proudfoot and Wakefield15, Reference Braden, Huh, Matherne, Proudfoot and Wang9]). The
$Z$
-function encodes the Betti numbers of the intersection cohomology module of
$\mathsf {M}$
(see [Reference Proudfoot, Xu and Young29, Reference Braden, Huh, Matherne, Proudfoot and Wang9]). -
(iii) The left Kazhdan–Lusztig–Stanley polynomial of the face poset of a rational (resp. arbitrary) convex polytope, often called the toric g-polynomial, encodes the Betti numbers of the (middle perversity) intersection cohomology of the toric variety associated to the polytope [Reference Stanley30] (resp. the combinatorial intersection cohomology [Reference Barthel, Brasselet, Fieseler and Kaup5, Reference Bressler and Lunts11, Reference Karu22]).
In the first and third examples above, the left KLS function equals the right KLS function of the dual poset, and both the class of Bruhat intervals and Eulerian posets are closed under duality. Therefore, there is no epistemological difference between left and right in these cases. In the second case, the left KLS function is trivial, whereas the right KLS function is very subtle. The absence of any mention of the
$Z$
-function in the third item above is the ultimate motivation for this paper. This problem was raised by Proudfoot in his survey [Reference Proudfoot28] (see the last paragraph of Section 1.1 therein).
Problem 1.1 (Proudfoot).
Find an interpretation for the
$Z$
-function of the face poset of a convex polytope.
Very little is known about
$Z$
-functions of polytopes, not even in small special cases. Unfortunately, the computation of
$Z$
-polynomials is a daunting task. Even for face posets of small-dimensional polytopes the defining recursion for the
$Z$
-polynomial is very slow in practice. This is a difficult obstruction to circumvent if one desires to build some intuition about what these polynomials are encoding.
Despite these computational obstacles, in this paper we answer this question in a strong sense. Instead of just focusing on polytopes, we view this problem in the broader setting of general Eulerian posets. Counterintuitively, even if the combinatorics of the posets is much more complicated (e.g., they no longer are atomic and coatomic lattices), the answer to the above question becomes surprisingly beautiful and concise.
Theorem 1.2. Let
$P$
be an Eulerian poset. The
$Z$
-polynomial of
$P$
using the Eulerian kernel equals the toric
$h$
-polynomial of the poset of intervals of
$P$
ordered by reverse inclusion.
In the above statement and in several places of the present paper we treat the empty set as a closed interval of
$P$
, so that the poset alluded to in Theorem 1.2 has a maximum (see Figure 1 below for an example). A nonobvious, but classical theorem due to Lindström (see [Reference Lindström26]) states that if
$P$
is an Eulerian poset then the poset of all the intervals of
$P$
ordered by reverse inclusion is Eulerian as well. The proof of this statement as well as the basics of posets of intervals are discussed in Section 3.
Recall that the toric h-polynomial of an Eulerian poset
$P$
is a “symmetrization” of the toric
$g$
-polynomial. When the poset
$P$
is the lattice of faces of a simplicial polytope
$\mathcal {P}$
the toric
$h$
-polynomial is the classical
$h$
-polynomial of
$\mathcal {P}$
, and when the polytope is rational but not necessarily simplicial, the coefficients of the toric
$h$
-polynomial are the (middle perversity) intersection cohomology Betti numbers of the toric variety associated to
$\mathcal {P}$
. Stanley [Reference Stanley30] showed that the combinatorial recursion satisfied by the toric
$h$
-polynomial of the face poset of a polytope can be used to define it for arbitrary Eulerian posets (for a modern presentation, see [Reference Stanley32, p. 313]). More generally, Bayer and Ehrenborg [Reference Bayer and Ehrenborg7] defined toric
$g$
- and toric
$h$
-polynomials for arbitrary graded posets.
The above theorem fails if the poset is not Eulerian – as mentioned in the above paragraph, [Reference Bayer and Ehrenborg7] states a definition of toric
$h$
- and toric
$g$
-polynomials for arbitrary graded posets, thus allowing for a natural definition of
$Z$
-polynomials of graded posets by convolving toric
$g$
-polynomials and toric
$g$
-polynomials of poset duals (see Section 5.3 for the details).
There is a geometric way of visualizing Theorem 1.2 when
$P$
is the face poset of certain polytopes that we describe next. We say that a
$d$
-dimensional polytope
$\mathcal {P}\subseteq \mathbb {R}^d$
is admissible if the origin lies in its relative interior and, for every face
$F$
of
$\mathcal {P}$
, the orthogonal projection of the origin to the affine hull of
$F$
lies in the relative interior of
$F$
. If
$\mathcal {P}$
is admissible, we construct the following auxiliary polytope
$\mathcal {Q}\subseteq \mathbb {R}^{d+1}$
:
where
$\mathcal {P}^*$
is the polar dual of the polytope
$\mathcal {P}$
. A theorem due to Broadie [Reference Broadie12] shows that if
$\mathcal {P}$
is admissible, the face poset of
$\mathcal {Q}$
is precisely the poset of all the intervals of
$P$
. Moreover, Broadie also showed that if
$\mathcal {P}$
is not admissible, the facial structure of
$\mathcal {Q}$
differs from the one given by the intervals of
$P$
. When
$\mathcal {P}$
is admissible, the polytope
$\mathcal {Q}$
is often referred to as the geometric antiprism of
$\mathcal {P}$
. From all this discussion, we have the following consequence of Theorem 1.2.
Theorem 1.3. Let
$\mathcal {P}$
be an admissible polytope. Then, the
$Z$
-polynomial of the face poset of
$\mathcal {P}$
encodes the intersection cohomology Betti numbers of the geometric antiprism of
$\mathcal {P}$
.
We learned from a personal communication with Nicholas Proudfoot that a version of the above statement was independently conjectured by Kalle Karu.
Unfortunately, Theorem 1.3 cannot be extended to the case of general polytopes in any reasonable way. It is tempting to believe that if
$P$
is the face poset of a convex polytope, then so is the poset of all intervals of
$P$
. Unfortunately, this belief turns out to be incorrect – we include a more detailed discussion about this in Section 5.1.
When studying the poset of intervals of an Eulerian poset, it is natural to formulate questions about other invariants. Especially relevant in the context of KLS functions are the newly introduced Chow functions defined in [Reference Ferroni, Matherne and Vecchi17]. They take their name from the fact that in the case of hyperplane arrangements or matroids, they model the Hilbert–Poincaré series of a suitable Chow ring. In the Eulerian case, the Chow function encodes information about the number of chains of each size in the poset.
We define the Chow polynomial of an Eulerian poset
$P$
as the value that the Chow function assigns to the interval
$[\widehat {0},\widehat {1}]$
. We prove the following statement about the Chow polynomial of the poset of intervals of an Eulerian poset.
Theorem 1.4. Let
$P$
be an Eulerian poset of rank
$r$
. Then, the Chow polynomial of the poset of intervals of
$P$
equals the second Veronese transform of the Chow polynomial of
$P$
. In particular, the Chow polynomial of
$P$
determines the Chow polynomial of the poset of intervals of
$P$
and vice versa.
(All the Chow polynomials alluded to in the last statement are Eulerian Chow polynomials, that is, Chow polynomials arising from the Eulerian kernel). For the precise definition of Veronese transforms, we refer the reader to the content of Section 4.
Finally, we include one last section in this article: Section 5 contains several remarks and a few open questions that we consider relevant.
2 Preliminaries
2.1 Incidence algebras and KLS functions
Throughout this paper we will use the letter
$P$
to denote a bounded partially ordered set. The minimum element of
$P$
will be customarily denoted by
$\widehat {0}$
whereas the maximum will be denoted by
$\widehat {1}$
. We say that
$P$
is graded if all the maximal chains from
$\widehat {0}$
to
$\widehat {1}$
in
$P$
have the same length. This implies the existence of a map
$\rho :P\to \mathbb {Z}_{\geq 0}$
called the rank function of
$P$
, where
$\rho (s)$
records
$-1$
plus the size of any maximal chain starting at
$\widehat {0}$
and ending at
$s$
. We will customarily write
$\rho _{st}$
to denote
$\rho (t) - \rho (s)$
for
$s\leq t$
.
The incidence algebra of
$P$
, denoted by
$\mathcal {I}(P)$
, is the free
$\mathbb {Z}[x]$
-module spanned by
$\text {Int}(P)$
, the set of all closed intervals of
$P$
. In other words, an element
$a\in \mathcal {I}(P)$
associates to each closed interval
$[s,t]\in \text {Int}(P)$
a polynomial
$a_{st}(x)\in \mathbb {Z}[x]$
. When we need to specify the variable
$x$
, we will write
$a_{st}(x)$
. The product (also known as convolution) of two elements
$a,b\in \mathcal {I}(P)$
is defined via
This product operation makes
$\mathcal {I}(P)$
into an associative algebra, having an identity
$\delta $
, given by
$\delta _{st} = 0$
for
$s < t$
and
$\delta _{ss} = 1$
for all
$s\in P$
. The
$\zeta $
-function of
$P$
is the element
$\zeta \in \mathcal {I}(P)$
such that
$\zeta _{st} = 1$
for all
$s\leq t$
. The Möbius function of
$P$
is the element
$\mu =\zeta ^{-1}$
.
We consider a subalgebra
$\mathcal {I}_{\rho }(P)$
given by
There is an involution
$\mathcal {I}_{\rho }(P) \to \mathcal {I}_{\rho }(P)$
that we denote by
$a\mapsto a^{\text {rev}}$
and that is defined by the following equality:
A
$P$
-kernel is an element
$\kappa \in \mathcal {I}_{\rho }(P)$
such that
$\kappa _{ss}=1$
for all
$s\in P$
and
$\kappa ^{\text {rev}} = \kappa ^{-1}$
.
Theorem 2.1. Let
$\kappa \in \mathcal {I}_{\rho }(P)$
be a
$P$
-kernel. There exists a unique element
$f\in \mathcal {I}_{\rho }(P)$
satisfying the following properties:
-
(i) $f_{ss}(x) = 1$
for all
$s\in P$
. -
(ii) $\deg f_{st}(x) < \frac {1}{2} \rho _{st}$
for all
$s < t$
. -
(iii) $f^{\text {rev}} = \kappa \cdot f$
.
Similarly, there exists a unique element
$g\in \mathcal {I}_{\rho }(P)$
satisfying the following properties:
-
(i’) $g_{ss}(x) = 1$
for all
$s\in P$
. -
(ii’) $\deg g_{st}(x) < \frac {1}{2} \rho _{st}$
for all
$s < t$
. -
(iii’) $g^{\text {rev}} = g \cdot \kappa $
.
Following [Reference Proudfoot28, Section 2], we refer to
$f$
(respectively
$g$
) as the right (respectively left) Kazhdan–Lusztig–Stanley (KLS) function associated with
$\kappa $
. We further define
and call them the right and left Kazhdan–Lusztig–Stanley (KLS) polynomials of
$P$
, respectively.
A complete proof of the preceding theorem can be found in [Reference Proudfoot28, Theorem 2.2]. Another fundamental object in the KLS theory is the Z-function, extensively studied by Proudfoot in [Reference Proudfoot28].
Definition 2.2. Let
$\kappa \in \mathcal {I}_{\rho }(P)$
be a
$P$
-kernel, and let
$f$
(respectively
$g$
) denote its right (respectively left) KLS function. The Z-function associated with
$\kappa $
is the element
$Z \in \mathcal {I}_{\rho }(P)$
defined by
The equality between these two expressions follows from the fact that
$Z = g \kappa f$
. The
$Z$
-function is symmetric, meaning
$Z^{\text {rev}} = Z$
, or equivalently,
2.2 Eulerian Posets
We will assume that the reader is acquainted with the basic properties of Eulerian posets, and we refer to [Reference Stanley32, Section 3.16] for any undefined terminology. However, we make a brief recapitulation of some essential notions that we will use.
A poset
$P$
is said to be Eulerian if the Möbius function satisfies
$\mu _{st} = (-1)^{\rho (t) - \rho (s)}$
for every
$s\leq t$
in
$P$
. An equivalent way of stating this property consists in saying that
$P$
is Eulerian if and only if every nontrivial interval
$[s,t]$
contains the same number of elements of odd rank and even rank. Famous examples of Eulerian posets include: face posets of convex polytopes, cell posets of regular CW-spheres, and Bruhat intervals of Coxeter groups.
The following provides a characterization of Eulerian posets in terms of kernels.
Proposition 2.3 [Reference Stanley31, Proposition 7.1].
Let
$P$
be a finite graded bounded poset. Then
$P$
is Eulerian if and only if the element
$\varepsilon \in \mathcal {I}_{\rho }(P)$
given by
$\varepsilon _{st}(x) = (x-1)^{\rho _{st}}$
is a
$P$
-kernel.
We will refer to
$\varepsilon $
as the Eulerian P-kernel. The left KLS polynomial
$g_P(x)$
arising from the
$P$
-kernel
$\varepsilon $
in an Eulerian poset
$P$
is called the toric g-polynomial of P. It is not hard to see that the right KLS polynomial
$f_P(x)$
arising from
$\varepsilon $
equals the toric
$g$
-polynomial of the dual poset
$P^*$
. Finally, the toric h-polynomial of
$P$
is defined as
More generally,
for each
$s\leq t$
in
$P$
. In Stanley’s book [Reference Stanley32, Section 3.16] this polynomial is denoted with the letter
$f$
, but recall that here we reserve that notation for the right KLS polynomial. The work of Bayer and Ehrenborg [Reference Bayer and Ehrenborg7] provides a thorough study of toric
$g$
-polynomials and toric
$h$
-polynomials of more general (not necessarily Eulerian) posets. We recapitulate their general definition in Section 5.3.
3 The poset of intervals
Throughout the section we will assume that
$P$
is an Eulerian poset. We set
$\widehat {P}:= \text {Int}(P) \cup \left \{ \varnothing \right \}$
to be the poset of all the closed intervals of
$P$
ordered by reverse inclusion (in most sources, including [Reference Stanley32], the empty set is ruled out as a closed interval, but in the present context we need it in order to obtain a bounded poset).
Lemma 3.1. Let
$P$
be an arbitrary graded bounded poset. The poset
$\widehat {P}$
is graded, and for any pair of nonempty intervals
$[s,t], [u,v] \in \text {Int}(P)$
such that
$[s,t] \subseteq [u,v]$
, the rank function
$\widehat {\rho }$
of
$\widehat {P}$
satisfies:
In addition, we have
Proof. We first show that
$\widehat {P}$
is graded. Pick any maximal chain
$\mathcal {C}$
in
$\widehat {P}$
:
Since
$\mathcal {C}$
is unrefinable, we have that
$s_1=t_1=: q_1$
, and for any
$i \geq 1$
we have
For each
$i$
, set
$q_{i+1} := t_{i+1}$
if we are in the first case and
$q_{i+1} := s_{i+1}$
if we are in the second one. By the definition of the
$q_i$
it is not true in general that
$q_{i}< q_{i+1}$
, but they can be organized in an unrefinable chain of
$P$
. Thus, up to reordering the
$q_i$
’s, we have the following maximal chain in
$P$
:
Since
$P$
is graded, it follows that
$n = \rho (P)$
, and thus any maximal chain in
$\widehat {P}$
has length
$\rho (P)+1$
. This shows that
$\widehat {P}$
is graded. This argument also proves the equality (3.2) if we restrict to any interval
$[s,t]$
.
Now we prove (3.1). Given two maximal chains
$u=u_0 < u_1 < \cdots < u_n=s$
and
$t=t_0 < t_1 < \cdots < t_m=v$
with
$n=\rho _{us}$
and
$m=\rho _{tv}$
, we have the following chain of strict inclusions of length
$n+m$
:
from which the inequality
$\widehat {\rho }_{[u,v],[s,t]} \geq \rho _{us}+ \rho _{tv}$
follows.
To prove the reverse inequality, using the property that
$\widehat {\rho }_{[u,v],[s,t]} = \widehat {\rho }_{[u,v],[s,v]} + \widehat {\rho }_{[s,v],[s,t]} $
, it suffices to show that
$\widehat {\rho }_{[u,v],[s,v]} \leq \rho _{us}$
and
$\widehat {\rho }_{[s,v],[s,t]} \leq \rho _{tv}$
. For reasons of symmetry, we only deal with the second one, which is given by the fact that given a chain of strict inclusions
$[s,t] \subsetneq [s,t_1] \subsetneq \cdots \subsetneq [s,v]$
in
$\widehat {P}$
we obtain a chain of strict inequalities
$t < t_1 < \cdots < v$
in
$P$
of the same length as the chain in
$\widehat {P}$
. Hence we get (3.1).
It is a classical result of Lindström [Reference Lindström26] that if
$P$
is Eulerian, then
$\widehat {P}$
is also Eulerian.
Example 3.2. In Figure 1 we depict an Eulerian poset
$P$
of rank
$3$
and its corresponding poset of intervals
$\widehat {P}$
. A direct inspection of the Möbius numbers of
$\widehat {P}$
shows that it is Eulerian, as expected from Lindström’s theorem. Furthermore, both
$P$
and
$\widehat {P}$
are Cohen–Macaulay (and hence Gorenstein*) – the preservation of the Cohen–Macaulay property in this context was established by Baclawski in [Reference Baclawski4, Theorem 7.2].
The following is a crucial result, which describes certain values of the left KLS function of
$\widehat {P}$
in terms of the left and right KLS functions of
$P$
. From now on we denote by
$\widehat {\rho }$
the rank function of
$\widehat {P}$
, and by
$\widehat {\varepsilon }$
the Eulerian kernel in the incidence algebra of
$\widehat {P}$
. Similarly
$\widehat {g}$
and
$\widehat {h}$
will stand for the toric
$g$
- and toric
$h$
-functions of
$\widehat {P}$
.
Theorem 3.3. For any two nonempty intervals
$[s,t] \subseteq [u,v]$
of
$P$
we have the following formula:
An Eulerian poset
$P$
and its poset of intervals
$\widehat {P}$
.

Figure 1 Long description
The figure contains two panels.
Left panel: A Hasse diagram of an Eulerian poset. At the top is a node labeled 1 hat. Below it are two nodes, c on the left and d on the right, both connected to 1 hat. Below these are two nodes, a on the left and b on the right. Node c connects to a and b. Node d connects to a and b. At the bottom is a node labeled 0 hat, which connects to both a and b.
Right panel: A larger, more complex Hasse diagram representing the poset of intervals. At the top is a single node labeled with the empty set symbol. This node connects to six nodes in the layer below, labeled from left to right as 0 hat, a, b, c, d, and 1 hat.
The next layer down contains eight nodes. From left to right, they are labeled 0 hat a, 0 hat b, a c, a d, b c, b d, c 1 hat, and d 1 hat. These nodes represent intervals and are connected to the nodes in the layer above based on their endpoints.
The fourth layer down contains four nodes labeled 0 hat c, 0 hat d, a 1 hat, and b 1 hat. These are connected to the interval nodes above them.
At the very bottom is a single node labeled P, which is connected to all four nodes in the fourth layer.
Proof. Let us consider the incidence algebra element
$z\in \mathcal {I}(\widehat {P})$
given by
for each pair of closed intervals of
$P$
.
By Theorem 2.1 and the uniqueness of KLS functions, in order to show the validity of equation (3.3), it suffices to show that
$z$
satisfies the following three properties:
-
(i’) $z_{[s,t],[s,t]} = 1$
, -
(ii’) $\deg {z_{[u,v],[s,t]}(x)} < \frac {1}{2} \widehat {\rho }_{[u,v],[s,t]}$
for any
$[s,t] \subsetneq [u,v]$
, and -
(iii’) $z^{\text {rev}} = z\cdot \widehat {\varepsilon }$
in
$\mathcal {I}(\widehat {P})$
.
Note that (i’) is immediate from the fact that
$f$
and
$g$
are themselves the KLS functions in
$P$
, because
$z_{[s,t],[s,t]} = g_{ss}(x)f_{tt}(x) = 1\cdot 1 = 1$
.
On the other hand, similarly, (ii’) follows again from the fact that
$f$
and
$g$
are the KLS functions in
$P$
, along with the computation of the rank function of
$\widehat {P}$
:
We now prove (iii’):
where we applied the definitions of
$z$
and the involution
$\text {rev}$
, and where in the last step we used that
$g$
is the left KLS function and
$f$
is the right KLS function of
$P$
,
where we expanded the last product as a product of convolutions,
after rewriting the sum as a sum over intervals of
$P$
,
where in the last step we used the definition of
$z$
once more. The proof is thus complete.
Now, having the above formula for the toric
$g$
-function (that is, the left KLS function) of
$\widehat {P}$
, we can prove the following result, which directly implies the validity of Theorem 1.2 when specialized to the case
$[u,v] = [\widehat {0},\widehat {1}]$
.
Theorem 3.4. Let
$P$
be an Eulerian poset, and let
$\widehat {P}$
be the poset of closed intervals of
$P$
. Consider the
$Z$
-function,
$Z\in \mathcal {I}(P)$
associated to the
$\varepsilon $
-kernel in
$P$
, and the toric
$h$
-function,
$\widehat {h}\in \mathcal {I}(\widehat {P})$
associated to the kernel
$\widehat {\varepsilon }$
in
$\widehat {P}$
. Then, for each pair of elements
$u \leq v$
in
$P$
, we have:
In particular, the
$Z$
-function at any interval of
$P$
equals the toric
$h$
-function at a principal upper order ideal of
$\widehat {P}$
.
Proof. We have:
by definition of
$Z$
-function and convolution in
$\mathcal {I}(P)$
,
because
$g^{\text {rev}} = g\cdot \varepsilon $
is the left KLS function associated to the kernel
$\varepsilon $
rewriting the sums in order to transform it to a convolution in
$\mathcal {I}(\widehat {P})$
(note that the case
$[s,t] = \varnothing $
may never happen)
where we employed Theorem 3.3 together with equation (3.2),
by adding and subtracting the missing term to write the second factor using a convolution,
by using that
$\widehat {g}$
is the left KLS function associated to the kernel
$\widehat {\varepsilon }$
in
$\widehat {P}$
where we used the definition of the toric
$h$
-function in
$\widehat {P}$
. The proof is complete.
4 Chow polynomials and Veronese transforms
If
$P$
is Eulerian, the main construction by Ferroni, Matherne, and Vecchi in [Reference Ferroni, Matherne and Vecchi17] associates to the kernel
$\varepsilon $
a special element
$\mathrm {H}\in \mathcal {I}(P)$
as follows. First, define
$\overline {\varepsilon }\in \mathcal {I}_{\rho }(P)$
as
and consider
$\mathrm {H} := -\left (\overline {\varepsilon }\right )^{-1}$
. This element is called the Chow function and enjoys many interesting properties. We refer to [Reference Ferroni, Matherne and Vecchi17] for the precise definitions.
In [Reference Ferroni, Matherne and Vecchi17, Theorem 5.4] it is proved that the Chow polynomial of an Eulerian poset
$P$
equals the
$h$
-polynomial of
$\Delta (P)$
, the order complex of
$P$
. As we will see now, the enumeration of chains of
$P$
according to size (that is, the
$f$
-vector of
$\Delta (P)$
) fully determines the
$f$
-vector of
$\Delta (\widehat {P})$
. Therefore, the Chow polynomial of
$P$
fully determines the Chow polynomial of
$\widehat {P}$
. We briefly introduce the notion of Veronese transforms.
Definition 4.1. Let
$\{h_i\}_{i=0}^r$
be a sequence of real numbers, let
$d\geq r$
, and consider the generating function:
The m-th Veronese transform of the sequence
$\{h_i\}_{i=0}^r$
(with respect to degree
$d$
) is the unique sequence
$h^{\prime }_0,\ldots ,h^{\prime }_{d}$
satisfying:
It is a standard fact about generating functions that, as long as the numerator on the right-hand side in equation (4.1) does not vanish at
$x=1$
, the sequence
$\{a_n\}_{n\geq 0}$
is interpolated by a polynomial of degree exactly
$d$
. In other words, there exists a degree
$d$
polynomial
$p(x)\in \mathbb {R}[x]$
such that
$a_n = p(n)$
for each
$n\in \mathbb {Z}_{\geq 0}$
. This observation implies that the sequence
$\{h^{\prime }_i\}_{i=0}^d$
is enough to reconstruct the sequence
$\{h_i\}_{i=0}^r$
.
Theorem 4.2. Let
$P$
be an Eulerian poset of rank
$r$
. Then, the Chow polynomial of
$\widehat {P}$
equals the second Veronese transform of the Chow polynomial of
$P$
(with respect to degree
$d=r$
). In particular, the Chow polynomial of
$P$
determines the Chow polynomial of
$\widehat {P}$
and vice versa.
Proof. Recall that the zeta polynomial (not to be confused with the
$Z$
-polynomial of Proudfoot) of a poset
$Q$
enumerates multichains in
$Q$
according to their size (see [Reference Stanley32, Section 3.12]). We use the notation
$\zeta _Q(n)$
for the zeta polynomial in order to avoid confusion with the
$Z$
-polynomial. Precisely,
$\zeta _Q(n)$
enumerates multichains of elements in
$Q$
of size
$n-1$
.
Because of how
$\widehat {P}$
is defined,
$\zeta _{\widehat {P}}(n)$
enumerates multichains of intervals of
$P$
. These can have the form
However, we allow some of the intervals to be the empty set. If
$[s_1,t_1] = \cdots = [s_j,t_j] = \varnothing $
for
$j\geq 0$
, this is equivalent to enumerating multichains of
$2(n-j-1)$
elements in
$P$
:
This gives the relationship:
In [Reference Ferroni, Matherne and Vecchi17, Proof of Theorem 5.4] it is proved that the following relation holds for any Eulerian poset
$Q$
:
Applying this for
$Q = \widehat {P}$
(which has rank
$r+1 = \operatorname {\mathrm {rk}}(P) + 1$
) results in:
Equating both sides in the last equation and using that
$\zeta _P(0) = 0$
yields:
By applying again equation (4.3) for
$Q=P$
, we have that
$\mathrm {H}_{\widehat {P}}(x)$
is the second Veronese transform of
$\mathrm {H}_{P}(x)$
, as claimed.
Example 4.3. Let
$P$
be the Boolean lattice of rank
$r$
. The Chow polynomial of
$P$
is an Eulerian polynomial. The poset
$\widehat {P}$
is the face lattice of the
$(r+1)$
-dimensional cross-polytope. The Chow polynomial of
$\widehat {P}$
is the type B Eulerian polynomial. It is a well-known fact that the second Veronese transform of the Eulerian polynomials agrees with the type B Eulerian polynomials.
Remark 4.4. A result of Hetyei [Reference Hetyei19, Proposition 12] implies that the (deconed) order complex of the poset of intervals of
$\widehat {P}$
is a Tchebysheff triangulation of the first kind of the suspension of the (deconed) order complex of
$P$
. In particular, by [Reference Hetyei19, Theorem 6] one can write down, in a different language, the relationship that relates
$\mathrm {H}_P(x)$
and
$\mathrm {H}_{\widehat {P}}(x)$
using the so-called Tchebysheff polynomials of the first kind.
Remark 4.5. A long-standing conjecture by Brenti and Welker in [Reference Brenti and Welker10] asserts (in an equivalent form) that the Chow polynomial of the face poset of a polytope is real-rooted. A stronger version, suggested in the work by Athanasiadis and collaborators [Reference Athanasiadis and Tzanaki3, Reference Athanasiadis and Kalampogia-Evangelinou2], suggests that the Chow polynomial of a Gorenstein* poset is real-rooted. See the discussion in [Reference Ferroni, Matherne and Vecchi17, Section 5.2].
By combining the preceding theorem with a result by Anwar and Nazir [Reference Anwar and Nazir1, Theorem 4.1], we have that the nonnegativityFootnote 1 of the coefficients of
$\mathrm {H}_P(x)$
automatically implies the nonnegativity and real-rootedness of
$\mathrm {H}_{\widehat {P}}(x)$
. In other words, it follows that if
$P$
is Gorenstein* then
$\mathrm {H}_{\widehat {P}}(x)$
is real-rooted. This provides some (modest) evidence in favor of [Reference Ferroni, Matherne and Vecchi17, Conjecture 1.8].
5 Final remarks and open questions
5.1 Polytopes and geometric antiprisms
Whether the poset of intervals of the face poset of a polytope is itself the face poset of a polytope was considered as an open question in Grünbaum’s book [Reference Grünbaum18, p. 66], and was explicitly proposed as a problem by Lindström in [Reference Lindström27]. Only recently a counterexample was found by Dobbins [Reference Dobbins13].
On the positive side, however, a result by Björner [Reference Björner8, Theorem 6.1] ensures that if
$P$
is the face poset of a convex polytope, then the poset of intervals of
$P$
is the face poset of a regular CW-sphere whose boundary complex is polyhedral and shellable. In particular, proving a desirable property of toric
$h$
-polynomials of this kind of sphere yields desirable properties for
$Z$
-polynomials of polytopes.
It is a well-known fact that rational polytopes do not exhaust all combinatorial types of polytopes. However, within this special class of posets (that is, face posets of rational polytopes) it is not known whether the operation of taking the poset of intervals produces another element in the class.
Furthermore, Theorem 1.3 does not preclude the possibility that for an arbitrary rational polytope
$\mathcal {P}$
there exists a nonprojective compact toric variety whose intersection cohomology Betti numbers yield the coefficients of the
$Z$
-polynomial of the face poset of
$\mathcal {P}$
. We leave this as an open question.
Question 5.1. Let
$P$
be the face poset of a rational polytope. Is the
$Z$
-polynomial of
$P$
the intersection cohomology Poincaré polynomial of some (not necessarily projective) compact toric variety?
5.2 A comparison with the matroid case
Let us explain how our results compare with the relationship between the Kazhdan–Lusztig polynomial and the
$Z$
-polynomial of a matroid (see [Reference Elias, Proudfoot and Wakefield15] and [Reference Proudfoot, Xu and Young29] for the precise definition of these polynomials). For a matroid
$\mathsf {M}$
with lattice of flats
$\mathcal {L}(\mathsf {M})$
, Proudfoot–Xu–Young [Reference Proudfoot, Xu and Young29] define
where
$\mathsf {M}/F$
denotes the contraction of
$\mathsf {M}$
by the flat
$F$
. Conversely,
Thus, in the matroid setting,
$Z_{\mathsf {M}}$
is built from the Kazhdan–Lusztig polynomials of all contractions of
$\mathsf {M}$
, and
$P_{\mathsf {M}}$
can be recovered from the corresponding
$Z$
-polynomials by Möbius inversion. In other words, the
$Z$
-polynomial of a matroid does not depend on the
$Z$
-polynomials of all minors, but rather on the
$Z$
-polynomials of all contractions (or upper intervals of the poset). Geometrically, when
$\mathsf {M}$
is realizable,
$P_{\mathsf {M}}$
is the intersection cohomology polynomial of the reciprocal plane, whereas
$Z_{\mathsf {M}}$
is the intersection cohomology polynomial of a projective variety
$Y(V)$
known as the matroid Schubert variety. The strata of
$Y(V)$
are indexed by flats, and the contribution of the stratum indexed by
$F$
is governed by the Kazhdan–Lusztig polynomial of the contraction
$\mathsf {M}/F$
.
For Eulerian posets, and in particular for face posets of polytopes, the exact analogue is not a one-sided sum over “upper intervals.” The reason is that the matroidal left KLS function is trivial, whereas the Eulerian left KLS function is the toric
$g$
-function.
From the definitions, we have
This equation makes the role of the interval poset more transparent. Let
$\widehat P=\text {Int}(P)\cup \{\varnothing \}$
, ordered by reverse inclusion, and let
$\widehat g,\widehat h$
be its toric
$g$
- and
$h$
-functions. For
$u\leq s\leq t\leq v$
, Theorem 3.3 gives
In matroids, flats index the pieces appearing in the formula for
$Z_{\mathsf {M}}$
, and the relevant local polynomials are the Kazhdan–Lusztig polynomials of contractions. For Eulerian posets, intervals
$[s,t]$
play the role of flats, and the corresponding local polynomial is the product
$ g_{us}(x)f_{tv}(x), $
that is, the toric
$g$
-polynomial of a lower interval times the toric
$g$
-polynomial of a dual upper interval. The fact that this product is exactly
$\widehat g_{[u,v],[s,t]}$
is the polytopal replacement for the matroidal “contraction” term.
When
$P$
is the face poset of an admissible rational polytope
$\mathcal P$
, Broadie’s theorem identifies
$\widehat P$
with the face poset of the geometric antiprism
$\mathcal Q$
. Hence the equality
$Z_P(x) = h_{\widehat {P}}(x)$
says that
$Z_P$
is the intersection cohomology Poincaré polynomial of the toric variety associated with
$\mathcal Q$
. The usual torus-orbit stratification of this toric variety is indexed by the faces of
$\mathcal Q$
, and therefore, under Broadie’s identification, by intervals
$[s,t]$
of
$P$
. The formula in Theorem 3.3 describes the toric
$g$
-polynomial attached to the interval between two such strata. Consequently, there is a much better analogy between the matroid Kazhdan–Lusztig polynomial and the toric
$g$
-polynomial than the analogy between the
$Z$
-polynomial of a realizable matroid and the
$Z$
-polynomial of a (rational, admissible) polytope. One should not expect
$Z_P$
to be expressed only in terms of the single polynomial
$g_P$
; just as the matroid formula uses the Kazhdan–Lusztig polynomials of all contractions, the polytopal formula uses the toric
$g$
-polynomials of all relevant intervals and dual intervals.
5.3 Failure for more general posets
In a classical paper by Bayer and Ehrenborg [Reference Bayer6], a more general notion of toric
$h$
-polynomial is defined for posets that are not necessarily Eulerian. It is convenient to state their definition using the terminology of incidence algebras. They define two elements
$g,h\in \mathcal {I}(P)$
for an arbitrary graded poset
$P$
as follows. First, they set as base cases
$h_{ss}(x) = g_{ss}(x) = 1$
for every
$s\in P$
, and then the following double recursion for the remaining intervals:
where
$U_{\leq m}$
denotes the linear operator that truncates a polynomial to degree
$\leq m$
. It is not hard to see that this gives two well-defined objects that match our versions of the polynomials for Eulerian posets. It may be tempting to define an analog of the right KLS function (which we denoted as
$f$
) by considering
where
$g^*_{ts}$
denotes the Bayer–Ehrenborg toric
$g$
-polynomial of the interval
$[t,s]$
in the dual poset
$P^*$
. Once this is done, a natural definition for the
$Z$
-function would be:
This of course agrees with Proudfoot’s definition when
$P$
is Eulerian. Unfortunately, Theorem 1.2 is not true for arbitrary graded posets using these definitions. A direct computation with small graded non-Eulerian posets quickly yields several counterexamples.
5.4 A relation with the cd-index
Every Eulerian poset can be associated with a special bivariate polynomial
$\Phi \in \mathbb {Z}\left <c,d\right>$
in two noncommuting variables
$c$
and
$d$
, often called the cd-index. We refer to [Reference Bayer6] for a detailed account of the
$cd$
-index of Eulerian posets. A result of Bayer and Ehrenborg [Reference Bayer and Ehrenborg7, Theorem 4.2] allows for the computation of the toric
$h$
-polynomial of an Eulerian poset
$P$
as a specialization of the
$cd$
-index of
$P$
. Furthermore, by a result of Jojić [Reference Jojić21], the
$cd$
-index of the poset of intervals of
$P$
is itself a (nice) specialization of the
$cd$
-index of
$P$
. Combining these two results with our Theorem 1.2 implies that one may write down an explicit (but fairly complicated) specialization of the
$cd$
-index of
$P$
that retrieves the
$Z$
-polynomial.
A Gorenstein* poset with bad toric
$h$
- and
$Z$
-polynomials.

5.5 Some open questions
If
$P$
is a Gorenstein* poset, a subtle result of Karu about the
$cd$
-index [Reference Karu23] implies that the (Eulerian) Chow polynomial of
$P$
is
$\gamma $
-positive (see [Reference Ferroni, Matherne and Vecchi17, Theorem 5.7]). It is natural to ask if the
$Z$
-polynomial of a Gorenstein* poset enjoys the same property. Unfortunately, no. In fact, being Gorenstein* is not enough to even guarantee the nonnegativity of the
$Z$
-polynomial or the
$h$
-polynomial. For example, the poset in Figure 2 is Gorenstein*, yet we have:
However, the situation appears to be drastically different when the poset
$P$
is a lattice in addition to being Gorenstein*. In fact, a long-standing (and still open) conjecture by Stanley [Reference Stanley30, Conjecture 4.2(d)] postulates that the toric
$g$
-polynomial of a Gorenstein* lattice is nonnegative, which is equivalent to asserting that the toric
$h$
-polynomial of such posets is unimodal. In particular, since
$P$
being a Gorenstein* lattice implies
$\widehat {P}$
being a Gorenstein* lattice, this conjecture would imply that
$Z_P(x)$
should also be unimodal for all Gorenstein* lattices. However, computer experiments led us to consider the following question.
Question 5.2. Are the
$Z$
-polynomials of Gorenstein* lattices
$\gamma $
-positive?
We have one additional reason to formulate the above question. The analogue of this statement for
$Z$
-polynomials of loopless matroids was proved by Ferroni, Matherne, Stevens, and Vecchi in [Reference Ferroni, Matherne, Stevens and Vecchi16, Theorem 4.7].
Note that the example of Figure 2 implies that an affirmative answer to the above question cannot simply come from the nonnegativity of the
$cd$
-index proved by Karu for Gorenstein* posets. In other words, even though it is possible to write a specialization of the
$cd$
-index that retrieves the
$Z$
-polynomial, this specialization cannot be positive, and even less so for the
$\gamma $
-polynomial associated to
$Z$
.
Acknowledgments
We thank Michele D’Adderio, Matt Larson, and Alan Stapledon for several conversations around the themes in this paper. We are especially grateful to Nick Proudfoot for motivating this research and for many suggestions and comments that improved the quality of this paper. The first part of this project was carried out when Luis Ferroni was a Minerva Research Fellow at the Institute for Advanced Study; Luis Ferroni is currently a member of the GNSAGA group of the Istituto Nazionale di Alta Matematica (INdAM).
Competing interests
The authors have no competing interests to declare.
Funding statement
None.















