Related papers: Semi-interlaced polytopes
To determine the relative position of any two surfaces in a system, one approach is to useoperations (Minkowski sum and intersection) on sets of constraints. These constraints aremade compliant with half-spaces of R^n where each set of…
Generalizing the famous Bernstein-Kushnirenko Theorem, Khovanskii proved in 1978 a combinatorial formula for the arithmetic genus of the compactification of a generic complete intersection associated to a family of lattice polytopes.…
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)…
Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in…
We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field k of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which…
Let $\rho$ be a metric on the set $X=\{1,2,\dots,n+1\}$. Consider the $n$-dimensional polytope of functions $f:X\rightarrow \mathbb{R}$, which satisfy the conditions $f(n+1)=0$, $|f(x)-f(y)|\leq \rho(x,y)$. The question on classifying…
The degree of a lattice polytope is a notion in Ehrhart theory that was studied quite intensively over the previous years. It is well-known that a lattice polytope has normalized volume one if and only if its degree is zero. Recently,…
We initiate a study of the Euclidean Distance Degree in the context of sparse polynomials. Specifically, we consider a hypersurface f=0 defined by a polynomial f that is general given its support, such that the support contains the origin.…
We introduce a theory of volume polynomials and corresponding duality algebras of multi-fans. Any complete simplicial multi-fan $\Delta$ determines a volume polynomial $V_\Delta$ whose values are the volumes of multi-polytopes based on…
Minkowski's second theorem on successive minima gives an upper bound on the volume of a convex body in terms of its successive minima. We study the problem to generalize Minkowski's bound by replacing the volume by the lattice point…
At the heart of convex geometry lies the observation that the volume of convex bodies behaves as a polynomial. Many geometric inequalities may be expressed in terms of the coefficients of this polynomial, called mixed volumes. Among the…
Mixed volumes in $n$-dimensional Euclidean space are functionals of $n$-tuples of convex bodies $K,L,C_1,\ldots,C_{n-2}$. The Alexandrov--Fenchel inequalities are fundamental inequalities between mixed volumes of convex bodies. As very…
Given convex polytopes $P_1,...,P_r$ in $R^n$ and finite subsets $W_I$ of the Minkowsky sums $P_I=\sum_{i \in I} P_i$, we consider the quantity $N(W)=\sum_{I \subset {\bf [}r {\bf ]}} {(-1)}^{r-|I|} \big| W_I \big|$. We develop a technique…
We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…
We investigate how the Minkowski sum of two polytopes affects their graph and, in particular, their diameter. We show that the diameter of the Minkowski sum is bounded below by the diameter of each summand and above by, roughly, the product…
Approximation problems involving a single convex body in $d$-dimensional space have received a great deal of attention in the computational geometry community. In contrast, works involving multiple convex bodies are generally limited to…
Determining the number of embeddings of Laman graph frameworks is an open problem which corresponds to understanding the solutions of the resulting systems of equations. In this paper we investigate the bounds which can be obtained from the…
For a closed minimal submanifold $f:M^n\looparrowright \mathbb{S}^{N}$ in the unit sphere $(n<N)$, we prove $${\rm Vol}(M^n) \geq\frac{n+1}{n+2}\int_{M}\left( 1+\varphi_{p}^2\right) \geq m{\rm Vol}(\mathbb{S}^{n}),$$ where…
According to the Kouchnirenko formula, the Milnor number of a generic isolated singularity with given Newton polyhedron is equal to the alternating sum of certain volumes associated to the Newton polyhedron. In this paper we obtain a…
We show that for polytopes P_1, P_2, ..., P_r \subset \R^d, each having n_i \ge d+1 vertices, the Minkowski sum P_1 + P_2 + ... + P_r cannot achieve the maximum of \prod_i n_i vertices if r \ge d. This complements a recent result of Fukuda…