The $h^*$-polynomials of locally anti-blocking lattice polytopes and their $\gamma$-positivity

A lattice polytope $\mathcal{P} \subset \mathbb{R}^d$ is called a locally anti-blocking polytope if for any closed orthant $\mathbb{R}^d_{\varepsilon}$ in $\mathbb{R}^d$, $\mathcal{P} \cap \mathbb{R}^d_{\varepsilon}$ is unimodularly equivalent to an anti-blocking polytope by reflections of coordinate hyperplanes. In the present paper, we give a formula for the $h^*$-polynomials of locally anti-blocking lattice polytopes. In particular, we discuss the $\gamma$-positivity of the $h^*$-polynomials of locally anti-blocking reflexive polytopes.


INTRODUCTION
A lattice polytope is a convex polytope all of whose vertices have integer coordinates. A lattice polytope P ⊂ R d ≥0 of dimension d is called anti-blocking if for any y = (y 1 , . . . , y d ) ∈ P and x = (x 1 , . . . , x d ) ∈ R d with 0 ≤ x i ≤ y i for all i, it holds that x ∈ P. Anti-blocking polytopes were introduced and studied by Fulkerson [11,12] in the context of combinatorial optimization. See, e.g., [35]. For ε ∈ {−1, 1} d and x ∈ R d , set εx := (ε 1 x 1 , . . . , ε d x d ) ∈ R d . Given an anti-blocking lattice polytope P ⊂ R d ≥0 of dimension d, we define Since P is an anti-blocking lattice polytope, P ± is convex (and a lattice polytope). Moreover, for any ε ∈ {−1, 1} d and x ∈ P ± , we have εx ∈ P ± . The polytope P ± is called an unconditional lattice polytope ( [23]). In general, P ± is symmetric with respect to all coordinate hyperplanes. In particular, the origin 0 of R d is in the interior int(P ± ). Given ε = (ε 1 , . . . , ε d ) ∈ {−1, 1} d , let R d ε denote the closed orthant {(x 1 , . . . , x d ) ∈ R d : x i ε i ≥ 0 for all 1 ≤ i ≤ d}. A lattice polytope P ⊂ R d of dimension d is called locally anti-blocking ( [23]) if, for each ε ∈ {−1, 1} d , there exists an anti-blocking lattice polytope P ε ⊂ R d ≥0 of dimension d such that P ∩ R d ε = P ± ε ∩ R d ε . Unconditional polytopes are locally anti-blocking.
In the present paper, we investigate the h * -polynomials of locally anti-blocking lattice polytopes. First, we give a formula for the h * -polynomials of locally anti-blocking lattice polytopes in terms of that of unconditional lattice polytopes. In fact, Theorem 0.1. Let P ⊂ R d be a locally anti-blocking lattice polytope of dimension d and for each ε ∈ {−1, 1} d , let P ε be an anti-blocking lattice polytope of dimension d such ∑ ε∈{−1,1} d h * (P ± ε , x).
In particular, h * (P, x) is γ-positive if h * (P ± ε , x) is γ-positive for all ε ∈ {−1, 1} d . Second, we discuss the γ-positivity of the h * -polynomials of locally anti-blocking reflexive polytopes. A lattice polytope is called reflexive if the dual polytope is also a lattice polytope. Many authors have studied reflexive polytopes from viewpoints of combinatorics, commutative algebra and algebraic geometry. In [15], Hibi characterized reflexive polytopes in terms of their h * -polynomials. To be more precise, a lattice polytope of dimension d is (unimodularly equivalent to) a reflexive polytope if and only if the h *polynomial is a palindromic polynomial of degree d. On the other hand, in [23], locally anti-blocking reflexive polytopes were characterized. In fact, a locally anti-blocking lattice polytope P ⊂ R d of dimension d is reflexive if and only if for each ε ∈ {−1, 1} d , there exists a perfect graph G ε on [d] := {1, . . ., d} such that P ∩ R d ε = Q ± G ε ∩ R d ε , where Q G ε is the stable set polytope of G ε . Moreover, every locally anti-blocking reflexive polytope possesses a regular unimodular triangulation. This fact and the result of Bruns-Römer [5] imply that its h * -polynomial is unimodal.
In the present paper, we discuss whether the h * -polynomial of a locally anti-blocking reflexive polytope has a stronger property, which is called γ-positivity. In [30], a class of lattice polytopes B G arising from finite simple graphs G on [d], which are called symmetric edge polytopes of type B, was given. Symmetric edge polytopes of type B are unconditional, and they are reflexive if and only if the underlying graphs are bipartite. Moreover, when they are reflexive, the h * -polynomials are always γ-positive. On the other hand, in [31], another family of lattice polytopes C (e) P arising from finite partially ordered sets P on [d], which are called enriched chain polytopes, was given. Enriched chain polytopes are unconditional and reflexive, and their h * -polynomials are always γ-positive. Combining these facts and Theorem 0.1, we know that, for a locally anti-blocking reflexive polytope P, if every P ∩ R d ε is the intersection of R d ε and either an enriched chain polytope or a symmetric edge reflexive polytope of type B, then the h * -polynomial of P is γ-positive (Corollary 3.2). By using this result, we show that the h * -polynomials of several classes of reflexive polytopes are γ-positive.
In Section 4, we will discuss the γ-positivity of the h * -polynomials of symmetric edge polytopes of type A, which are reflexive polytopes arising from finite simple graphs. In [21], it was shown that the h * -polynomials of the symmetric edge polytopes of type A of complete bipartite graphs are γ-positive. We will show that for a large class of finite simple graphs, which includes complete bipartite graphs, the h * -polynomials of the symmetric edge polytopes of type A are γ-positive (Subsection 4.1). Moreover, by giving explicit h * -polynomials of del Pezzo polytopes and pseudo-del Pezzo polytopes, we will show that the h * -polynomial of every pseudo-symmetric simplicial reflexive polytope is γ-positive (Theorem 4.8).
In Section 5, we will discuss the γ-positivity of h * -polynomials of twinned chain polytopes C P,Q ⊂ R d , which are reflexive polytopes arising from two finite partially ordered sets P and Q on [d]. In [39], it was shown that twinned chain polytopes C P,Q are locally anti-blocking and each C P,Q ∩ R d ε is the intersection of R d ε and an enriched chain polytopes. Hence the h * -polynomials of C P,Q are γ-positive. We will give a formula for the h * -polynomials of twinned chain polytopes in terms of the left peak polynomials of finite partially ordered sets (Theorem 5.3). Moreover, we will define enriched (P, Q)-partitions of P and Q, and show that the Ehrhart polynomial of the twined chain polytope C P,Q of P and Q coincides with a counting polynomial of enriched (P, Q)-partitions (Theorem 5.8).
This paper is organized as follows: In Section 1, we will review the theory of Ehrhart polynomials, h * -polynomials, and reflexive polytopes. In Section 2, we will introduce several classes of anti-blocking polytopes and unconditional polytopes. In Section 3, we will investigate the h * -polynomials of locally anti-blocking lattice polytopes. In particular, we will prove Theorem 0.1. We will discuss symmetric edge polytope of type A in Section 4, and twinned chain polytopes in Section 5.
Acknowledgment. The authors are grateful to the anonymous referees for their careful reading and helpful comments. The authors were partially supported by JSPS KAKENHI 18H01134, 19K14505 and 19J00312.

