Related papers: Realization of the Stasheff polytope
The paper presents a proof of the Hodge Riemann relations for the combinatorial intersection cohomology of a polytope, as fist given by K.Karu, in terms of geometric operations on polytopes.
We show that the vertex barycenter of generalized associahedra and permutahedra coincide for any finite Coxeter system.
We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its…
We define a family of convex polytopes called constrainahedra, which index collisions of horizontal and vertical lines. Our construction proceeds by first defining a poset $C(m,n)$ of good rectangular preorders, then proving that $C(m,n)$…
We determine that $\gamma$-vectors of partitioned permutohedra, thereby generalizing a result of Foata and Sch\"utzenberger. Our result is closely related to a result of Athanasiadis on the representation of the symmetric group on the…
We describe the adjacency of vertices of the (unbounded version of the) set covering polyhedron, in a similar way to the description given by Chvatal for the stable set polytope. We find a sufficient condition for adjacency, and…
Wythoff's construction associates a uniform polytope to a Coxeter diagram whose vertices are decorated with crosses, which indicate the subgroup stabilizing a generic point. Champagne, Kjiri, Patera, and Sharp remarked that by associating…
We study sheaves on holomorphic spaces of loops and apply this to the study of the complex, defined in \cite{BdSHK}, governing deformations of the \emph{Poisson vertex algebra} structure on the space of holomorphic loops into a Poisson…
We construct a solution to pentagon equation with anticommuting variables living on two-dimensional faces of tetrahedra. In this solution, matrix coordinates are ascribed to tetrahedron vertices. As matrix multiplication is noncommutative,…
We introduce a notion of complexity for Sefiert homology spheres by establishing a correspondence between lattice point counting in tethrahedra and the Heegaard-Floer homology. This complexity turns out to be equivalent to a version of…
We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…
We study the harmonic polytope, which arose in Ardila, Denham, and Huh's work on the Lagrangian geometry of matroids. We describe its combinatorial structure, showing that it is a $(2n-2)$-dimensional polytope with…
The aim of this paper is to give a survey of the known results concerning centrally symmetric polytopes, spheres, and manifolds. We further enumerate nearly neighborly centrally symmetric spheres and centrally symmetric products of spheres…
For any $r\geq 1$ and $\mathbf{n} \in \mathbb{Z}_{\geq0}^r \setminus \{\mathbf0\}$ we construct a poset $W_{\mathbf{n}}$ called a 2-associahedron. The 2-associahedra arose in symplectic geometry, where they are expected to control maps…
We introduce new algebraic structures associated with heptagon relations -- higher analogue of the well-known pentagon. The main points we deal with are: (i) polygon relations as algebraic imitations of Pachner moves, on the example of…
We study the relationship between the vertices of an up-monotone polyhedron $R$ and those of the polytope $P$ obtained by truncating $R$ with the unit hypercube. When $R$ has binary vertices, we characterize the vertices of $P$ in terms of…
We provide a piecewise linear isomorphism from the normal fan of the pivot polytope of a product of simplices to the normal fan of a shuffle of associahedra.
We establish the plurisubharmonicity of the envelope of the Poisson functional on almost complex manifolds. That is, we generalize the corresponding result for complex manifolds and almost complex manifolds of complex dimension two.
We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…
A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…