Enriched chain polytopes
Hidefumi Ohsugi, Akiyoshi Tsuchiya

TL;DR
This paper introduces the enriched chain polytope associated with a poset, revealing its reflexive structure, unimodular triangulation, and connections to enriched order polynomials, advancing the understanding of polyhedral and combinatorial properties.
Contribution
It defines the enriched chain polytope, proves its reflexivity and triangulation properties, and links its Ehrhart polynomial to enriched order polynomials, providing new insights into its combinatorial structure.
Findings
$ ext{E}_{P}$ is a reflexive polytope with a flag unimodular triangulation.
The $h^*$-polynomial of $ ext{E}_{P}$ equals the $h$-polynomial of a flag triangulation of a sphere.
The Ehrhart polynomial of $ ext{E}_{P}$ coincides with the left enriched order polynomial of $P$.
Abstract
Stanley introduced a lattice polytope arising from a finite poset , which is called the chain polytope of . The geometric structure of has good relations with the combinatorial structure of . In particular, the Ehrhart polynomial of is given by the order polynomial of . In the present paper, associated to , we introduce a lattice polytope , which is called the enriched chain polytope of , and investigate geometric and combinatorial properties of this polytope. By virtue of the algebraic technique on Gr\"{o}bner bases, we see that is a reflexive polytope with a flag regular unimodular triangulation. Moreover, the -polynomial of is equal to the -polynomial of a flag triangulation of a sphere. On the other hand, by showing that the Ehrhart polynomial of …
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.
Enriched chain polytopes
Hidefumi Ohsugi and Akiyoshi Tsuchiya
Hidefumi Ohsugi, Department of Mathematical Sciences, School of Science and Technology, Kwansei Gakuin University, Sanda, Hyogo 669-1337, Japan
Akiyoshi Tsuchiya, Graduate school of Mathematical Sciences, University of Tokyo, Komaba, Meguro-ku, Tokyo 153-8914, Japan
Abstract.
Stanley introduced a lattice polytope arising from a finite poset , which is called the chain polytope of . The geometric structure of has good relations with the combinatorial structure of . In particular, the Ehrhart polynomial of is given by the order polynomial of . In the present paper, associated to , we introduce a lattice polytope , which is called the enriched chain polytope of , and investigate geometric and combinatorial properties of this polytope. By virtue of the algebraic technique on Gröbner bases, we see that is a reflexive polytope with a flag regular unimodular triangulation. Moreover, the -polynomial of is equal to the -polynomial of a flag triangulation of a sphere. On the other hand, by showing that the Ehrhart polynomial of coincides with the left enriched order polynomial of , it follows from works of Stembridge and Petersen that the -polynomial of is -positive. Stronger, we prove that the -polynomial of is equal to the -polynomial of a flag simplicial complex.
Key words and phrases:
reflexive polytope, flag triangulation, -positive, real-rooted, left enriched partition, left peak polynomial, Gal’s Conjecture, Kruskal–Katona inequalities
2010 Mathematics Subject Classification:
05A15, 05C31, 13P10, 52B12, 52B20
Introduction
A lattice polytope of dimension is a convex polytope all of whose vertices have integer coordinates. Given a positive integer , we define
[TABLE]
The study on originated in Ehrhart [5] who proved that is a polynomial in of degree with the constant term . We say that is the Ehrhart polynomial of . The generating function of the lattice point enumerator, i.e., the formal power series
[TABLE]
is called the Ehrhart series of . It is well known that it can be expressed as a rational function of the form
[TABLE]
The polynomial is a polynomial in of degree at most with nonnegative integer coefficients ([18]) and it is called the -polynomial (or the -polynomial) of . Moreover, one has , where is the normalized volume of .
In [19], Stanley introduced a class of lattice polytopes associated with finite partially ordered sets. Let be a partially ordered set (poset, for short). An antichain of is a subset of consisting of pairwise incomparable elements of . Note that the empty set is an antichain of . The chain polytope of is the convex hull of
[TABLE]
where is -th unit coordinate vector of and the empty set corresponds to the origin of . Then is a lattice polytope of dimension . There is a close interplay between the combinatorial structure of and the geometric structure of . For instance, it is known the Ehrhart polynomial and the order polynomial are related by . On the other hand, has many interesting properties. In particular, the toric ring of is an algebra with straightening laws, and thus the toric ideal possesses a squarefree quadratic initial ideal ([8]). Moreover, is of interest in representation theory ([2]) and statistics ([24]).
Now, we introduce a new class of lattice polytopes associated with posets. The enriched chain polytope is the convex hull of
[TABLE]
Then . It is easy to see that is centrally symmetric (i.e., for any facet of , is also a facet of ), and the origin of is the unique interior lattice point of . In the present paper, we investigate geometric and combinatorial properties of .
A lattice polytope of dimension is called reflexive if the origin of is a unique lattice point belonging to the interior of and its dual polytope
[TABLE]
is also a lattice polytope, where is the usual inner product of . It is known that reflexive polytopes correspond to Gorenstein toric Fano varieties, and they are related to mirror symmetry (see, e.g., [1, 4]). In each dimension there exist only finitely many reflexive polytopes up to unimodular equivalence ([13]) and all of them are known up to dimension ([12]). Recently, several classes of reflexive polytopes are constructed by the virtue of the algebraic technique on Gröbner bases (c.f., [10, 11, 15]). By showing the toric ideal of possesses a squarefree quadratic initial ideal (Theorem 1.3), in Section 1, we prove the following.
Theorem 0.1**.**
*Let be a poset. Then is a reflexive polytope having a flag regular unimodular triangulation such that each maximal simplex contains the origin as a vertex. *
We now turn to the discussion of the Ehrhart polynomial and the -polynomial of . In fact, the Ehrhart polynomial of is equal to a combinatorial polynomial associated to . In Section 2, we prove the following.
Theorem 0.2**.**
Let be a naturally labeled poset. Then one has
[TABLE]
where is the left enriched order polynomial of .
In [21], Stembridge developed the theory of enriched -partitions, in analogy with Stanley’s theory of -partitions. In the theory, enriched order polynomials were introduced. On the other hand, Petersen [17] introduced slightly different notion, left enriched -partitions and left enriched order polynomials. Please refer to Section 2 for the details. Therefore, from Theorem 0.2 we call the “enriched” chain polytope of .
Next, we discuss Gal’s Conjecture for enriched chain polytopes. Gal [6] conjectured that the -polynomial of a flag triangulation of a sphere is -positive. On the other hand, Theorem 0.1 implies that coincides with the -polynomial of a flag triangulation of a sphere (Corollary 2.1). Therefore, is expected to be -positive. From works of Stembridge [21] and Petersen [17] and Theorem 0.2, we can obtain the following.
Theorem 0.3**.**
Let be a naturally labeled poset. Then the -polynomial of is
[TABLE]
where is the left peak polynomial of . In particular, is -positive. Moreover, is real-rooted if and only if is real-rooted.
Note that is not necessarily real-rooted ([22]).
Finally, we discuss Nevo-Petersen’s Conjecture for enriched chain polytopes. In [14], Nevo and Petersen made a stronger conjecture than Gal’s Conjecture. They conjectured that the -polynomial of a flag triangulation of a sphere is equal to the -polynomial of a simplicial complex. In other words, the coefficients of the -polynomial of a flag triangulation of a sphere satisfy Kruskal-Katona inequalities. In Section 3, we construct explicit flag simplicial complexes whose -polynomials are the -polynomials of enriched chain polytopes (Theorem 3.4).
Acknowledgment
The authors were partially supported by JSPS KAKENHI 18H01134 and 16J01549.
1. squarefree quadratic Gröbner bases
In this section, we prove Theorem 0.1. First, we see the geometric structure of of a finite poset . Given , let denote the closed orthant . Let denote the set of linear extensions of . It is known [19, Corollary 4.2] that the normalized volume of the chain polytope is .
Lemma 1.1**.**
Work with the same notation as above. Then each is the convex hull of the set and unimodularly equivalent to the chain polytope of . In particular, the normalized volume of is .
Proof.
It is enough to show that . Let . Then , where , , and each belongs to . Suppose that -th component of is positive and -th component of is negative. Then we replace in with , where and . Repeating this procedure finitely many times, we may assume that -th component of each vector is nonnegative (resp. nonpositive) if (resp. ). Then each belongs to and hence . ∎
In order to show that is reflexive and has a flag regular unimodular triangulation, we use an algebraic technique on Gröbner bases. We recall basic materials and notation on toric ideals. Let be the Laurent polynomial ring in variables over a field . If , then is the Laurent monomial . Let be a lattice polytope and . Then, the toric ring of is the subalgebra of generated by over . We regard as a homogeneous algebra by setting each . Let denote the polynomial ring in variables over . The toric ideal of is the kernel of the surjective homomorphism defined by for . It is known that is generated by homogeneous binomials. See, e.g., [23]. The following lemma follows from the same argument in [9, Proof of Lemma 1.1].
Lemma 1.2**.**
Let be a lattice polytope of dimension such that the origin of is contained in its interior. Suppose that any lattice point in is a linear integer combination of the lattice points in . If there exists a monomial order such that the initial ideal is generated by squarefree monomials which do not contain the variable corresponding to the origin, then is reflexive and has a regular unimodular triangulation.
Let be a poset and let denote the polynomial ring
[TABLE]
in variables over a field . In particular, the origin corresponds to the variable . Then the toric ideal of is the kernel of a ring homomorphism defined by . In addition,
[TABLE]
is the toric ideal of the chain polytope of . Hibi and Li essentially constructed a squarefree quadratic initial ideal of in [8]. Let be the finite distributive lattice consisting of all poset ideals of , ordered by inclusion. Given a subset , let denote the set of all maximal elements of . Then is an antichain of . For a subset of , the poset ideal of generated by is the smallest poset ideal of which contains . Given poset ideals , let denote the poset ideal of generated by . Then Hibi and Li proved in [8, Proof of Theorem 2.1] that the set of all binomials of the form
[TABLE]
is a Gröbner basis of with respect to a monomial order . Here the initial monomial of each binomial is the first monomial. It is known [23, Proposition 1.11] that there exists a nonnegative weight vector such that . Then we define the weight vector on such that the weight of each variable with respect to is the weight of the variable with respect to . In addition, let be the weight vector on such that the weight of each variable with respect to is . Fix any monomial order on as a tie-breaker. Let be a monomial order on such that if and only if one of the following holds:
- •
The weight of is less than that of with respect to ;
- •
The weight of is the same as that of with respect to , and the weight of is less than that of with respect to ;
- •
The weight of is the same as that of with respect to and , and .
Theorem 1.3**.**
Work with the same notation as above. Let be the set of all binomials
[TABLE]
where and ,
[TABLE]
where
- (a)
For any such that , we have ;
- (b)
For any such that , we have ;
- (c)
For some , we have , , , .
Then is a Gröbner basis of with respect to a monomial order . The initial monomial of each binomial is the first monomial. In particular, the initial ideal is generated by squarefree quadratic monomials which do not contain the variable .
Proof.
It is easy to see that any binomial of type (1) belongs to . In analogy to [8], any binomial of type (2) belongs to . Hence is a subset of . For a binomial of type (2), let and . Since satisfies conditions (a) and (b), we have . Hence the weight of and are the same with respect to . Thus the initial monomial of each binomial is the first monomial. Assume that is not a Gröbner basis of with respect to . Let . Then there exists a non-zero irreducible homogeneous binomial such that neither nor belongs to . Since both and cannot be divided by with and for some , , they are of the form
[TABLE]
where
- (a)
For any such that , we have ;
- (b)
For any such that , we have .
Moreover since and cannot be divided by the initial monomial of a binomial in (2), we may assume that, for some , we have
[TABLE]
with and . Since and satisfy conditions (a) and (b) and since belongs to , it then follows that . This contradicts the assumption that is irreducible. ∎
By the correspondence [23, Chapter 8] between a squarefree quadratic initial ideal of and a flag regular unimodular triangulation of , Theorem 0.1 follows from Lemma 1.2 and Theorem 1.3.
2. -positivity and real-rootedness of
the -polynomial of
In this section, we discuss the Ehrhart polynomial and -polynomial of of a finite poset . In particular, we prove Theorems 0.2 and 0.3.
Let be a poset with elements and let for . A map is called an enriched -partition ([21]) if, for all with , satisfies
- •
;
- •
;
- •
;
- •
.
In the present paper, we always assume that is naturally labeled. Then the above condition is equivalent to the following conditions:
- •
;
- •
.
For each , let denote the number of enriched -partitions . Then is a polynomial in called the enriched order polynomial of .
On the other hand, Petersen [17] introduced slightly different notion “left enriched -partitions” as follows. Let for . A map is called a left enriched -partition if, for all with , satisfies the the following conditions:
- (i)
;
- (ii)
.
For each , let denote the number of left enriched -partitions . Then is a polynomial in called the left enriched order polynomial of . We can compute the left enriched order polynomial of from the enriched order polynomial of . In fact, it follows that
[TABLE]
Now, we prove Theorem 0.2.
Proof of Theorem 0.2.
It is enough to construct a bijection from to the set of all left enriched -partitions . Let be a map defined by where
[TABLE]
for each . (This map arising from the map defined in [19, Theorem 3.2].)
Claim 1. ( is well-defined.) By condition (i) for a left enriched -partition , we have by a result of Stanley [19, Theorem 3.2]. Hence, by Lemma 1.1, belongs to .
Let be a map defined by , where
[TABLE]
for each .
Claim 2. ( is well-defined.) If belongs to , then belongs to by Lemma 1.1. Since is an extension of a map given in [19, Proof of Theorem 3.2], satisfies condition (i) in the definition of a left enriched partition. Suppose that , and . Then . Since and , we have , a contradiction. Thus is a left enriched -partition.
Finally, we show that is a bijection. It is enough to show that is the inverse of . Let for . By conditions (i) and (ii) for together with the definition of and , we have
[TABLE]
Thus the map satisfies
[TABLE]
for any . As stated in [19, Proof of Theorem 3.2], we have () for any . Thus is an identity map. Conversely, let for and let . By conditions (i) and (ii) for together with the definition of and , we have
[TABLE]
Thus the map satisfies
[TABLE]
As stated in [19, Proof of Theorem 3.2], we have for . Thus is an identity map. Therefore is a bijection, as desired. ∎
Let be a polynomial with real coefficients and . We now focus on the following properties.
- (RR)
We say that is real-rooted if all its roots are real.
- (LC)
We say that is log-concave if for all .
- (UN)
We say that is unimodal if for some .
If all its coefficients are nonnegative, then these properties satisfy the implications
[TABLE]
On the other hand, the polynomial is said to be palindromic if . It is -positive if is palindromic and there are such that . The polynomial is called -polynomial of . We can see that a -positive polynomial is real-rooted if and only if its -polynomial is real-rooted. If is a palindromic and real-rooted, then it is -positive. Moreover, if is -positive, then it is unimodal.
In the rest of the present section, we discuss the -positivity and the real-rootedness on the -polynomial of . It is known [7] that the -polynomial of a lattice polytope with the interior lattice point is palindromic if and only if is reflexive. Moreover, if a reflexive polytope has a regular unimodular triangulation, then the -polynomial is unimodal ([3]). On the other hand, if a reflexive polytope has a flag regular unimodular triangulation such that each maximal simplex contains the origin as a vertex, then the -polynomial coincides with the -polynomial of a flag triangulation of a sphere. Hence from Theorem 1.3, we can show the following.
Corollary 2.1**.**
Let be a poset. Then the -polynomial of is palindromic, unimodal, and coincides with the -polynomial of a flag triangulation of a sphere.
Given a linear extension of a poset , a peak (resp. a left peak) of is an index (resp. ) such that , where we set . Let (resp. ) denote the number of peaks (resp. left peaks) of . Then the peak polynomial and the left peak polynomial of are defined by
[TABLE]
and
[TABLE]
Petersen [17] computed the generating function for a left enriched order polynomial:
Lemma 2.2** ([17, Theorem 4.6]).**
Let be a naturally labeled poset. Then we have the following generating function for the left enriched order polynomial of :**
[TABLE]
Therefore, Theorem 0.3 follows from Theorem 0.2 and Lemma 2.2.
Remark 2.3**.**
A poset is said to be narrow if the vertices of may be partitioned into two chains. Stembridge [22, Proposition 1.1] essentially pointed out that, if is narrow, then coincides with the -Eulerian polynomial
[TABLE]
where is the number of descents of . Thus, for a narrow poset ,
[TABLE]
This fact coincides with the result in [16] for a bipartite permutation graph. Note that a naturally labeled narrow poset such that is not real-rooted is given in [22].
Given a poset , the comparability graph of is the graph on the vertex set with adjacent if either or . Then is an antichain of if and only if is a stable set (independent set) of . Hence if for posets and . Thus we have the following immediately.
Corollary 2.4**.**
Both the (left) enriched order polynomial of and the (left) peak polynomial of depend only on the comparability graph of .
3. The -complexes
In [14], Nevo and Petersen conjectured the following.
Conjecture 3.1** ([14, Conjecture 1.4]).**
The -polynomial of any flag triangulation of a sphere is the -polynomial of a simplicial complex.
Equivalently, the coefficients of the -polynomial satisfy the Kruskal–Katona inequalities. (See [20, Chapter II.2].) Clearly, Conjecture 3.1 is stronger than Gal’s Conjecture. Moreover, they gave the following problem.
Problem 3.2** ([14, Problem 6.4]).**
The -polynomial of any flag triangulation of a sphere is the -polynomial of a flag simplicial complex.
In this section, we solve this problem for enriched chain polytopes.
Let be an antichain. Then coincides with the Eulerian polynomial of type B. See [17, Proposition 4.15]. In this case, a flag simplicial complex whose -polynomial is the -polynomial of is given in [14, Corollary 4.5 (2)] as follows. A decorated permutation is a permutation with bars colored in four colors , , , and following the left peak positions. Let be the set of all decorated permutations. Given , there exist decorated permutations associated with in . For example, belongs to . Given
[TABLE]
let where is the decreasing part of and the increasing part of . We say that covers if and only if is obtained from by removing a colored bar and reordering the word as a word where . Then is a poset graded by number of bars.
We associate the set with the flag simplicial complex on the vertex set . In , two vertices and with are adjacent if and only if belongs to , where . Then is the collection of all subsets of such that every two distinct vertices in are adjacent. By definition, is a flag simplicial complex. Let be a map defined by
[TABLE]
for , where is the set of letters to the left of in written in increasing order and is the set of letters to the right of in written in increasing order. It was shown [14] that is an isomorphism of graded posets from to . Thus we have the following ([14, Corollary 4.5 (2)]).
Proposition 3.3**.**
Let be an antichain. Then the -polynomial of is the -polynomial of the flag simplicial complex .
Given a poset , let . Then we have the following.
Theorem 3.4**.**
Let be a poset. Then the image is a flag simplicial subcomplex of whose -polynomial is the -polynomial of .
Proof.
First, we show that is a subcomplex of . Let of the form (3) be an element of . If is obtained from by removing a colored bar and reordering the word as a word where , then is obtained from by sorting a consecutive part of . Then , and hence . Thus is a lower ideal in . Since is an isomorphism of graded posets, it follows that is a subcomplex of .
Second, we show that is flag. Let . Since is a lower ideal, if . Let be pairwise adjacent vertices in ordered by increasing position of the bar in . We show that belongs to . If , then it is trivial. Suppose by induction on that
[TABLE]
with . Then is
[TABLE]
where and . Since both and belong to and since and , it follows that belongs to .
From Theorem 0.3, the -polynomial of is
[TABLE]
Since is the number of decorated permutations associated with in , this is equal to the -polynomial of as desired. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] V. Batyrev, Dual polyhedra and mirror symmetry for Calabi-Yau hypersurfaces in toric varieties, J. Algebraic Geom. , 3 (1994), 493–535.
- 2[2] R. Biswal and G. Fourier, Minuscule Schubert Varieties: Poset Polytopes, PBW-Degenerated Demazure Modules, and Kogan Faces, Algebr. Represent. Theory , 18 (2015), 1481–1503.
- 3[3] W. Bruns and T. Römer, h ℎ h -Vectors of Gorenstein polytopes, J. Combin. Theory Ser. A 114 (2007), 65–76.
- 4[4] D. Cox, J. Little and H. Schenck, “Toric varieties”, Amer. Math. Soc., 2011.
- 5[5] E. Ehrhart, “Polynomês Arithmétiques et Méthode des Polyédres en Combinatorie”, Birkhäuser, Boston/Basel/Stuttgart, 1977.
- 6[6] S. R. Gal, Real Root Conjecture fails for five and higher dimensional spheres, Discrete Comput. Geom. , 34 (2005), 269–284.
- 7[7] T. Hibi, Dual polytopes of rational convex polytopes, Combinatorica 12 (1992), 237–240.
- 8[8] T. Hibi and N. Li, Chain polytopes and algebras with straightening laws, Acta Math. Vietnam. 40 (2015), 447–452.
