相关论文: Fiber polytopes for the projections between cyclic…

Let $S\to C$ be a smooth quasi-projective surface properly fibered onto a smooth curve. We prove that the multiplicativity of the perverse filtration on $H^*(S^{[n]},\mathbb{Q})$ associated with the natural map $S^{[n]}\to C^{(n)}$ implies…

A Newton-Okounkov polytope of a complete flag variety can be turned into a convex geometric model for Schubert calculus. Namely, we can represent Schubert cycles by linear combinations of faces of the polytope so that the intersection…

We consider the multilinear polytope defined as the convex hull of the set of binary points satisfying a collection of multilinear equations. The complexity of the facial structure of the multilinear polytope is closely related to the…

Every regular polytope has the remarkable property that it inherits all symmetries of each of its facets. This property distinguishes a natural class of polytopes which are called hereditary. Regular polytopes are by definition hereditary,…

We introduce a partial order on the set of all normal polytopes in R^d. This poset NPol(d) is a natural discrete counterpart of the continuum of convex compact sets in R^d, ordered by inclusion, and exhibits a remarkably rich combinatorial…

Let T be the unit circle in the complex plane C. This paper proves the existence of analytic structure in a compact subset K of T X C^n, where K has so-called "lineally convex" or "hypoconvex" fibers over T. It also addresses a related…

We present a simple sublinear time algorithm for testing the following geometric property. Let $P_1, ..., P_n$ be $n$ convex sets in $\mathbb{R}^d$ ($n \gg d$), such as polytopes, balls, etc. We assume that the complexity of each set…

Finding a good bound on the maximal edge diameter $\Delta(d,n)$ of a polytope in terms of its dimension $d$ and the number of its facets $n$ is one of the basic open questions in polytope theory \cite{BG}. Although some bounds are known,…

Plato envisioned Earth's building blocks as cubes, a shape rarely found in nature. The solar system is littered, however, with distorted polyhedra -- shards of rock and ice produced by ubiquitous fragmentation. We apply the theory of convex…

We study the following geometry problem: given a $2^n-1$ dimensional vector $\pi=\{\pi_S\}_{S\subseteq [n], S\ne \emptyset}$, is there an object $T\subseteq\mathbb{R}^n$ such that $\log(\mathsf{vol}(T_S))= \pi_S$, for all $S\subseteq [n]$,…

Polytope complexes are the generalisation of polygon meshes in geo-information systems (GIS) to arbitrary dimension, and a natural concept for accessing spatio-temporal information. Complexes of each dimension have a straight-forward…

This paper investigates the problem of listing faces of combinatorial polytopes, such as hypercubes, permutahedra, associahedra, and their generalizations. Firstly, we consider the face lattice, which is the inclusion order of all faces of…

Consider two half-spaces $H_1^+$ and $H_2^+$ in $\mathbb{R}^{d+1}$ whose bounding hyperplanes $H_1$ and $H_2$ are orthogonal and pass through the origin. The intersection $\mathbb{S}_{2,+}^d:=\mathbb{S}^d\cap H_1^+\cap H_2^+$ is a spherical…

Given a set $\Sigma$ of spheres in $\mathbb{E}^d$, with $d\ge{}3$ and $d$ odd, having a fixed number of $m$ distinct radii $\rho_1,\rho_2,...,\rho_m$, we show that the worst-case combinatorial complexity of the convex hull $CH_d(\Sigma)$ of…

A Coxeter polytope is a convex polytope in a real projective space equipped with linear reflections in its facets, such that the orbits of the polytope under the action of the group generated by the linear reflections tessellate a convex…

We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…

The cut polytope of a graph $G$ is the convex hull of the indicator vectors of all cuts in $G$ and is closely related to the MaxCut problem. We give the facet-description of cut polytopes of $K_{3,3}$-minor-free graphs and introduce an…

In 1967, Gr\"unbaum conjectured that the function $$ \phi_k(d+s,d):=\binom{d+1}{k+1}+\binom{d}{k+1}-\binom{d+1-s}{k+1},\; \text{for $2\le s\le d$} $$ provides the minimum number of $k$-faces for a $d$-dimensional polytope (abbreviated as a…

In this paper we consider polytopes given by systems of $n$ inequalities in $d$ variables, where every inequality has at most two variables with nonzero coefficient. We denote this family by $LI(2)$. We show that despite of the easy…

In this paper we prove that points in the space $X(k,n)$ of configurations of $n$ points in $\mathbb{CP}^{k-1}$ which are fixed under a certain cyclic action are the solutions to the generalized scattering equations on planar kinematics…