Related papers: Multivariate Splines and Polytopes
We overview the volume calculations for polyhedra in Euclidean, spherical and hyperbolic spaces. We prove the Sforza formula for the volume of an arbitrary tetrahedron in $H^3$ and $S^3$. We also present some results, which provide a…
In their seminal paper, Berman and Boucksom exploited ideas from complex geometry to analyze asymptotics of spaces of holomorphic sections of tensor powers of certain line bundles $L$ over compact, complex manifolds as the power grows. This…
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…
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…
A theorem of Kushnirenko and Bernstein shows that the number of isolated roots of a system of polynomials in a torus is bounded above by the mixed volume of the Newton polytopes of the given polynomials, and this upper bound is generically…
We consider the problem of uniform interpolation of functions with values in a complex inner product space of finite dimension. This problem can be casted within a modified weighted pluripotential theoretic framework. Indeed, in the…
We experimentally study the fundamental problem of computing the volume of a convex polytope given as an intersection of linear inequalities. We implement and evaluate practical randomized algorithms for accurately approximating the…
We focus on computing certified upper bounds for the positive maximal singular value (PMSV) of a given matrix. The PMSV problem boils down to maximizing a quadratic polynomial on the intersection of the unit sphere and the nonnegative…
In this paper, we develop a method of evaluating general exponential sums with rational amplitude functions for multiple variables which complements works by T. Cochrane and Z. Zheng on the single variable case. As an application, for…
A celebrated theorem of Balas gives a linear mixed-integer formulation for the union of two nonempty polytopes whose relaxation gives the convex hull of this union. The number of inequalities in Balas formulation is linear in the number of…
We study properties of the volume of projections of the $n$-dimensional cross-polytope $\crosp^n = \{ x \in \R^n \mid |x_1| + \dots + |x_n| \leqslant 1\}.$ We prove that the projection of $\crosp^n$ onto a $k$-dimensional coordinate…
Lattice polytope representation of natural numbers is introduced based on the fundamental theorem of arithmetic. The combinatorial and geometric properties of the polytopes are studied using Polymake and Qhull software. The volume of the…
We study a family of polytopes and their duals, that appear in various optimization problems as the unit balls for certain norms. These two families interpolate between the hypercube, the unit ball for the $\infty$-norm, and its dual…
The concept of a composed product for univariate polynomials has been explored extensively by Brawley, Brown, Carlitz, Gao, Mills, et al. Starting with these fundamental ideas and utilizing fractional power series representation (in…
The Minkowski mixed volume of $n$ subpolytopes $D_1, \dots, D_n$ of a polytope $P \subset {\mathbb R}^n$ clearly does not exceed the normalized volume $n! \text{Vol}(P)$. Equality holds if and only if the subpolytopes are interlaced, i.e.,…
The divisibility of truncated binomial series by their exponent n is analyzed. Divisibility is shown to depends on the divisibility characteristics of the integers constituting the binomials. Series division by the highest possible powers…
We describe a new approach to the Schubert calculus on complete flag varieties using the volume polynomial associated with Gelfand-Zetlin polytopes. This approach allows us to compute the intersection products of Schubert cycles by…
The Sequential Multiple Knapsack Problem is a special case of Multiple knapsack problem in which the items sizes are divisible. A characterization of the optimal solutions of the problem and a description of the convex hull of all the…
We consider min-max optimization problems for polynomial functions, where a multivariate polynomial is maximized with respect to a subset of variables, and the resulting maximal value is minimized with respect to the remaining variables.…
Up to a factor 1/n!, the volume of a big line bundle agrees with the Euclidean volume of its Okounkov body. The latter is the convex hull of top rank valuation vectors of sections, all with respect to a single flag. In this text we give a…