Triangular faces of the order and chain polytope of
a maximal ranked poset
Abstract.
Let and denote the order polytope and chain polytope, respectively, associated with a finite poset . We prove the following result: if is a maximal ranked poset, then the number of triangular -faces of is less than or equal to that of , with equality holding if and only if does not contain an -poset as a subposet.
Key words and phrases:
order polytope, chain polytope, partially ordered set, -vector2020 Mathematics Subject Classification:
52B05, 06A071. Introduction
The order polytope and chain polytope associated with a finite partially ordered set , were introduced by Stanley [7]. These are significant classes of -dimensional polytopes that have been widely studied in the fields of combinatorics and commutative algebra. We are interested in the face structure and the number of faces of and . For an -dimensional polytope, is called the f-vector which denotes the number of -dimensional faces, where . Hibi and Li proposed the following conjecture regarding the -vectors of and :
Conjecture 1.1 ([4, Conjecture 2.4]).
Let be a finite poset with .
Then
(a) for all .
(b) If for some , then and are unimodularly equivalent.
In the same paper [4], it is proven that and are unimodularly equivalent if and only if does not contain an -poset (Figure 1) as a subposet. As supporting evidence for this conjecture, we present the results that have already been shown. It is shown that the number of vertices of is equal to that of in [7], and similarly, the number of edges of is equal to that of in [5]. In this study, it should be noted that Conjecture 1.1 (b) is interpreted as based on the results in [5]. In [4], it is shown that the number of facets of is less than or equal to that of , with equality holding if and only if does not contain an -poset as a subposet. The recent result described below proves Conjecture 1.1 (a) when applied to specific classes of posets. In [1], it is shown that if is a poset called a maximal ranked poset, then holds for all . Furthermore, in [2], it is shown that if is a poset built inductively by taking disjoint and connected unions of posets, then holds for all . The result by [2] encompasses the result by [1]. Building upon the previous studies mentioned above, this paper focuses on the triangular -faces of and . The main theorem of this paper states that if is a maximal ranked poset, then the number of triangular -faces of is less than or equal to that of , with equality holding if and only if does not contain an -poset as a subposet. In other words, when is a maximal ranked poset containing an -poset, the number of triangles in the -skeleton of is strictly greater than that in the -skeleton of . This result contributes to the advancement of the Hibi and Liβs Conjecture.

