Related papers: Polytopes with Special Simplices
Given a graph G, we construct a convex polytope whose face poset is based on marked subgraphs of G. Dubbed the graph multiplihedron, we provide a realization using integer coordinates. Not only does this yield a natural generalization of…
We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1+...+P_r$, of $r$ convex $d$-polytopes $P_1,...,P_r$ in $\mathbb{R}^d$, where $d\ge{}2$ and $r<d$, as a (recursively defined)…
A split of a polytope $P$ is a (regular) subdivision with exactly two maximal cells. It turns out that each weight function on the vertices of $P$ admits a unique decomposition as a linear combination of weight functions corresponding to…
We call complex quasifold of dimension k a space that is locally isomorphic to the quotient of an open subset of the space C^k by the holomorphic action of a discrete group; the analogue of a complex torus in this setting is called a…
A d-dimensional rational polytope P is a polytope whose vertices are located at the nodes of d-dimensional Z-lattice. Consider a number of points inside the inflated polytope (with coefficient of inflation k, k=1,2, 3...). The Ehrhart…
Points of an orbit of a finite Coxeter group G, generated by n reflections starting from a single seed point, are considered as vertices of a polytope (G-polytope) centered at the origin of a real n-dimensional Euclidean space. A general…
A log symplectic manifold is a complex manifold equipped with a complex symplectic form that has simple poles on a hypersurface. The possible singularities of such a hypersurface are heavily constrained. We introduce the notion of an…
FFLV polytopes describe monomial bases in irreducible representations of $\mathfrak{sl}_n$ and $\mathfrak{sp}_{2n}$. We study various sets of vertices of FFLV polytopes. First, we consider the special linear case. We prove the locality of…
A complete set of N+1 mutually unbiased bases (MUBs) exists in Hilbert spaces of dimension N = p^k, where p is a prime number. They mesh naturally with finite affine planes of order N, that exist when N = p^k. The existence of MUBs for…
In the paper we treat Gale diagrams in a combinatorial way. The interpretation allows to describe simplicial complexes which are Alexander dual to boundaries of simplicial polytopes and, more generally, to nerve-complexes of general…
Hypersimplices are well-studied objects in combinatorics, optimization, and representation theory. For each hypersimplex, we define a new family of subpolytopes, called r-stable hypersimplices, and show that a well-known regular unimodular…
A stacking operation adds a $d$-simplex on top of a facet of a simplicial $d$-polytope while maintaining the convexity of the polytope. A stacked $d$-polytope is a polytope that is obtained from a $d$-simplex and a series of stacking…
Compact polyhedra of cubic point symmetry Oh, exhibit surfaces of planar sections (facets) characterized by normal vector families {abc} with up to 48 members each, compatible with Oh symmetry. We focus first on polyhedra confined by facets…
We discuss a particular class of rational Gorenstein singularities, which we call symplectic. A normal variety V has symplectic singularities if its smooth part carries a closed symplectic 2-form whose pull-back in any resolution X --> V…
For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…
Despite a full characterization of the face vectors of simple and simplicial polytopes, the face numbers of general polytopes are poorly understood. Around 1997, B\'ar\'any asked whether for all convex $d$-polytopes $P$ and all $0 \leq k…
In this paper we give a combinatorial view on the adjunction theory of toric varieties. Inspired by classical adjunction theory of polarized algebraic varieties we define two convex-geometric notions: the Q-codegree and the nef value of a…
We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…
Bisztriczky introduced the multiplex as a generalization of the simplex. A polytope is multiplicial if all its faces are multiplexes. In this paper it is proved that the flag vectors of multiplicial polytopes depend only on their face…
Toric topology assigns to each $n$-dimensional combinatorial simple convex polytope $P$ with $m$ facets an $(m+n)$-dimensional moment-angle manifold $\mathcal{Z}_P$ with an action of a compact torus $T^m$ such that $\mathcal{Z}_P/T^m$ is a…