EHRHART THEORY AND REFLEXIVE POLYTOPES
In this section, we review the theory of Ehrhart polynomials, h * -polynomials, and reflexive polytopes. Let P ⊂ R d be a lattice polytope of dimension d. Given a positive integer m, we define L P (m) = |mP ∩ Z d |. Ehrhart [10] proved that L P (m) is a polynomial in m of degree d with the constant term 1. We say that L P (m) is the Ehrhart polynomial of P. The generating function of the lattice point enumerator, i.e., the formal power series is called the Ehrhart series of P. It is well known that it can be expressed as a rational function of the form Then h * (P, x) is a polynomial in x of degree at most d with nonnegative integer coefficients ( [36]) and it is called the h * -polynomial (or the δ -polynomial) of P. Moreover, one has Vol(P) = h * (P, 1), where Vol(P) is the normalized volume of P.
A lattice polytope P ⊂ R d of dimension d is called reflexive if the origin of R d is a unique lattice point belonging to the interior of P and its dual polytope is also a lattice polytope, where x, y is the usual inner product of R d . It is known that reflexive polytopes correspond to Gorenstein toric Fano varieties, and they are related to mirror symmetry (see, e.g., [3,7]). In each dimension there exist only finitely many reflexive polytopes up to unimodular equivalence ( [25]) and all of them are known up to dimension 4 ( [24]). In [15], Hibi characterized reflexive polytopes in terms of their h *polynomials. We recall that a polynomial f ∈ R[x] of degree d is said to be palindromic if . Note that if a lattice polytope of dimension d has interior lattice points, then the degree of its h * -polynomial is equal to d. 15]). Let P ⊂ R d be a lattice polytope of dimension d with 0 ∈ int(P). Then P is reflexive if and only if h * (P, x) is a palindromic polynomial of degree d.
Next, we review properties of polynomials. Let f = ∑ d i=0 a i x i be a polynomial with real coefficients and a d = 0. We now focus on the following properties.
(RR) We say that f is real-rooted if all its roots are real.
We say that f is unimodal if a 0 ≤ a 1 ≤ · · · ≤ a k ≥ · · · ≥ a d for some k. If all its coefficients are nonnegative, then these properties satisfy the implications On the other hand, the polynomial f is γ-positive if f is palindromic and there are γ 0 , γ 1 , .
We can see that a γ-positive polynomial is real-rooted if and only if its γ-polynomial is real-rooted. If f is a palindromic and real-rooted, then it is γ-positive. Moreover, if f is γ-positive, then it is unimodal. See, e.g., [2,34] for details.
For a given lattice polytope, a fundamental problem within the field of Ehrhart theory is to determine if its h * -polynomial is unimodal. One famous instance is given by reflexive polytopes that possess a regular unimodular triangulation. It is known that if a reflexive polytope possesses a flag regular unimodular triangulation all of whose maximal simplices contain the origin, then the h * -polynomial coincides with the h-polynomial of a flag triangulation of a sphere ( [5]). For the h-polynomial of a flag triangulation of a sphere, Gal ([13]) conjectured the following: The h-polynomial of any flag triangulation of a sphere is γ-positive.

