Related papers: Fiber polytopes for the projections between cyclic…

For any Wulff shape $\mathcal{W}$, its dual Wulff shape and spherical Wulff shape $\widetilde{\mathcal{W}}$ can be defined naturally. A self-dual Wulff shape is a Wulff shape equaling its dual Wulff shape exactly. In this paper, we show…

In this paper and in its sequel [BKLV], we investigate the cone ${\rm Pseff}_n(C_d)$ of pseudoeffective $n$-cycles in the symmetric product $C_d$ of a smooth curve $C$. In the present paper, we study the convex-geometric properties of the…

We introduce a deformed product construction for simple polytopes in terms of lower-triangular block matrix representations. We further show how Gale duality can be employed for the construction and for the analysis of deformed products…

Proteins form a very important class of polymers. In spite of major advances in the understanding of polymer science, the protein problem has remained largely unsolved. Here, we show that a polymer chain viewed as a tube not only captures…

The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…

In the classical setting, a convex polytope is said to be semiregular if its facets are regular and its symmetry group is transitive on vertices. This paper studies semiregular abstract polytopes, which have abstract regular facets, still…

We give a self-contained introduction to the theory of secondary polytopes and geometric bistellar flips in triangulations of polytopes and point sets, as well as a review of some of the known results and connections to algebraic geometry,…

Bidouble covers $\pi : S \mapsto Q$ of the quadric Q are parametrized by connected families depending on four positive integers a,b,c,d. In the special case where b=d we call them abc-surfaces. Such a Galois covering $\pi$ admits a small…

In a d-simplex every facet is a (d-1)-simplex. We consider as generalized simplices other combinatorial classes of polytopes, all of whose facets are in the class. Cubes and multiplexes are two such classes of generalized simplices. In this…

We prove that any convex geometry $\mathcal{A}=(U,\mathcal{C})$ on $n$ points and any ideal $\mathcal{I}=(U',\mathcal{C}')$ of $\mathcal{A}$ can be realized as the intersection pattern of an open convex polyhedral cone $K\subseteq {\mathbb…

Although previous research has found several facts concerning chord lengths of regular polytopes, none of these investigations has considered whether any of these facts define relationships that might generalize to the chord lengths of all…

We study three families of polyhedral cones whose sections are regular simplices, cubes, and crosspolytopes. We compute solid angles and conic intrinsic volumes of these cones. We show that several quantities appearing in stochastic…

A simplicial polytope is a polytope with all its facets being combinatorially equivalent to simplices. We deal with the edge connectivity of the graphs of simplicial polytopes. We first establish that, for any $d\ge 3$, for any $d\ge 3$,…

Let $X_1,\ldots, X_{d+2}$ be random points in $\mathbb R^d$. The classical Sylvester problem asks to determine the probability that the convex hull of these points, denoted by $P:= [X_1,\ldots, X_{d+2}]$, is a simplex. In the present paper,…

Given a finite quiver (directed graph) without loops and multiedges, the convex hull of the column vector of the incidence matrix is called the directed edge polytope and is an interesting example of lattice polytopes. In this paper, we…

We prove the following theorem, which is related to McMullen's problem on projective transformations of polytopes; let $2\leq k\leq \lfloor{\frac{d}{2}}\rfloor$ and $\nu{(d, k)}$ be the largest number such that any set of $\nu{(d,k)}$…

We consider the problem of characterizing the convex hull of the graph of a bilinear function $f$ on the $n$-dimensional unit cube $[0,1]^n$. Extended formulations for this convex hull are obtained by taking subsets of the facets of the…

These notes are based on three lectures given at the 2013 CIME/CIRM summer school. The purpose of this series of lectures is to introduce the notion of a toric fibration and to give its geometrical and combinatorial characterizations.…

The classical Steinitz theorem asserts that if the origin lies within the interior of the convex hull of a set $S \subset \mathbb{R}^d$, then there are at most $2d$ points in $S$ whose convex hull contains the origin within its interior.…

Consider $n$ points $X_1,\ldots,X_n$ in $\mathbb R^d$ and denote their convex hull by $\Pi$. We prove a number of inclusion-exclusion identities for the system of convex hulls $\Pi_I:=conv(X_i\colon i\in I)$, where $I$ ranges over all…