Hypersimplicial subdivisions
Jorge Alberto Olarte, Francisco Santos

TL;DR
This paper investigates the structure of subdivisions induced by linear projections of hypersimplices, revealing connections to secondary polytopes, answering a classical question positively in specific cases, and identifying non-lifting subdivisions in cyclic polytopes.
Contribution
It characterizes fiber polytopes for hypersimplices, confirms a homotopy equivalence for polygons, and finds non-lifting subdivisions for cyclic polytopes, advancing understanding of hypersimplicial subdivisions.
Findings
Fiber polytope is a Minkowski sum of secondary polytopes.
Homotopy equivalence holds for polygons.
Existence of non-lifting subdivisions in cyclic polytopes.
Abstract
Let be any linear projection, let be the image of the standard basis. Motivated by Postnikov's study of postitive Grassmannians via plabic graphs and Galashin's connection of plabic graphs to slices of zonotopal tilings of 3-dimensional cyclic zonotopes, we study the poset of subdivisions induced by the restriction of to the -th hypersimplex, for . We show that: - For arbitrary and for , the corresponding fiber polytope is normally isomorphic to the Minkowski sum of the secondary polytopes of all subsets of of size . - When is the vertex set of an -gon, we answer the Baues question in the positive: the inclusion of the poset of -coherent subdivisions into the poset of all -induced subdivisions is a homotopy equivalence. - When…
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.
Hypersimplicial subdivisions
Jorge Alberto Olarte and Francisco Santos
Institut für Mathematik, Freie Universität Berlin, Germany
Dept. of Mathematics, Statistics and Comp. Sci., Univ. of Cantabria, Spain
Abstract.
Let be any linear projection, let be the image of the standard basis. Motivated by Postnikov’s study of postitive Grassmannians via plabic graphs and Galashin’s connection of plabic graphs to slices of zonotopal tilings of 3-dimensional cyclic zonotopes, we study the poset of subdivisions induced by the restriction of to the -th hypersimplex, for . We show that:
- •
For arbitrary and for , the corresponding fiber polytope is normally isomorphic to the Minkowski sum of the secondary polytopes of all subsets of of size .
- •
When is the vertex set of an -gon, we answer the Baues question in the positive: the inclusion of the poset of -coherent subdivisions into the poset of all -induced subdivisions is a homotopy equivalence.
- •
When is the vertex set of a cyclic -polytope with odd and any , there are non-lifting (and even more so, non-separated) -induced subdivisions for .
The authors were supported by the Einstein Foundation Berlin under grant EVF-2015-230. Work of F. Santos is also supported by project MTM2017-83750-P of the Spanish Ministry of Science (AEI/FEDER, UE)
Contents
- 1 Introduction
- 2 Preliminaries and notation
- 3 Normal fans of hypersecondary polytopes
- 4 Separation and lifting subdivisions
- 5 Non-separated subdivisions
- 6 Baues posets for
- 7 Hypercatalan numbers
1. Introduction
The main object of study in this paper are hypersimplicial subdivisions, defined as follows. Let be a set of points affinely spanning . Let be the standard -dimensional simplex in . Consider the linear projection sending the vertices of to the points in . (We implicitly consider the points in labelled by , so that sends to the point labelled by ). Let be the standard hypersimplex and the image of the vertices of under (so that points in are labelled by -subsets of ). A hypersimplicial subdivision of is a polyhedral subdivision of such that every face of the subdivision is the image of a face of under . Put differently, we call hypersimplicial subdivisions the -induced subdivisions of the projection , as introduced in [BS92, BKS94] (see also [Rei99, DLRS10]). See more details in Section 2.
One reason to study such subdivisions comes from the case where are the vertices of a convex polygon. Galashin [Gal18] shows that in this case fine hypersimplicial subdivisions, which we call hypertriangulations, are in bijection with maximal collections of chord-separated -sets. These, in turn, correspond to reduced plabic graphs, [OPS15] which are a fundamental tool in the study of the positive Grassmannian [Pos06, Pos19].
More generally, it is of interest the case where are the vertices of a cyclic polytope . (The -gon is the case ). In [Pos19, Problem 10.3] Postnikov asks the generalized Baues problem for this scenario; that is, he asks whether the poset of hypersimplicial subdivisions of has the homotopy type of a -sphere. For this was shown to have a positive answer by Rambau and Santos [RS00]. For , Balitskiy and Wellman show the poset to be simply connected and again ask the Baues question for it ([BW19, Theorem 6.4 and Question 6.1]). We here give the answer to this:
Theorem 1.1**.**
Let be the vertices of any convex -gon. The poset of hypersimplicial subdivisions retracts onto the poset of coherent hypersimplicial subdivisions. In particular, it has the homotopy type of an -sphere.
[Pos19, Problem 10.3] also asks for which values of the parameters can all hypersimplicial subdivisions of be lifted to zonotopal tilings of the cyclic zonotope. This was already known to be false for [Pos19, Example 10.4] and we generalize the counterexamples to every odd dimension:
Theorem 1.2**.**
Consider the cyclic polytope for odd and . Then, for every there exist hypersimplicial subdivisions of that do not extend to zonotopal tilings of the cyclic zonotope .
In contrast, Galashin [Gal18] showed that the answer to Postnikov’s question is positive in dimension two for hypertriangulations, a result that was generalized to all hypersimplicial subdivisions by Balitskiy and Wellman [BW19, Lemma 6.3].
The poset of coherent hypersimplicial subdivisions of any is isomorphic to the face poset of a polytope, a particular case of a fiber polytope. When this is just the secondary polytope of , so for we call it the -th hypersecondary polytope of . We study hypersecondary polytopes for any and . Specifically, we show that these polytopes are normally equivalent to the Minkowski sum of certain faces of the secondary polytope of . By symmetry, an analogue statement holds for .
Theorem 1.3**.**
Let be a configuration of size and . Let . The hypersecondary polytope is normally equivalent to the Minkowski sum of the secondary polytopes of all subsets of of size .
The paper is organized as follows: Section 2 introduces notation and basic background on induced subdivisions in general, and hypersimplicial subdivisions in particular. In Section 3 we look at coherent hypersimplicial subdivisions and hypersecondary polytopes as Minkowski sums and prove Theorem 1.3, among other results. In Section 4 we study the connection of hypersimplicial subdivisions with zonotopal tilings. In particular, we extend to tiles of positive dimension the concept of -separated sets introduced in [GP17]. With this machinery we show that if all hypertriangulations of are separated then all hypersubdivisions are separated too (Corollary 4.11). In Section 5 and Section 6 we prove Theorem 1.2 and Theorem 1.1 respectively. Finally, we briefly discuss the enumeration of hypersimplicial subdivisions of in Section 7.
Acknowledgements
We thank Alexander Postnikov for inspiring us to work on this and Alexey Balitskiy, Pavel Galashin and Julian Wellman for comments on a first version of this paper.
2. Preliminaries and notation
2.1. Fiber polytopes
We here briefly recall the main concepts and results on fiber polytopes. See [BS92] or [Rei99] for more details.
Let be a linear projection map. Let be a polytope and let ). A -induced subdivision of is a polyhedral subdivision (in the sense of, for example, [DLRS10]), such that every face of is the image under of a face of .
Given a vector the face of selected by is the convex hull of all vertices of which minimize . A -coherent subdivison is a -induced subdivision in which the faces of are chosen “coherently” via a vector . More precisely, we define the -coherent subdivision of given by to be
[TABLE]
The fiber fan of the projection is the stratification of according to what -coherent subdivision is produced. It is a polyhedral fan with linearity space equal to
[TABLE]
As we will see below, it is the normal fan of a certain polytope of dimension .
To define , we look at fine -induced subdivisions. A -induced subdivision is fine if for each of the faces whose images are cells in Put differently, a fine -induced subdivision is the image of a subcomplex of that is a section of . To each fine -induced subdivision we associate the following point:
[TABLE]
where denotes the centroid of .
Definition 2.1**.**
The fiber polytope of the projection is the convex hull of the vectors for all fine -induced subdivisions. We denote it .
The main property of the fiber polytope is the following result of Billera and Sturmfels. In fact, for the purposes of this paper this theorem can be taken as a definition of the fiber polytope, since our results are mostly not about the polytope but about its normal fan (see, eg Section 3).
Theorem 2.2** (Billera and Sturmfels [BS92]).**
* is a polytope of dimension whose normal fan equals the fiber fan.*
In particular, the face lattice of is isomorphic to the poset of -coherent subdivisions ordered by refinement. For example, vertices of correspond bijectively to fine -coherent subdivisions.
Two cases of this construction are of particular importance. Let be a configuration of points. Then:
- (1)
If we let be the affine map bijecting vertices of to , then all the polyhedral subdivisions of are -induced, and the coherent ones are usually called regular subdivisions of . The corresponding fiber polytope is the secondary polytope of and we denote it (in the next sections we define for other values of ). 2. (2)
Let
[TABLE]
be the zonotope generated by the vector configuration . The in the previous case extends to a linear map still sending . Then the -induced subdivisions are precisely the zonotopal tilings of . The corresponding fiber polytope is the fiber zonotope of (or of and we denote it .
2.2. The Baues problem
The poset of all -induced subdivisions (excluding the trivial subdivision for technical reasons) is called the Baues poset of the projection and we denote it . The subposet of -coherent subdivisions is denoted . The Baues problem is, loosely speaking, the question of how similar are and , formalized as follows:
To every poset one can associate a simplicial complex called the order complex of by using the elements of as elements and chains in the poset as simplices. In particular, one can speak of the homotopy type of meaning that of its order complex. Similarly, an order preserving map of posets
[TABLE]
induces a simplicial map between the corresponding order complexes, and one can speak of the homotopy type of .
The prototypical example is the following: if is the face poset of a polyhedral complex , then the order complex of is (isomorphic to) the barycentric subdivision of . In particular, since is the face poset of the polytope , it is homotopy equivalent (in fact, homeomorphic) to a sphere of dimension .
Question 2.3** (Baues Problem).**
Under what conditions is the inclusion a homotopy equivalence?
See [Rei99] for a (not-so-recent) survey about this question, and [San06, Liu17] for examples where the answer is no and having a simplex and a cube, respectively.
2.3. Cyclic polytopes
Cyclic polytopes are a family of polytopes of particular interest for this manuscript and are defined as follows. The trigonometric moment curve (also known as the Carathéodory curve), is parametrized by
[TABLE]
Let be cyclically equidistant numbers in , for example, . The cyclic polytope is the convex hull of .
The combinatorics of the cyclic polytope can be nicely described in terms of the circuits of the corresponding oriented matroid. Namely, all circuits are of the form such that and their opposites (giving the label to the vertex ).
Cyclic polytopes can also be defined by using the polynomial moment curve instead of the trigonometric moment curve and the combinatorial type remains the same. However, the coherence of subdivisions and hence fiber polytopes depend also on the embedding (see Example 3.12). When using the trigonometric moment curve in even dimension the cyclic polytope has more symmetry. That is, it is invariant under the cyclic group action on the vertices. When the cyclic polytope is a is a regular polygon and we abbreviate it by .
The Baues problem is known to have positive answer for cyclic polytopes in the following two cases:
Theorem 2.4** ([RS00, SZ93]).**
Let . Then, the following two cases of the Baues question have a positive answer:
- •
When and is the cyclic polytope of dimension with vertices **[RS00]**.
- •
When and is the cyclic zonotope of dimension with generators **[SZ93]**.
2.4. Hypersecondary polytopes.
Let be a point configuration. For each we consider the following -th deleted (Minkowski) sum of with itself, which we denote :
[TABLE]
The -th deleted sum of the standard -simplex equals the -th hypersimplex of dimension :
[TABLE]
(Observe that the notation here is an abbreviation of .
As mentioned above, the projection that sends the vertices of to extends to a linear map that sends the unit cube to the zonotope . In turn, this linear map restricts to an affine map sending each to . We use the same letter for all these projections.
Definition 2.5**.**
The -induced subdivisions of the projection are called hypersimplicial subdivisions of level of , or just hypersimplicial subdivisions of . Fine hypersimplicial subdivisions are called hypertriangulations. We denote and the corresponding Baues poset and fiber polytope, and call the latter the -th hypersecondary polytope of . We denote for the coherent subdivisions in .
Remark 2.6**.**
The Baues poset only depends on the oriented matroid of while does depend on the embedding of the oriented matroid.
2.5. Lifting subdivisions
By construction, the intersection of any zonotopal tiling of with the hyperplane is a hypersimplicial subdivision of . But the converse is in general not true. Not every hypersimplicial subdivision of “extends” to a zonotopal tiling of . Following [BLVS*+*99, Pos19, San02] the ones that extend are called lifting hypersimplicial subdivisions. The following are examples of them:
- •
For a cyclic polytope , all triangulations in the standard sense (that is, all hypertriangulations of ) are lifting [RS00]. The same is not known for non-simplicial subdivisions.
- •
For arbitrary and a convex -gon , all hypertriangulations of are lifting [Gal18]. The same result for all hypersimplicial subdivisions has recently been provedin [BW19].
Non-lifting triangulations of are not known in dimension two but easy to construct in dimension three or higher. For example, if a subdivision of has the property that its restriction to some subset of cannot be extended to a subdivision of , then is non-lifting. Such subdivisions (and triangulations) exist when is the vertex set of a triangular prism together with any point in the interior of it, the vertex set of a -cube, or the vertex set of , among other cases (see, e.g., [San02, Chapter 5], or [DLRS10, Proof (10) in Sect. 7.1.2, ]).
To better understand lifting subdivisions, let us look at zonotopal tilings of . We denote , and for the poset of zonotopal tilings, its subposet of coherent tilings and the secondary zonotope of respectively. We call any subset of a point, since it represents an element of the point configuration . A tile is a poset interval of the boolean poset , where . To be precise, . Geometrically, we think of as the zonotope , but we prefer the combinatorial notation where the tile is described as the set of vertices of of which it is the projection.
Every tile is a cell in a coherent zonotopal tiling of , by letting be , [math] or depending on whether is in , , or none of them. Indeed, this gives value at least to every point in , with equality if and only if the point belongs to .
Turning our attention to hypersimplices, observe that every face of the hypersimplex is the intersection of a face of with the hyperplane . Therefore we can denote the projection under of any face of by
[TABLE]
By definition, a subdivision of is hypersimiplicial if and only if all of its cells are of the form . A hypersimplicial subdivision is fine if for every cell we have that is an affine basis in . This spells out the following relation with zonotopal tilings:
Proposition 2.7**.**
For every configuration of points and every :
- (1)
Intersection of zonotopal tilings with the hyperplane at level induces an order-preserving map
[TABLE] 2. (2)
The normal fan of refines the normal fan of .
Proof.
For the first claim, notice that the intersection of a zonotopal tiling with the hyperplane gives the subdivision
[TABLE]
of , which clearly is hypersimplicial. We denote as for simplicity. The second claim follows from the fact that for every . ∎
We say that a tile covers level , if . In other words, covers level if is of positive dimension.
Example 2.8**.**
Consider the regular hexagon . Figure 1 shows a hypersimplicial subdivision of whose set of facets are the triangles , , , , , , , , and . The colour of the triangle is dark gray if and white if , which agrees with the colouring of vertices of the corresponding plabic graph (see [Gal18]).
This subdivision is not coherent. To see this, suppose there is a lifting vector whose regular subdivision is this. Then notice that the presence of the edge implies , the presence of the edge implies and the presence of the edge implies , together forming a contradiction. This contrasts the fact that every subdivision of a convex polygon is regular.
2.6. Lifting subdivisions via Gale transforms. The Bohne-Dress Theorem
As a general reference for the contents of this section we recommend the book [DLRS10], more specifically Chapters 4, 5 and 9.
A Gale transform of a point configuration is a vector configuration with the property that a vector is the coefficient vector of an affine dependence in if and only if it is the vector of values of a linear functional on . The definition implicitly assumes a bijection between and given by the labels .
Gale duality is an involution: the Gale duals of a Gale dual of are linearly isomorphic to when considering as a vector configuration via homogenization, by which we mean looking at affine geometry on the points as linear algebra on the vectors . In fact, if and are Gale duals to one another then their oriented matroids are dual, which implies that their ranks add up to . In our setting where has affine dimension and hence rank , its Gale duals have rank .
The normal fan of the secondary polytope of lives naturally in the ambient space of : it equals the common refinement of all the complete fans with rays taken from . Put differently, vectors are in natural bijection to lifting functions (where the latter, which forms a linear space isomorphic to , is considered modulo the linear subspace of affine functions restricted to ). Under this identification, and define the same coherent subdivision of if and only if they lie in exactly the same family of cones among the finitely many cones spanned by subsets of . The precise combinatorial rule to construct the coherent subdivision of induced by a is: a subset is a cell in if and only if lies in the relative interior of .
This rule can be made purely combinatorial as follows. Instead of starting with a vector , let be the oriented matroid of and let be a single-element extension of . That is, is an oriented matroid of the same rank as on the ground set and such that restricted to equals . Any vector induces such an extension, but the definition is more general since needs not be realizable, or it may be realizable but not extend the given realization of . Yet, any such extension allows to define a subdivision of as follows.
Proposition 2.9**.**
With the notation above, the following rules define, respectively, a polyhedral subdivision of and a zonotopal tiling of :
- (1)
A subset is a cell in if and only if is a vector in the oriented matroid . 2. (2)
An interval is a tile in if and only if is a vector in the oriented matroid .
By construction, is the slice at height of . In fact:
Theorem 2.10** (Bohne-Dress Theorem).**
The construction of Proposition 2.9(2) is a bijection (and a poset isomorphism, with the weak map order on extensions of ) between one-element extensions of and zonotopal tilings of . In particular, lifting subdivisions of are precisely the ones that can be obtained by the construction in Proposition 2.9(1).
3. Normal fans of hypersecondary polytopes
The goal of this section is to study hypersecondary polytopes, and the relations between them and the secondary zonotope. Most of such relations say that the normal fan of one of the polytopes refines that of another one. We introduce the following definition to this effect:
Definition 3.1**.**
Let be two polytopes. We say that is a Minkowski summand of , and write , if any of the following equivalent conditions holds:
- (1)
The normal fan of refines that of . 2. (2)
is combinatorially isomorphic to .
If and are Minkowski summands of one another then they are normally equivalent and we write .
Remark 3.2**.**
The equivalence of these two conditions follows from the fact that the normal fan of is the common refinement of the normal fans of and . It can be shown is also equivalent to the existence of a polytope and an such that , hence the name “Minkowski summand”.
Throughout this section we will assume that is a point configuration that spans affinely . As a first example, it follows from Proposition 2.7 that:
Proposition 3.3**.**
For every configuration of size :
- (1)
. 2. (2)
Let be a sequence of integers with for all . Then,
[TABLE]
In particular:
Corollary 3.4**.**
For every configuration of size ,
- (1)
If then
[TABLE] 2. (2)
If then
[TABLE]
Lemma 3.5**.**
Let be coherent zonotopal subdivision of and let be a spanning subset. Then there is at most one , such that .
Proof.
Let such that . Since is of maximal dimension, there is at most one such that and for every . If such exists then the only tile of the form that is in is the one where . If no such exists then there is no tile of that form in the subdivision. ∎
In the following result and in the rest of this section we denote by the subset of labelled by , for any .
Lemma 3.6**.**
Fix and a lifting vector , for a point configuration of size . For each tile such that a basis of , the following are equivalent:
- (1)
* is a cell in .* 2. (2)
There is an such that is a cell in but not in . 3. (3)
For every , is a cell in but not in .
If, moreover, , then they are also equivalent to:
- (4)
There are such that is a cell in for . 2. (5)
For every , is a cell in .
Proof.
The implication (3)(2) is obvious.
To show that (2)(1), consider an such that the cell is a cell in . Then by Proposition 2.7, is a cell of . Therefore either or but not both by Lemma 3.5. In other words, either or but not both. Since we assumed , we are done.
To see that (1)(3), notice that if then . So for all we have that the tile is a cell of and in particular . But as then by Lemma 3.5 can not be a cell of , so can not be a cell of .
Now assume that . It is clear that (3)(5)(4). To see that (4)(2) notice that it if holds for , then the two zonotopes and are in , which can not happen by Lemma 3.5. ∎
Proposition 3.7**.**
For every configuration of size and every we have that is a Minkowski summand of
[TABLE]
Proof.
Saying that is a Minkowski summand of is equivalent to saying that if, for a given we know the subdivisions that induces in and in for every then we also know the subdivision induced in . For a cell with , Lemma 3.6 says that its presence in is determined by its presence in and . Cells with are in if and only if . ∎
The converse is only true for small :
Proposition 3.8**.**
For every configuration of size and every we have that
[TABLE]
Proof.
One direction is Proposition 3.7. For the other direction we have that by Lemma 3.6 then determines for all . Any maximal cell in must satisfy , in particular , so is also a cell in . This implies that determines . ∎
Proposition 3.9**.**
For every configuration of size and every we have that
[TABLE]
Proof.
We need to prove that for every , knowing for every determines . It is enough to prove it for a generic , so we can assume the subdivisions are fine. Let be a tile such that is an affine basis. We claim that if and only if for every .
There is exactly one that agrees with in and such that for every . We have that if and only if for every and for every . Notice that as , . Let . As and , then for so is a full dimensional cell in the level . So it is in if and only if for every for all and for every . As , we can do this for two different elements in so we can verify the sign of for every . ∎
A consequence of this is that Proposition 3.8 can be strengthened as follows:
Proposition 3.10**.**
For every configuration of size and every we have that
[TABLE]
Notice that if then the fiber polytopes are just points and if they are just segments and in particular . Now we are ready to prove the main result of this section:
Theorem 3.11**.**
Let be a configuration of size and . Let . Then
[TABLE]
Proof.
We prove this by iterating Proposition 3.10 several times. At each iteration, for , we replace each by if or by if . The iteration stops at level 1 with the desired result (notice that Minkowski sum is idempotent with respect to normal equivalence). ∎
Example 3.12**.**
Consider the regular hexagon . The secondary polytope is the 3-dimensional associahedron, as seen in Figure 2. Its border consists of 6 pentagons and 3 squares. By Theorem 3.11, the hypersecondary polytope is normally equivalent to the Minkowski sum of those 6 pentagons, see Figure 3. It has 66 vertices and the facets consist of 27 quadrilaterals (18 rectangles, 6 rhombi and 3 squares), 6 pentagons, 2 hexagons and 6 decagons. The short edges correspond to flips which do not change the set of vertices of the triangulation and the long edges correspond to those flips that do change the set of vertices.
The GKZ vector corresponding to the triangulation from Example 2.8 is in the center of one of the hexagons. There are 4 non-coherent hypertriangulations of , which come in pairs with the same GKZ-vector, each in the center of one of the two hexagons. If instead of a regular hexagon we had a hexagon where the three long diagonals do not intersect in the same point, two of those subdivisions would become coherent and the hypersecondary polytope would have instead of each hexagon a triple of rhombi around the new vertex.
The order complex of the Baues poset is the (barycentric subdivision of the border of the) hyperassociahedron where the hexagons are replaced by cubes. In particular it satisfies the Baues problem, that is, retracts onto . We will generalize this in Section 6.
4. Separation and lifting subdivisions
Throughout this section let be a point configuration labelled by , and let be the zonotope generated by the vector configuration . Recall that a point in is a subset and a tile is an interval , where .
Following [GP17], we say that two points are separated with respect to or -separated for short if there is an affine functional positive on and negative on . Equivalently, if there is no oriented circuit in with and . Their motivation is that the notions of strongly separated and chord separated that were introduced in [LZ98] and [Gal18, OPS15] are equivalent to “-separated” and “-separated” respectively ([GP17, Lemmas 3.7 and 3.10]).111Observe that [OPS15] uses the expression “weakly separated” for “chord separated”, but “weakly separated” had a different meaning in [LZ98] One of their main results is as follows (their statement is a bit more general, since it is stated for arbitrary oriented matroids, rather then “point configurations”):
Theorem 4.1** ([GP17, Theorems 2.7 and 7.2]).**
Let be a point configuration and let be the number of affinely independent subsets of . Then:
- (1)
No family of -separated points in has size larger than . 2. (2)
The map sending each zonotopal tiling to its set of vertices gives a bijection
[TABLE]
We here extend their definition to separation of tiles. In the rest of the paper we omit and write “separated” instead of -separated:
Definition 4.2**.**
Let and be two tiles. We say they are separated if there is no circuit such that , and .
The following diagram illustrates the circuits forbidden by the first two conditions in this definition. The third condition forbids circuits with support fully contained in the middle cell:
[TABLE]
By the orthogonality between circuits and covectors in an oriented matroid [BLVS*+*99, Proposition 3.7.12], and the fact that covectors of a realized oriented matroid are the sign vectors of affine functionals this definition is equivalent to:
Proposition 4.3**.**
Two tiles and are separated if there is a covector (that is, an affine functional) that is positive on , negative on , and zero on .
The following diagram illustrates the sign-patterns of covectors witnessing that two tiles are separated:
[TABLE]
Proof.
Consider the subset of , and let be the restriction of to . Remember that the circuits of are the circuits of with support contained in , while the covectors of are the covectors of (all of them) restricted to . In particular, the characterization of covectors of as the sign vectors orthogonal to all circuits says that
[TABLE]
is a covector in if and only if a circuit as in the definition of separation does not exist. ∎
Example 4.4**.**
Two “singleton tiles” (that is, and ) are separated as tiles if and only if they are separated as points in the sense of Galashin and Postnikov. Two tiles containing the origin, that is with , are separated if and only if and intersect properly in the usual sense, as cells in . Finally, the whole zonotope is separated from a tile if and only if the cells and intersect properly; this is equivalent to being a face of the zonotope .
The following result clarifies the relation between separation of points and tiles. In it, we say that a tile is fine if is an independent set. Fine tiles are the ones that can be used in fine zonotopal tilings of .
Proposition 4.5**.**
Let and be two tiles. If every point is separated from every point , then and are separated. The converse holds if the tiles are fine.
Proof.
For the first direction, by induction on , we can assume that is not a singleton and that every tile properly contained in it is separated from . In particular, taking any element we have that both and are separated from . By Proposition 4.3, that implies the following two covectors:
[TABLE]
If or then the first or the second covector, respectively, show that and are separated. If then elimination of in these two covectors gives a covector with values
[TABLE]
which again shows that and are separated.
For the converse, suppose first that and are separated and let be the covector showing it. Let and be points in them. Since the set is independent and is contained in the zero-set of , no matter what signs we prescribe for its elements there is a covector that agrees with where is not zero and has the prescribed signs on . This implies the points and are separated. ∎
Theorem 4.6**.**
Let and be two tiles. Then, the following conditions are equivalent:
- (1)
The tiles are separated. 2. (2)
There is a zonotopal tiling of using both. 3. (3)
There is a coherent zonotopal tiling of using both. 4. (4)
There is a polyhedral subdivision of using and as cells. 5. (5)
There is a coherent polyhedral subdivision of using and as cells.
Proof.
Throughout the proof, let and denote the corresponding generator of .
- •
. Suppose the tiles are separated. By Proposition 4.3 this implies there is a linear functional such that takes the following values on the generators of :
[TABLE]
Let be defined as follows on each :
[TABLE]
where is a very large positive number. Since is negative in , positive in , and zero in , the tile selected by in the subdivision is . Similarly, the vector defined by has the following values
[TABLE]
which shows that is also in , since the difference between and is a linear function.
- •
. By the Bohne-Dress Theorem, zonotopal tilings of correspond to lifts of the oriented matroid of . Here, a lift is an oriented matroid of rank on the ground set and such that . The tiles of the subdivision defined by the lift are the intervals such that has a covector that is negative on , zero on , and positive on .
That is, our hypothesis is that there is a lift of that contains the covectors
[TABLE]
Elimination of the element among these covectors gives us a covector of Proposition 4.3.
- •
. Let as in the proof of , and define as follows:
[TABLE]
Then and the defined by show that and are cells in .
- •
For and to be cells in a subdivision it is necessary that their convex hulls intersect in a common face. That is, there must be a covector in that is zero in , negative on , and positive on . These are precisely the same conditions as required in Proposition 4.3.
- •
and are obvious. ∎
Remark 4.7**.**
With this theorem, it is now easy to see that Lemma 3.5 also holds for non coherent subdivisions. If is a spanning set then there can not be a linear functional vanishing on it, so and are not separated (unless , in which case they are the same cell).
Remark 4.8**.**
The definition of separated points and tiles makes sense for an arbitrary oriented matroid , since it uses only the notion of circuits, and Proposition 4.3 still holds in tis more general setting.
The notions of zonotopal tiling and of subdivision also make sense for arbitrary oriented matroids: the former is interpreted as “extension of the dual oriented matroid” via Theorem 2.10 and the latter is studied in detail in [San02]. In this setting the implications of Theorem 4.6 still hold, the first one as a consequence of the oriented matroid analogue of Proposition 2.9 and the second one because our proof above works at the level of oriented matroids. Yet:
- (1)
The notion of coherent subdivisions needs a realization of the oriented matroid be given. Not only the notion does not make sense for nonrealizable oriented matroids. Also, different realizations of the same oriented matroid may have different sets of coherent subdivisions, and non-isomorphic secondary polytopes/zonotopes. 2. (2)
The implication fails in the example of [San02, Section 5.2] (see Proposition 5.6(i) in that section), and the implication fails in the Lawrence polytope that one can construct from that example.
Corollary 4.9**.**
Let and be two separated tiles. Then any pair of subtiles and are separated.
Proof.
By Theorem 4.6, there is a zonotopal tiling using and and such tiling uses and . ∎
Proposition 4.10**.**
Let be a configuration of pairwise independent points. Let . Let and be two tiles that cover level (that is, . Suppose that and are not-separated and that one of them is not fine.
Then, there are fine tiles and contained in and , still covering level and still not separated.
Proof.
By induction on the dependence rank of the tiles we only need to show that if is dependent then there is a tile properly contained in , covering level , and non-separated from .
Let be a circuit showing that and are not-separated. Let be its support.
If there is an element then both and are not separated from , and one of them still covers level , since dependent sets are of size at least 3.
If there is no such an , then . Since is a circuit we conclude that . By definition, we have that and . Again, we take as new tile or , depending on which of the two still covers level , where and . ∎
Corollary 4.11**.**
Let be a point configuration in general position (“uniform”) and let . If no hypertriangulation of contains two non-separated tiles, then no hypersimplicial subdivision of contains them either.
Proof.
Suppose that a subdivision contains two non-separated tiles and . Let and be the tiles guaranteed by Proposition 4.10. Then, we can refine and to fine subdivisions using and . By general position this extends to a hypertriangulation refining and with two non-separated tiles. ∎
5. Non-separated subdivisions
We call a subdivision of non-separated if it contains two non-separated cells. Non-separated subdivisions are certainly non-lifting.
Example 5.1**.**
We here construct a non-separated subdivision in dimension two, which contrasts the fact that for such things do not exist [BW19]. Let be the configuration of the following 5 points in the plane: , , , and . Figure 4 on the right shows a hypertriangulation of consisting of the triangles:
[TABLE]
The circuit shows that the cell is not separated from the cells and .
The following non-separated subdivision of appears in [Pos19, Exm. 10.4]:
[TABLE]
Here we generalize it to
Lemma 5.2**.**
For every odd and every there is a non-separated hypertriangulation of .
Proof.
A hypertriangulation of a configuration with has all its full-dimensional cells of one of the following forms, where and we omit the superscript , which will be clear from the context:
[TABLE]
To simplify notation, we denote these four cells simply as , , and , respectively (observe that we always write the indices and in increasing order). For example, in this notation the subdivision of mentioned above becomes
[TABLE]
One reason for this notation is that via the correspondence in Proposition 2.9 the tile corresponds in to the cone spanned by , where we use to denote the set of vectors opposite to , for .
With this notation, Proposition 2.9(2) gives us that the following is a (coherent) zonotopal tiling of (Figure 5 shows the case of ):
[TABLE]
admits the following cubical flips:
- •
Flip 1: negate the other symbol in every cell containing . That is, remove
[TABLE]
and insert
[TABLE]
- •
Flip 2: negate the other element in every cell containing . That is, remove
[TABLE]
and insert
[TABLE]
These flips transform into two new coherent tilings and , also shown in Figure 5. The two flips are not compatible, since both want to remove the tile from , and we can only remove it once. But only affects level of the tiling, which means that in any with we can do these two flips one after the other. After performing them we get a subdivision that contains (for ) the non-separated cells
[TABLE]
To further generalize this construction we need the following easy lemma:
Lemma 5.3**.**
Let be a -dimensional configuration of size in general position. If has a non-separated subdivision for some then and have non-separated subdivisions too.
Proof.
For do the following: Extend to a subdivision of by adding all the cells of the form with such that is separated from . (The latter is equivalent to saying that is contained in a facet of whose normal vector has positive scalar product with ). is non-separated since it contains .
For apply the same construction upside-down. That is, consider the non-separated subdivision of obtained from via the map . From construct a non-separated subdivision of as above, then turn upside-down to get a non-separated subdivision of . ∎
Corollary 5.4**.**
For every odd , every , and every , there is a non-separated hypertriangulation of . ∎
Question 5.5**.**
Are there non separated hypertriangulations of for even? The case of suggests that the answer is no.
6. Baues posets for
In this section we will restrict ourselves to the case when is a convex polygon .
Definition 6.1**.**
Let be a subdivision of . We define
[TABLE]
Proposition 6.2**.**
Let be a zonotopal tiling of . Then
[TABLE]
Proof.
It is straightforward to check that both sets equal
[TABLE]
∎
The proposition suggests we use the notation
[TABLE]
and define the following poset:
Definition 6.3**.**
We define to be the poset on the set
[TABLE]
where the order is refinement, as in subdivisions: if and only if . We have two natural order-preserving maps and such that for every we have
[TABLE]
Remark 6.4**.**
The maps and are well defined thanks to the fact that all hypersimplicial subdivisions of are lifting ([BW19]). For more general configurations the definitions above would only make sense restricted to lifting subdivisions.
Example 6.5**.**
Consider the subdivision in Figure 6 whose maximal cells are
[TABLE]
The gray cells of in the figure give ; that is:
[TABLE]
As seen in the right part of the figure, the cells in are precisely the ones that have a full-dimensional intersection with the first level.
The main result in this section is that and induce homotopy equivalences of the corresponding order complexes (Corollary 6.13). To prove this we use the following criterion, originally proved by Babson [Bab93]. Another proof can be found in [SZ93] and some generalizations appear in [BWW05]:
Lemma 6.6** (Babson’s Lemma).**
Let be an order preserving map between two posets. Suppose that for every we have that
- (1)
* is contractible, and* 2. (2)
* is contractible, for every .*
Then is a homotopy equivalence.
For a collection of subzonotopes of , let be the set of vertices of cardinality of all zonotopes in . We only consider a point in to be a vertex if it is a face; that is, if is separated from .
Proposition 6.7**.**
Let . Consider a point . Define
[TABLE]
(Here “ ” stands for “upper hole”). Then is separated from every cell in .
Proof.
Observe that equals
[TABLE]
Suppose there exists and such that and are not separated. Since we may assume that and there is such that is not separated from . So we have a circuit such that and Further, since we can also assume . Let . Since we have that there is such that is a face of a cell in . Then by Corollary 4.9 and the fact that is pairwise separated we have that is separated from . So can not be contained in . This means that . Notice that for every there is such that is a circuit. So if there is an , this circuit would imply that is not separated from , which can not be as is a face of some cell in . But this means which is a contradiction since . ∎
Corollary 6.8**.**
Let . Then
[TABLE]
together with all their faces, form the unique coarsest subdivision in the fibre .
Proof.
We need to show that for , and are separated. If not, we can again assume there are subsets and of cardinality such that and are separated. As any subtile of them are faces of , we have that there is a circuit and . Similarly as the proof of 6.7, this implies that . The corollary follows from the fact that every cell in a subdivision in not coming from is of type 1 and hence it is contained in for some . ∎
Example 6.9**.**
Consider the subdivision in Figure 6 whose maximal cells are
[TABLE]
We have that
[TABLE]
so that the coarsest subdivision of has maximal cells
[TABLE]
The two cells
[TABLE]
are also in , but they are not maximal: they are edges.
Lemma 6.10**.**
Let and let be such that . Then, the poset has a unique maximal element.
Proof.
Let be the maximal element of , as described in Corollary 6.8.
Let , which is a refinement of . If a cell is such that , then which implies that it is contained in a cell of . Then, is contained in a cell of . Thus, for to be a refinement of , it is enough that is contained in a cell of for every with .
For every such , the cells are a subdivision of the polygon . Let be such subdivision. For each there are two possibilities:
- •
If , then is contained in a cell of if and only if there is some such that .
- •
If is not contained in , then is contained in a cell of if and only if does not intersect the interior of . To see this, notice that if does not intersect the interior of , then all vertices of correspond to edges of contained in the same cell of . If this cell is , then contains .
The discussion above implies that: a is a refinement of if and only if all edges of are also edges in . This follows from the fact that the only edges in not in are of the form with and . For each , there is a unique coarsest subdivision of the polygon that uses those edges. The subdivision that does that for each is the unique coarsest refinement of in . ∎
Example 6.11**.**
Consider the subdivisions from Example 6.5 and from Example 6.9. We have that refines . The unique minimal, (actually, the only) subdivision in is as depicted in Figure 8.
Remark 6.12**.**
One could expect the unique maximal element stated in Lemma 6.10 to coincide with the maximal element in . That is not the case in Example 6.11. In fact, in that example (whose picture would be as the picture of in Figure 6 without the edge ) does not refine .
Corollary 6.13**.**
The maps and are homotopy equivalences.
Proof.
For , conditions (1) and (2) in Babson’s Lemma follow from Corollary 6.8 and Lemma 6.10, respectively, since a poset with a unique maximal element is clearly contractible. For the proof is completely symmetric. ∎
Theorem 6.14**.**
Let be the vertex set of a convex -gon. The inclusion is a homotopy equivalence, for .
Proof.
The proof is by induction on . The base case, , is the main result of Rambau and Santos in [RS00]. Now let us suppose that is a homotopy equivalence and we will prove that is also a homotopy equivalence. Consider the following diagram, which commutes by Proposition 6.2:
{\mathcal{B}_{\operatorname{coh}}^{(k+1)}(\mathbf{P}_{n})}$${\mathcal{B}^{(k+1)}(\mathbf{P}_{n})}$${\mathcal{B}_{\operatorname{coh}}^{Z}(\mathbf{P}_{n})}$${\mathcal{B}^{(k+\frac{1}{2})}(\mathbf{P}_{n})}$${\mathcal{B}_{\operatorname{coh}}^{(k)}(\mathbf{P}_{n})}$${\mathcal{B}^{(k)}(\mathbf{P}_{n})}$$\scriptstyle{i^{(k+1)}}$$\scriptstyle{\mathcal{D}}$$\scriptstyle{r^{(k+1)}}$$\scriptstyle{r^{(k)}}$$\scriptstyle{i^{(k)}}$$\scriptstyle{\mathcal{U}}
The maps and are the inclusions of coherent subdivisions into all subdivisions. The maps and are the restriction of each zonotopal tiling to its and levels; that is, and respectively. They are homotopy equivalences since they can be geometrically realized as the identity maps among the normal fans of , and . Since and are homotopy equivalences by Corollary 6.13, and is a homotopy equivalence by inductive hypothesis, the dotted arrow must also be a homotopy equivalence. ∎
Corollary 6.15**.**
The restriction map is a homotopy equivalence.
Proof.
We now use the following commutative diagram:
{\mathcal{B}_{\operatorname{coh}}^{Z}(\mathbf{P}_{n})}$${\mathcal{B}^{Z}(\mathbf{P}_{n})}$${\mathcal{B}_{\operatorname{coh}}^{(k)}(\mathbf{P}_{n})}$${\mathcal{B}^{(k)}(\mathbf{P}_{n})}$$\scriptstyle{i^{(k+1)}}$$\scriptstyle{r^{(k)}}$$\scriptstyle{r^{(k)}}$$\scriptstyle{i^{(k)}}
The top arrow is a homotopy equivalence by [SZ93] and the bottom arrow by Theorem 6.14. The left arrow is also a homotopy equivalence, as mentioned in the proof of Theorem 6.14, so the right arrow is a homotopy equivalence too. ∎
7. Hypercatalan numbers
Let be the number of hypertriangulations of , which we will call hypercatalan number. When these are the usual Catalan numbers . In this section we look at the case . For a triangulation of and a vertex we write for the number of diagonals (edges excluding the sides of ) in incident to and we call it the degree of .
Lemma 7.1**.**
[TABLE]
where the sum runs over all trinangulations of .
Proof.
Let be a triangulation of . To get a hypertriangulation of that agrees with we need to triangulate for every . As is a polygon with vertices, the number of ways to triangulate it is . So for each triangulation there are hypertriangulations of . Summing over all triangulations gives the desired result. ∎
Example 7.2**.**
For we have computed this formula to give the following values:
[TABLE]
The computation for is as follows. Triangulations of the hexagon fall into three symmetry classes:
- •
Two triangulations with degree sequence , each contributing to the sum.
- •
Six triangulations with degree sequence , each contributing to the sum.
- •
Six triangulations with degree sequence , each contributing to the sum.
This gives a total of fine subdivisions in .
Lemma 7.3**.**
Let be a triangulation of an -gon with . Then
[TABLE]
Proof.
Let be the sequence of the degrees of the vertices of which are positive. The terms of this sequence add up to . The contribution of to the sum is . Observe that the number is the number of ears in , which lies between and . Thus, lies between and .
For the lower bound, take into account that for every one has , we deduce the contribution of to be at least . Plugging in that , we get the desired lower bound.
For the upper bound, let be number of degree 1 vertices. Reorder the so that the last are equal to 1. We have that . Now take into account that for we have that , so
[TABLE]
where is the number of ears. So to prove the upper bound we need to show that .
Suppose is the triangulation that maximizes . If there was a vertex of inner degree 1 such that it is not adjacent to an ear, flipping this edge would not decrease the number . So we can assume every degree 1 vertex is next to an ear. But then the vertex of degree 1 can not be neighbour to two ears, otherwise , and it can not be neighbour to another vertex of degree 1, otherwise . Also, an ear can not be neighbour to two degree 1 vertices, otherwise . So the other neighbours of a pair of consecutive vertices (ear,degree 1) must have degree at least 2. Let the number of ears not adjacent to any degree 1 vertex. Then is the number of pairs (ear,degree 1) and we have:
[TABLE]
∎
Corollary 7.4**.**
For ,
[TABLE]
∎
Remark 7.5**.**
The lower bound of of Lemma 7.3 for the contribution of a single triangulation is attained by a zigzag triangulation, in which all degrees are except for two s and two [math]s. When is a star triangulation in which a vertex is joined to all others, the contribution of is (neglecting a polynomial factor). A higher contribution is obtained by the following procedure: start with any triangulation (e.g. a zig-zag or a star). Let be obtained by adding an ear at each boundary edge of , let be obtained from in the same way, etcetera. This method produces triangulations that contribute about (according to our computations) for large.
Remark 7.6**.**
By [Gal18, Theorem 1.2], hypercatalan numbers are bounded from above by the number of fine zonotopal tilings of , which is sequence A060595 in the Online Encyclopedia of Integer Sequences. The known terms are
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Bab 93] Eric K. Babson. A combinatorial flag space . Ph D thesis, Massachusetts Institute of Technology, 1993.
- 2[BKS 94] L. J. Billera, M. M. Kapranov, and B. Sturmfels. Cellular strings on polytopes. Proc. Amer. Math. Soc. , 122(2):549–555, 1994.
- 3[BLVS + 99] Anders Björner, Michel Las Vergnas, Bernd Sturmfels, Neil White, and Günter M. Ziegler. Oriented matroids , volume 46 of Encyclopedia of Mathematics and its Applications . Cambridge University Press, Cambridge, second edition, 1999.
- 4[BS 92] Louis J. Billera and Bernd Sturmfels. Fiber polytopes. Ann. of Math. (2) , 135(3):527–549, 1992.
- 5[BW 19] Alexey Balitskiy and Julian Wellman. Flip cycles in plabic graphs. ar Xiv preprint ar Xiv:1902.01530 v 2 , June 2019.
- 6[BWW 05] Anders Björner, Michelle L. Wachs, and Volkmar Welker. Poset fiber theorems. Trans. Amer. Math. Soc. , 357(5):1877–1899, 2005.
- 7[DLRS 10] Jesús A. De Loera, Jörg Rambau, and Francisco Santos. Triangulations , volume 25 of Algorithms and Computation in Mathematics . Springer-Verlag, Berlin, 2010. Structures for algorithms and applications.
- 8[Gal 18] Pavel Galashin. Plabic graphs and zonotopal tilings. Proc. Lond. Math. Soc. (3) , 117(4):661–681, 2018.