CLASSES OF ANTI-BLOCKING POLYTOPES AND UNCONDITIONAL POLYTOPES
In this section, we introduce several classes of anti-blocking polytopes and unconditional polytopes. Throughout this section, we associate each subset such that if F ∈ ∆ and F ′ ⊂ F, then F ′ ∈ ∆. In particular / 0 ∈ ∆ and e / 0 = 0. Let P ∆ denote the convex hull of e F ∈ R d : F ∈ ∆ . The following is an important observation.
. We remark that a stable set is often called an independent set. Let S(G) denote the set of stable sets of G. One has / 0 ∈ S(G) and {i} ∈ S(G) for each Then one has dim Q G = d. Since we can regard S(G) as a simplicial complex on [d], Q G is an anti-blocking polytope.
Locally anti-blocking reflexive polytopes are characterized by stable set polytopes.
for any induced subgraph H of G including G itself, the chromatic number of H is equal to the maximal cardinality of cliques of H. See, e.g., [9] for details on graph theoretical terminologies.
2.3. Chain polytopes and enriched chain polytopes. Let (P, < P ) be a partially ordered set (poset, for short) on is called an antichain of P if all i and j belonging to A with i = j are incomparable in P. In particular, the empty set / 0 and each 1-element subset {i} are antichains of P. Let A (P) denote the set of antichains of P. In [37], Stanley introduced the chain polytope C P of P defined by It is known that chain polytopes are stable set polytopes. Indeed, let G P be the finite simple graph on [d] such that {i, j} ∈ E(G P ) if and only if i < P j or j < P i. We call G P the comparability graph of P. It then follows that A (P) = S(G P ). Hence the chain polytope C P is the stable set polytope Q G P . Therefore, chain polytopes are anti-blocking polytopes. We remark that any comparability graph is perfect.
On the other hand, the enriched chain polytope C (e) P of P is the unconditional lattice polytope defined by C (e) P := C ± P . In [31], it was shown that the Ehrhart polynomial of C (e) P coincides with a counting polynomial of left enriched P-partitions. We assume that P is naturally labeled.
for any x ∈ P, which is called the left enriched order polynomial of P. Given a linear extension π = (π 1 , . . . , π d ) of a finite poset P on [d], a left peak of π is an index 1 ≤ i ≤ d − 1 such that π i−1 < π i > π i+1 , where we set π 0 = 0. Let pk (ℓ) (π) denote the number of left peaks of π. Then the left peak polynomial W (ℓ) where L (P) is the set of linear extensions of P.