2. Basics on the faces of order and chain polytope
Let be a finite poset equipped with a partial order . To each subset , we associate , where are the canonical unit coordinate vectors of . In particular is the origin of . A poset ideal of is a subset such that if and , then . An antichain of is a subset such that and belonging to with are incomparable. Note that the empty set is considered both a poset ideal and an antichain of . We say that covers if and for no .
The two polytopes associated with a poset, namely the order polytope
and the chain polytope
were introduced by [7].
We briefly review the properties of these two polytopes as established by [7]. One has . Each vertex of corresponds to , where is a poset ideal of and each vertex of corresponds to , where is an antichain of . Notice that the poset ideals one-to-one correspond to the antichains. It then follows that the number of vertices of is equal to that of . Then the facets of are obtained by the the hyperplane whose defining equation is as follows:
-
β’
, where is maximal;
-
β’
, where is minimal;
-
β’
, where covers ,
the facets of are the following:
-
β’
, for all ;
-
β’
, where is a maximal chain of .
Recall that the comparability graph of is the finite simple graph on the vertex set , where the edges are defined by with , such that and are comparable in . In general, we say that a nonempty subset of is connected in if the induced subgraph of on is connected.
The descriptions of edges and triangular -faces of , as well as those of , respectively, are obtained as follows. Note that denote symmetric difference of and , that is .
Lemma 2.1 ([3, Lemma 4, Lemma 5]).
Let be a finite poset.
-
(a)
Let and be poset ideals of with . Then the is an edge of if and only if and is connected in .
-
(b)
Let and be antichains of with . Then the is an edge of if and only if is connected in .
Lemma 2.2 ([6, Theorem 1, Theorem 2]).
Let be a finite poset.
-
(a)
Let , , and be pairwise distinct poset ideals of . Then the is a 2-face of if and only if and , , are connected in .
-
(b)
Let , , and be pairwise distinct antichains of . Then the is a 2-face of if and only if , and are connected in .
3. The number of triangular -faces
The rank of a poset is the maximal length of a chain in , where the length of a chain is . A poset is graded of rank n if every maximal chain in has the same length . Let denote the set of elements of rank . Namely, if is graded of rank , then it can be written such that every maximal chain has the form , where . If any two elements in distinct rank of a graded poset are comparable, then is called a maximal ranked poset [1]. Given a poset ideal , we denote for the set of maximal element of . Similarly, given an antichain , we denote as the poset ideal of generated by , that is . This establishes a bijection between poset ideal and antichain of .
Let denote the set of pairs , where and are poset ideals of with , and forms an edge of , while does not form an edge of . Let denote the set of pairs , where and are antichains of with , and forms an edge of , while does not form an edge of .
Lemma 3.1.
Let be a maximal ranked poset of rank .
-
(a)
Let and be poset ideals of with . Then if and only if , is connected in , and .
-
(b)
Let and be antichains of with . Then if and only if there exists some such that , , and , where .
Proof.
(a)
(βIfβ)
From Lemma 2.1(a), if and is connected, then forms an edge of .
Since , is disconnected.
Thus, by Lemma 2.1(b), does not form an edge of .
(βOnly ifβ)
According to Lemma 2.1, if and only if , is connected, and is disconnected in .
If is disconnected, then either and , or are subsets of , where , since is a maximal ranked poset.
If , then
,
since , namely .
Since is connected and is disconnected, this leads to a contradiction.
Hence, we have and , as desired.
(b)
(βIfβ)
If there exists some such that , , and , where , then is connected.
Then, from Lemma 2.1(b), forms an edge of .
Furthermore, and is disconnected, because and .
Hence, by Lemma 2.1(a), does not form an edge of .
(βOnly ifβ)
According to Lemma 2.1, if and only if the following conditions hold:
-
β’
is connected in ;
-
β’
and or and is disconnected in .
If and , then there exists some such that and and , where , because is a maximal ranked poset. This contradicts is connected. Thus, assuming and is disconnected, there exists some such that and . In this case, either or holds, but contradicts is connected. Hence, there exists some such that and , where . β
Definition 3.2.
Let be a finite poset. Let , , and be pairwise distinct poset ideals of , and let , , and be pairwise distinct antichains of . We define the sets of triples corresponding to triangular -faces of and as follows:
The first claim we wish to present is that the number of triangular -faces of is less than or equal to that of , namely . This assertion is guided by the following two lemmas.
Lemma 3.3.
Let be a finite poset. Then the number of triples in equals that in .
Proof.
From Lemma 2.2, the set of triples where , corresponds to the set of triangles in the graph obtained by removing the all edges , where from the -skeleton of . Similarly, the set of triples where , corresponds to the set of triangles in the graph obtained by removing the all edges , where from the -skeleton of . Since these graphs are clearly isomorphic, the number of triangles in them coincides. β
Lemma 3.4.
Let be a maximal ranked poset. Then the number of triples in is less than or equal to that in .
Proof.
From Lemma 2.2(a) and Lemma 3.1(a), the following conditions hold for , where , , and be pairwise distinct poset ideals of :
-
β’
, and , , and are connected in ;
-
β’
or .
Let has rank . Since is a maximal ranked poset, we may assume that and , where . We define the map by
We will show that the map is an injection.
Case 1.
Since is connected, we may assume that .
Now, , and are pairwise distinct antichains of .
As is a maximal ranked poset, and are connected.
If , then is connected.
If , then because , namely .
Since is connected, is also connected.
Furthermore, since , from Lemma 3.1(b), we have , implying .
Case 2. and .
Now, .
Since is a maximal ranked poset and , .
Thus , and are pairwise distinct antichains of and and are connected.
If , then are connected.
If , then we can show is connected by the same argument in Case 1.
Furthermore, since , from Lemma 3.1(b), we have , implying .
Case 3. and .
Now, .
Since is a maximal ranked poset and , .
Thus , and are pairwise distinct antichains of and and are connected.
Since , then .
Hence, is connected because .
Furthermore, since , from Lemma 3.1(b), we have , implying .
In Case 1 or Case 2, the map is clearly injective. In Case 3, let and belong to . We note the following holds:
-
β’
and , where ;
-
β’
and .
Suppose that , , and . Then . Since , . Thus . Now, we have and by . Since , it follows that , namely , as desired. β
Corollary 3.5.
Let be a maximal ranked poset. Then the number of triangular -faces of is less than or equal to that of .
Furthermore, we can characterize whether the number of triangular -faces of is equal to that of , namely , by the -poset from Figure 1.
Theorem 3.6.
Let be a maximal ranked poset. Then the number of triangular -faces of is equal to that of if and only if the poset does not contain an -poset as a subposet.
Proof.
(βIfβ)
The poset does not contain an -poset from as a subposet if and only if and are unimodularly equivalent by [4, Theorem 2.1].
Thus, the -skeleton of and that of are isomorphic as finite graphs.
In particlar, the number of triagles in those -skeletons coincides.
Therefore .
(βOnly ifβ)
Let has rank .
Suppose that the poset contains an -poset from as a subposet.
Let the -poset be , where each element is pairwise distinct such that (i) and are incomparable, (ii) and are incomparable, and (iii) , .
We may assume that , and , where and .
Now, , , and are pairwise distinct antichains.
As is a maximal ranked poset, , , and are connected in .
Since , from Lemma 3.1(b), , implying .
We will show that there does not exist any such that , where is the injection obtained in the proof of Lemma 3.4.
Case 1. Suppose that there exists some such that and coincides . Since , then . We may assume that , , and . Then and . However, since is disconnected, this contradicts is connected, because .
Case 2. Suppose that there exists some such that , , and coincides . Since and , then . We may assume that , , and . However, Since , this contradicts .
Case 3. Suppose that there exists some such that , , and coincides . Since and , then . We may assume that , , and . Then and . However, Since , this contradicts .
By the above arguments, the map turns out to be not surjective. Consequently, it follows that . From Lemma 3.3, we establish , as desired. β
In the following statement, we set the -poset to be , where , , and , with and , following the same notation as in the proof of Theorem 3.6.
Corollary 3.7.
Let be a maximal ranked poset of rank which contains an -poset as a subposet. The number of triangular -faces of is equal to that of plus
Proof.
Let and . Then , and there does not exist any such that , by the same argument as in the proof of Theorem 3.6. Fixing , there are ways to choose and ways to choose . Therefore,
β
Acknowledgement
The author would like to thank Takayuki Hibi for numerous helpful discussion.
References
- [1] I. Ahmad, G. Fourier, and M. Joswig, Order and chain polytopes of maximal ranked posets, arXiv : 2309.01626.
- [2] R. Freij-Hollanti and T. LundstrΓΆm, -vector Inequalities for Order and Chain Polytopes, arXiv : 2312.13890.
- [3] T. Hibi, N. Li, Cutting convex polytopes by hyperplanes, Mathematics 7 (2019), #381.
- [4] T. Hibi, N. Li, Unimodular equivalence of order and chain polytopes, Math. Scand. 118 (2016), 5β12.
- [5] T. Hibi, N. Li, Y. Sahara, A. Shikama, The numbers of edges of the order polytope and the chain polytope of a finite partially ordered set, Discrete Math. 340 (2017), 991β994.
- [6] A. Mori, Faces of 2-dimensional simplex of order and chain polytopes, Mathematics 7 (2019), #851.
- [7] R. Stanley, Two poset polytopes, Discrete Comput. Geom. 1 (1986), 9β23.