There are two related poset structures, the higher Stasheff-Tamari orders, on the set of all triangulations of the cyclic $d$ polytope with $n$ vertices. In this paper it is shown that both of them have the homotopy type of a sphere of dimension $n-d-3$.
Moreover, we resolve positively a new special case of the \emph{Generalized Baues Problem}: The Baues poset of all polytopal decompositions of a cyclic polytope of dimension $d \leq 3$ has the homotopy type of a sphere of dimension $n-d-2$.
The cd-index is an invariant of Eulerian posets expressed as a polynomial in noncommuting variables c and d. It determines another invariant, the h-polynomial. In this paper, we study the relative setting, that of subdivisions of posets. We introduce the mixed cd-index, an invariant of strong formal subdivisions of posets, which determines the mixed h-polynomial introduced by the second author with Stapledon. The mixed cd-index is a polynomial in noncommuting variables c',d',c,d, and e and is defined in terms of the local cd-index of Karu. Here, use is made of the decomposition theorem for the…
We prove that the ranks of the subsets and the activities of the bases of a matroid define valuations for the subdivisions of a matroid polytope into smaller matroid polytopes.
Adjacency polytopes, a.k.a. symmetric edge polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular, the authors are motivated by the tropical intersections problem derived from the Kuramoto equations. Regular subdivisions of adjacency polytopes are instrumental in solving these problems. This paper explores connections between the regular subdivisions of an adjacency polytope and the contraction of the underlying graph along an edge. We construct a special …
The polytopes $\mathcal{U}_{I,\bar{J}}$ were introduced by Ceballos, Padrol, and Sarmiento to provide a geometric approach to the study of $(I,\bar{J})$-Tamari lattices. They observed a connection between certain $\mathcal{U}_{I,\bar{J}}$ and acyclic root polytopes, and wondered if Mészáros' subdivision algebra can be used to subdivide all $\mathcal{U}_{I,\bar{J}}$. We answer this in the affirmative from two perspectives, one using flow polytopes and the other using root polytopes. We show that $\mathcal{U}_{I,\bar{J}}$ is integrally equivalent to a flow polytope that can be subdivided using t…
The class of simplicial complexes representing triangulations and subdivisions of Lawrence polytopes is closed under Alexander duality. This gives a new geometric model for oriented matroid duality.
We study the limiting behavior of the zeros of the zeta series of a finite poset under iterated barycentric subdivision, and we indicate the possibility of its application to number theory.
For a lattice path $ν$ from the origin to a point $(a,b)$ using steps $E=(1,0)$ and $N=(0,1)$, we construct an associated flow polytope $\mathcal{F}_{\hat{G}_B(ν)}$ arising from an acyclic graph where bidirectional edges are permitted. We show that the flow polytope $\mathcal{F}_{\hat{G}_B(ν)}$ admits a subdivision dual to a $w$-simplex, where $w$ is the number of valleys in the path $\barν = EνN$. Refinements of this subdivision can be obtained by reductions of a polynomial $P_ν$ in a generalization of Mészáros' subdivision algebra for acyclic root polytopes where negative roots are allowed. …
This thesis aims to give the reader an introduction and overview of the cd-index of a poset, as well as establish some new results. We give a combinatorial proof of Ehrenborg and Karu's cd-index subdivision decomposition for Gorenstein* complexes and extend it to a wider class of subdivisions. In doing so, we define a local cd-index that behaves analogously to the well studied local h-vector. We examine known cd-index and h-vector bounds, and then use the local cd-index to bound a particular class of polytopes with the cd-index of a stacked polytope. We conclude by investigating the h-vector a…
For any flag simplicial complex $Θ$ obtained by stellar subdividing the boundary of the cross polytope in edges, we define a flag simplicial complex $Γ(Θ)$ (dependent on the sequence of subdivisions) whose $f$-vector is the $γ$-vector of $Θ$. This proves that the $γ$-vector of any such simplicial complex satisfies the Frankl-Füredi-Kalai inequalities, partially solving a conjecture by Nevo and Petersen \cite{np}. We show that when $Θ$ is the dual simplicial complex to a nestohedron, and the sequence of subdivisions corresponds to a flag ordering as defined in \cite{ai}, that $Γ(Θ)$ is equal to…
We provide a Minkowski sum decomposition of marked chain-order polytopes into building blocks associated to elementary markings and thus give an explicit minimal set of generators of an associated semi-group algebra. We proceed by characterizing the reflexive polytopes among marked chain-order polytopes as those with the underlying marked poset being ranked.
For any marked poset we define a continuous family of polytopes, parametrized by a hypercube, generalizing the notions of marked order and marked chain polytopes. By providing transfer maps, we show that the vertices of the hypercube parametrize an Ehrhart equivalent family of lattice polytopes. The combinatorial type of the polytopes is constant when the parameters vary in the relative interior of each face of the hypercube. Moreover, with the help of a subdivision arising from a tropical hyperplane arrangement associated to the marked poset, we give an explicit description of the vertices of…
This work regards the order polytopes arising from the class of generalized snake posets and their posets of meet-irreducible elements. Among generalized snake posets of the same rank, we characterize those whose order polytopes have minimal and maximal volume. We give a combinatorial characterization of the circuits in these order polytopes and then conclude that every triangulation is unimodular. For a generalized snake word, we count the number of flips for the canonical triangulation of these order polytopes. We determine that the flip graph of the order polytope of the poset whose lattice…
We prove the unimodality of the Ehrhart $δ$-polynomial of the chain polytope of the zig-zag poset, which was conjectured by Kirillov. First, based on a result due to Stanley, we show that this polynomial coincides with the $W$-polynomial for the zig-zag poset with some natural labeling. Then, its unimodality immediately follows from a result of Gasharov, which states that the $W$-polynomials of naturally labeled graded posets of rank $1$ or $2$ are unimodal.
We introduce Lipschitz functions on a finite partially ordered set $P$ and study the associated Lipschitz polytope $L(P)$. The geometry of $L(P)$ can be described in terms of descent-compatible permutations and permutation statistics that generalize descents and big ascents. For ranked posets, Lipschitz polytopes are centrally-symmetric and Gorenstein, which implies symmetry and unimodality of the statistics. Finally, we define $(P,k)$-hypersimplices as generalizations of classical hypersimplices and give combinatorial interpretations of their volumes and $h^*$-vectors.
Greene's rational function $Ψ_P({\bf x})$ is a sum of certain rational functions in ${\bf x}=(x_1, \ldots, x_n)$ over the linear extensions of the poset $P$ (which has $n$ elements), which he introduced in his study of the Murnaghan-Nakayama formula for the characters of the symmetric group. In recent work Boussicault, Féray, Lascoux and Reiner showed that $Ψ_P({\bf x})$ equals a valuation on a cone and calculated $Ψ_P({\bf x})$ for several posets this way. In this paper we give an expression for $Ψ_P({\bf x})$ for any poset $P$. We obtain such a formula using dissections of root polytopes. Mo…
In this paper we show that the pipe dream complex associated to the permutation 1n(n-1)...2 can be geometrically realized as a triangulation of the vertex figure of a root polytope. Leading up to this result we show that the Grothendieck polynomial specializes to the h-polynomial of the corresponding pipe dream complex, which in certain cases equals the h-polynomial of canonical triangulations of root (and flow) polytopes, which in turn equals a specialization of the reduced form of a monomial in the subdivision algebra of root (and flow) polytopes. Thus, we connect Grothendieck polynomials to…
Université du Québec à Montréal（蒙特利尔大学）；York University（约克大学）；Universitat de Barcelona（巴塞罗那大学）；Centre de Recerca Matemàtica（数学研究中心）；Osnabrück Universität（奥斯纳布吕克大学）；University of Michigan（密歇根大学）；University of Crete（克里特大学）
For a poset $P$ and an integer $r\geq 1$, let $P_r$ be a collection of all $r$-multichains in $P$. Corresponding to each strictly increasing map $ı:[r]\rightarrow [2r]$, there is an order $\preceq_ı$ on $P_r$. Let $\D(G_ı(P_r))$ be the clique complex of the graph $G_ı$ associated to $P_r$ and $ı$. In a recent paper \cite{NW}, it is shown that $\D(G_ı(P_r))$ is a subdivision of $P$ for a class of strictly increasing maps. In this paper, we show that all these subdivisions have the same $f$-vector. We give an explicit description of the transformation matrices from the $f$- and $h$-vectors of $Δ…
Let $π:{\mathbb R}^n \to {\mathbb R}^d$ be any linear projection, let $A$ 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 $k$-th hypersimplex, for $k=1,\dots,n-1$. We show that: - For arbitrary $A$ and for $k\le d+1$, the corresponding fiber polytope $\mathcal F^{(k)}(A)$ is normally isomorphic to the Minkowski sum of the secondary polytopes of all …
We consider the inversion enumerator I_n(q), which counts labeled trees or, equivalently, parking functions. This polynomial has a natural extension to generalized parking functions. Substituting q = -1 into this generalized polynomial produces the number of permutations with a certain descent set. In the classical case, this result implies the formula I_n(-1) = E_n, the number of alternating permutations. We give a combinatorial proof of these formulas based on the involution principle. We also give a geometric interpretation of these identities in terms of volumes of generalized chain polyto…
We analyze marked poset polytopes and generalize a result due to Hibi and Li, answering whether the marked chain polytope is unimodular equivalent to the marked order polytope. Both polytopes appear naturally in the representation theory of semi-simple Lie algebras, and hence we can give a necessary and sufficient condition on the marked poset such that the associated toric degenerations of the corresponding partial flag variety are isomorphic. We further show that the set of lattice points in such a marked poset polytope is the Minkowski sum of sets of lattice points for 0-1 polytopes. Moreov…
The Möbius polynomial is an invariant of ranked posets, closely related to the Möbius function. In this paper, we study the Möbius polynomial of face posets of convex polytopes. We present formulas for computing the Möbius polynomial of the face poset of a pyramid or a prism over an existing polytope, or of the gluing of two or more polytopes in terms of the Möbius polynomials of the original polytopes. We also present general formulas for calculating Möbius polynomials of face posets of simplicial polytopes and of Eulerian posets in terms of their $f$-vectors and some additional constraints.
In 1986 Stanley associated to a poset the order polytope. The close interplay between its combinatorial and geometric properties makes the order polytope an object of tremendous interest. Double posets were introduced in 2011 by Malvenuto and Reutenauer as a generalization of Stanleys labelled posets. A double poset is a finite set equipped with two partial orders. To a double poset Chappell, Friedl and Sanyal (2017) associated the double order polytope. They determined the combinatorial structure for the class of compatible double posets. In this paper we generalize their description to all d…
To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way of geometry and vice versa. Malvenuto and Reutenauer (2011) introduced 'double posets', that is, (finite) sets equipped with two partial orders, as a generalization of Stanley's labelled posets. Many combinatorial constructions can be naturally phrased in terms of double posets. We introduce the 'double order polytope' and the 'double chain polytope' and we …
The cyclic polytope $C(n,d)$ is the convex hull of any $n$ points on the moment curve ${(t,t^2,...,t^d):t \in \reals}$ in $\reals^d$. For $d' >d$, we consider the fiber polytope (in the sense of Billera and Sturmfels) associated to the natural projection of cyclic polytopes $π: C(n,d') \to C(n,d)$ which "forgets" the last $d'-d$ coordinates. It is known that this fiber polytope has face lattice indexed by the coherent polytopal subdivisions of $C(n,d)$ which are induced by the map $π$. Our main result characterizes the triples $(n,d,d')$ for which the fiber polytope is canonical in either of t…
The type A_n full root polytope is the convex hull in R^{n+1} of the origin and the points e_i-e_j for 1<= i<j <= n+1. Given a tree T on the vertex set [n+1], the associated root polytope P(T) is the intersection of the full root polytope with the cone generated by the vectors e_i-e_j, where (i, j) is an edge of T, i<j. The reduced forms of a certain monomial m[T] in commuting variables x_{ij} under the reduction x_{ij}x_{jk} --> x_{ik}x_{ij}+x_{jk}x_{ik}+βx_{ik}, can be interpreted as triangulations of P(T). Using these triangulations, the volume and Ehrhart polynomial of P(T) are obtained. I…
The flow polytope $\mathcal{F}_{\widetilde{G}}$ is the set of nonnegative unit flows on the graph $\widetilde{G}$. The subdivision algebra of flow polytopes prescribes a way to dissect a flow polytope $\mathcal{F}_{\widetilde{G}}$ into simplices. Such a dissection is encoded by the terms of the so called reduced form of the monomial $\prod_{(i,j)\in E(G)}x_{ij}$. We prove that we can use the subdivision algebra of flow polytopes to construct not only dissections, but also regular flag triangulations of flow polytopes. We prove that reduced forms in the subdivision algebra are generalizations o…
Consider the poset of partitions of {1,...(n-1)k+1} with block sizes congruent to 1 modulo k. We prove that its order complex is a subdivision of the complex of k-trees, thereby answering a question posed by Feichtner. The result is obtained by an ad-hoc generalization of concepts from the theory of nested set complexes to non-lattices.
We describe a family of shellings for the canonical triangulation of the order polytope of the zig-zag poset. This gives a new combinatorial interpretation for the coefficients in the numerator of the Ehrhart series of this order polytopein terms of the swap statistic on alternating permutations.
Stanley (1986) showed how a finite partially ordered set gives rise to two polytopes, called the order polytope and chain polytope, which have the same Ehrhart polynomial despite being quite different combinatorially. We generalize his result to a wider family of polytopes constructed from a poset P with integers assigned to some of its elements. Through this construction, we explain combinatorially the relationship between the Gelfand-Tsetlin polytopes (1950) and the Feigin-Fourier-Littelmann polytopes (2010), which arise in the representation theory of the special linear Lie algebra. We then…
The secondary polytope of a point configuration A is a polytope whose face poset is isomorphic to the poset of all regular subdivisions of A. While the vertices of the secondary polytope - corresponding to the triangulations of A - are very well studied, there is not much known about the facets of the secondary polytope. The splits of a polytope, subdivisions with exactly two maximal faces, are the simplest examples of such facets and the first that were systematically investigated. The present paper can be seen as a continuation of these studies and as a starting point of an examination of th…