Proposition 2.4 ([31]). Let P be a naturally labeled finite poset on
In particular, h * (C (e) P , x) is γ-positive. Note that if Q is a finite poset which is obtained from P by reordering the label, then C Then B G = P ∆ where ∆ is a simplicial complex on [d] obtained by regarding G as a 1-dimensional simplicial complex. The symmetric edge polytope of type B of G is the unconditional lattice polytope defined by . . , e n } is a finite multiset of nonempty subsets of V = {v 1 , . . . , v m }. Elements of V are called vertices and the elements of E are the hyperedges. Then we can associate H to a bipartite graph BipH with a bipartition V ∪ E such that {v i , e j } is an edge of BipH if v i ∈ e j . Assume that BipH is connected. A hypertree in H is a function f : E → {0, 1, . . .} such that there exists a spanning tree Γ of BipH whose vertices have degree f(e) + 1 at each e ∈ E. Then we say that Γ induces f. Let B H denote the set of all hypertrees in H . A hyperedge e j ∈ E is said to be internally active with respect to the hypertree f if it is not possible to decrease 6 f(e j ) by 1 and increase f(e j ′ ) ( j ′ < j) by 1 so that another hypertree results. We call a hyperedge internally inactive with respect to a hypertree if it is not internally active and denote the number of such hyperedges of f by ι(f). Then the interior polynomial of H is the generating function Assume that G is a bipartite graph with a bipartition V 1 ∪ V 2 = [d]. Then let G be a connected bipartite graph on [d + 2] whose edge set is In particular, h * (B G , x) is γ-positive.

h * -POLYNOMIALS OF LOCALLY ANTI-BLOCKING LATTICE POLYTOPES
In the present section, we prove Theorem 0.1, that is, a formula for the h * -polynomials of locally anti-blocking lattice polytopes in terms of that of unconditional lattice polytopes. Given a subset J = { j 1 , . . . , j r } of [d], let π J : R d → R r , π J ((x 1 , . . . , x d )) = (x j 1 , . . ., x j r ) denote the projection map. (Here π / 0 is the zero map.) Proposition 3.1. Let P ⊂ R d ≥0 be an anti-blocking lattice polytope. Then we have Proof. The proof is similar to the discussion in [30, Proof of Proposition 3.1]. The intersection of P ± ∩ R d ε and Hence the Ehrhart polynomial L P ± (m) satisfies the following:

