Related papers: Multivariate Splines and Polytopes
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…
Using appropriate power series evaluations, we determine all moments of arbitrary positive powers of the arcsine. As consequences we evaluate several doubly infinite classes of power series involving central binomial coefficients and…
The univariate Ehrhart and $h^*$-polynomials of lattice polytopes have been widely studied. We describe methods from toric geometry for computing multivariate versions of volume, Ehrhart and $h^*$-polynomials of lattice polytropes, which…
We prove genuinely multilinear weighted estimates for singular integrals in product spaces. The estimates complete the qualitative weighted theory in this setting. Such estimates were previously known only in the one-parameter situation.…
Given an $n$-dimensional convex body by a membership oracle in general, it is known that any polynomial-time deterministic algorithm cannot approximate its volume within ratio $(n/\log n)^n$. There is a substantial progress on randomized…
We have obtained an exact expression for the phase-space volume corresponding to a microcanonical ensemble of systems under center of mass, total linear and angular momenta conservation constraints, and arbitrary constraints on the…
We give upper bounds for volume of sublevel sets of real polynomials. Our method is to combine a version of global Lojasiewicz inequality with some well known estimate on volume of tubes around real algebraic sets. Some applications to…
For a given convex body K in $R^d$, a random polytope $K^{(n)}$ is defined (essentially) as the intersection of $n$ independent closed halfspaces containing $K$ and having an isotropic and (in a specified sense) uniform distribution. We…
We present an explicit closed-form formula for the vertices of the classical cut polytope $\operatorname{CUT}(n)$, defined as the convex hull of cut vectors of the complete graph $K_n$. Our derivation proceeds via a related polytope,…
We introduce the M-representation of polytopes, which makes it possible to compute linear transformations, convex hulls, and Minkowski sums with linear complexity in the dimension of the polytopes. When the polytope is a convex hull of a…
This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.
In this note we continue the exploration of the polytope picture for scattering amplitudes, where amplitudes are associated with the volumes of polytopes in generalized momentum-twistor spaces. After a quick warm-up example illustrating the…
We prove that the Ehrhart polynomial of a zonotope is a specialization of the multiplicity Tutte polynomial. We derive some formulae for the volume and the number of integer points of the zonotope.
Volume is a natural geometric measure for comparing polyhedral relaxations of non-convex sets. Speakman and Lee gave volume formulae for comparing relaxations of trilinear monomials, quantifying the strength of various natural relaxations.…
It is proven that the volume of an infinitesimally flexible polyhedron in $R^3$ is a multiple root of its volume polynomial.
This work studies numerical integration by the M\"obius-transformed trapezoidal rule, which combines the classical trapezoidal rule with a change of variables induced by a M\"obius transformation that maps the unit circle onto the real…
The theory of intrinsic volumes of convex cones has recently found striking applications in areas such as convex optimization and compressive sensing. This article provides a self-contained account of the combinatorial theory of intrinsic…
We explore systems of polynomial equations where we seek complex solutions with absolute value 1. Geometrically, this amounts to understanding intersections of algebraic varieties with tori -- Cartesian powers of the unit circle. We study…
The BKK theorem states that the mixed volume of the Newton polytopes of a system of polynomial equations upper bounds the number of isolated torus solutions of the system. Homotopy continuation solvers make use of this fact to pick…
We introduce a general class of symmetric polynomials that have saturated Newton polytope and their Newton polytope has integer decomposition property. The class covers numerous previously studied symmetric polynomials.