Thus the Ehrhart series satisfies
We now prove Theorem 0.1.
Proof of Theorem 0.1.
Combining Theorem 0.1 and Propositions 2.4 and 2.6, we have the following.
Corollary 3.2. Let P ⊂ R d be a locally anti-blocking reflexive polytope. If every P ∩ R d ε is the intersection of R d ε and either an enriched chain polytope or a symmetric edge reflexive polytope of type B, then the h * -polynomial of P is γ-positive.
Finally, we conjecture the following: Thanks to Theorem 0.1 and Proposition 2.2, in order to prove Conjecture 3.3, it is enough to study unconditional lattice polytopes Q ± G where Q G is the stable set polytope of a perfect graph G.

SYMMETRIC EDGE POLYTOPES OF TYPE A
Let G be a finite simple graph on the vertex set [d] and the edge set E(G). The symmetric edge polytope A G ⊂ R d of type A is the convex hull of the set The polytope A G is introduced in [26,28] and called a "symmetric edge polytope of G." It is known [26, Proposition 4.1] that the dimension of A G is d − 1 if and only if G is connected. Higashitani [20] proved that A G is simple if and only if A G is smooth Fano if and only if G contains no even cycles. It is known [26,28] that A G is unimodularly equivalent to a reflexive polytope having a regular unimodular triangulation. In particular, h * -polynomial of A G is palindromic and unimodal. For a complete bipartite graph K ℓ,m , it is known [21] that the h * -polynomial of A K ℓ,m is real-rooted and hence γ-positive.

4.1.
Recursive formulas for h * -polynomials. In this section, we give several recursive formulas of h * -polynomials of A G when G belongs to certain classes of graphs. By the following fact, we may assume that G is 2-connected if needed.
Proof. Since A G is the free sum of reflexive polytopes A G 1 , . . . , A G s , a desired conclusion follows from [4, Theorem 1].
The suspension G of a graph G is the graph on the vertex set [d + 1] and the edge set We now study the h * -polynomial of A G . Given a subset S ⊂ [d], is called a cut of G.  . Then A G is unimodularly equivalent to a locally anti-blocking reflexive polytope whose h * -polynomial is Then A G is lattice isomorphic to P.
Thus P is a locally anti-blocking polytope and be the polynomial ring over K. We define the ring homomorphism π : S → R by setting π(z) = s, π(x k ) = t i t −1 j s and π(y k ) = t −1 i t j s if e k = {i, j} ∈ E(G) and i < j. The toric ideal I A G of A G is the kernel of π. (See, e.g., [14] for details on toric ideals and Gröbner bases.) We now define the notation given in [21]. For any oriented edge e i , let p i denote the corresponding variable, i.e. p i = x i or p i = y i depending on the orientation and let {p i , q i } = {x i , y i }. Let G (G) be the set of all binomials f satisfying one of the following: (1) where C is an even cycle in G of length 2k with a fixed orientation, and I is a k-subset of C such that e ℓ / ∈ I for ℓ = min{i : e i ∈ C}; (2) where C is an odd cycle in G of length 2k + 1 and I is a (k + 1)-subset of C; ( where 1 ≤ i ≤ n. Then G (G) is a Gröbner basis of I A G with respect to a reverse lexicographic order < induced by the ordering z < x 1 < y 1 < · · · < x n < y n ([21, Proposition 3.8]). Here the initial monomial of each binomial is the first monomial. Using this Gröbner basis, we have the following.  (1) and (3). Since G has no triangles, the procedure (ii) does not occur when we contract e of G. Hence E(G/e) = {e ′ 2 , . . . , e ′ n } where e ′ k is obtained from e k by identifying i with j. Let G ′ be a graph obtained by adding an edge e ′ 1 = {d + 1, d + 2} to the graph G/e. Then G (G ′ ) consists of all binomials f satisfying one of the following: where C is an even cycle in G of length 2k with a fixed orientation and e 1 / ∈ C, and I is a k-subset of C such that e ℓ / ∈ I for ℓ = min{i : e i ∈ C}; (5) where C ∪ {e 1 } is an even cycle in G of length 2k + 2 and I is a (k + 1)-subset of C; Remark. Corollary 4.5 (b) was recently generalized in [8,Theorem 4.17].

4.2.
Pseudo-symmetric simplicial reflexive polytopes. A lattice polytope P ⊂ R d is called pseudo-symmetric if there exists a facet F of P such that −F is also a facet of P. Nill [27] proved that any pseudo-symmetric simplicial reflexive polytope P is a free sum of P 1 , . . . , P s , where each P i is one of the following: • cross polytope; • del Pezzo polytope V 2m = conv(±e 1 , . . ., ±e 2m , ±(e 1 + · · · + e 2m )); • pseudo-del Pezzo polytope V 2m = conv(±e 1 , . . . , ±e 2m , −e 1 − · · · − e 2m ). Note that a del Pezzo polytope is unimodularly equivalent to A C 2m+1 where C 2m+1 is an odd cycle of length 2m + 1 (see [20]). The h * -polynomial of A C d was essentially studied in the following papers (see also the OEIS sequence A204621): • Conway-Sloane [6, p.2379] computed h * (A C d , x) for small d by using results of O'Keeffe [32] and gave a conjecture on the γ-polynomial of h * (A C d , x) (coincides with the γ-polynomial in Proposition 4.7 below). • General formulas for the coefficients of h * (A C d , x) were given by Ohsugi-Shibata [29] and Wang-Yu [40]. In order to give the h * -polynomial of V 2m , we need the following lemma.
where G \ e is the graph obtained by deleting e from G.
Proof. Note that A G\e ⊂ P e ⊂ A G . Since G is connected and e is not a bridge of G, the dimension of each of A G and A G\e is d − 1. Let P ′ e denote the convex hull of A(G) \ {−e i + e j }, which is unimodularly equivalent to P e . Then A G and P e are decomposed into the following disjoint union: Since P e \ A G\e is unimodularly equivalent to P ′ e \ A G\e , we have a desired conclusion.
The h * -polynomials of V 2m and V 2m are as follows: Proposition 4.7. Let C d denote a cycle of length d ≥ 3 and let 1 ≤ m ∈ Z. Then we have In particular, the h * -polynomials of A C d , V 2m and V 2m are γ-positive.
Since V 2m is unimodularly equivalent to A C 2m+1 , we have h * (V 2m , x) = h * (A C 2m+1 , x). By Lemma 4.6, it follows that Thus it turns out that any pseudo-symmetric simplicial reflexive polytope is a free sum of reflexive polytopes whose h * -polynomial are γ-positive. By [4, Theorem 1], we have the following. Proof. From results by Nill [27], any pseudo-symmetric simplicial reflexive polytope is a free sum of cross polytopes, del Pezzo polytopes and pseudo-del Pezzo polytopes. On the other hand, by [4,Theorem 1], the h * -polynomial of a free sum of reflexive polytopes P 1 , . . . , P s is equal to the product of their h * -polynomials of P 1 , . . ., P s . Hence by Example 4.1 and Proposition 4.7, it follows that the h * -polynomial of any pseudo symmetric simplicial reflexive polytope is γ-positive.

4.3.
Classes of graphs such that h * (A G , x) is γ-positive. Using results in the present section, for example, h * (A G , x) is γ-positive if one of the following holds: • G = H for some graph H (e.g., G is a complete graph, a wheel graph); • G = H for some bipartite graph H (e.g., G is a complete bipartite graph); • G is a cycle; • G is an outerplanar bipartite graph.
Moreover, we can compute h * (A G , x) explicitly in some cases. We give examples of such calculations for known formulas (for complete graphs [1], and for complete bipartite graphs [21]).
Let V 1 ∪V 2 be the partition of the vertex set of K m,n , where |V 1 | = m and |V 2 | = n. If the edge set of H ∈ Cut(K m,n ) is E S with S ⊂ [m + n], then H is the disjoint union of two complete bipartite graphs K k,ℓ and K m−k,n−ℓ , and hence where k = |V 1 ∩ S| and ℓ = n − |V 2 ∩ S|. It then follows that Finally, we conjecture the following: Conjecture 4.11. The h * -polynomial of any symmetric edge polytope of type A is γpositive.

TWINNED CHAIN POLYTOPES
In this section, we will apply Theorem 0.1 to twinned chain polytopes. For two lattice polytopes P, Q ⊂ R d , we set Let P and Q be two finite posets on [d]. The twinned chain polytope of P and Q is the lattice polytope defined by C P,Q := Γ(C P , C Q ).
Then C P,Q is reflexive. Moreover, C P,Q has a flag, regular unimodular triangulation all of whose maximal simplices contain the origin ([16, Proposition 1.2]). Hence we obtain the following: Corollary 5.1. Let P and Q be two finite posets on [d]. Then the h * -polynomial of C P,Q coincides with the h-polynomial of a flag triangulation of a sphere.
In [39, Proposition 2.2] it was shown that C P,Q is locally anti-blocking. In general, for two finite posets (P, < P ) and (Q, < Q ) with P ∩ Q = / 0, the ordinal sum of P and Q is the poset (P ⊕ Q, < P⊕Q ) on P ⊕ Q = P ∪ Q such that i < P⊕Q j if and only if (a) i, j ∈ P and i < P j, or (b) i, j ∈ Q and i < Q j, or (c) i ∈ P and j ∈ Q. Given a subset I of [d], we define the induced subposet of P on I to be the finite poset (P I , < P I ) on I such that i < P I j if and only if i < P j.
where I ε = {i ∈ [d] : ε i = 1} and R ε is a naturally labeled poset which is obtained from P I ε ⊕ Q I ε by reordering the label and In particular, h * (C P,Q , x) is γ-positive. Moreover, h * (C P,Q , x) is real-rooted if and only if f P,Q (x) is real-rooted.
On the other hand, it is known that, from h * (C P,Q , x), we obtain the h * -polynomials of several non-locally anti-blocking lattice polytopes arising from the posets P and Q. The order polytope O P ( [37]) of P is the (0, 1)-polytope defined by Given two lattice polytopes P, Q ⊂ R d , we define Furthermore, if P and Q has a common linear extension, then we obtain From these propositions and Theorem 5.3, we obtain the following: In the rest of section, we introduce enriched (P, Q)-partitions and we show that the Ehrhart polynomial of C P,Q coincides with a counting polynomial of enriched (P, Q)partitions. Assume that P and Q are naturally labeled. We say that a map f : Assume that I = {1, . . ., k} and I = {k + 1, . . ., d}. Then we have (x 1 , . . . , x k ) ∈ bC P I and (x k+1 , . . . , x d ) ∈ aC Q I by a result of Stanley [37,Theorem 3.2]. Hence one obtains (x 1 , . . ., x d ) ∈ bC P I ⊕ aC Q I ⊂ mC P,Q , where bC P I ⊕ aC Q I is the free sum of bC P I and aC Q I . Similarly, in general, it follows that (x 1 , . . . , x d ) ∈ mC P,Q . Therefore, the map ϕ : F(m) → mC P,Q ∩ Z d defined by ϕ( f ) = (x 1 , . . . , x d ) for each f ∈ F(m) is well-defined. Take (x 1 , . . . , x d ) ∈ mC P,Q ∩ Z d . We set We define a map f : [d] → Z by f (i) =    max{x j 1 + · · · + x j k : j 1 < P I · · · < P I j k = i} if i ∈ I, − max{|x j 1 | + · · · + |x j k | : j 1 < Q I · · · < Q I j k = i} if i ∈ I.
Finally, we show that ϕ is a bijection. However, this immediately follows by the above and the argument in [37, Proof of Theorem 3.2].
Since C P,Q is reflexive, we obtain the following: