Related papers: Multivariate Splines and Polytopes
We provide a streamlined proof and improved estimates for the weak multivariate Gnedenko law of large numbers on concentration of random polytopes within the space of convex bodies (in a fixed or a high dimensional setting), as well as a…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
We present simple and stable formulas for computing power (including absorbed/radiated, scattered and extinction power) in current-based volume integral equation formulations. The proposed formulas are given in terms of vector-matrix-vector…
In this paper we derive an upper bound for the degree of the strict invariant algebraic curve of a polynomial system in the complex project plane under generic condition. The results are obtained through the algebraic multiplicities of the…
The random polytope $K_n$, defined as the convex hull of $n$ points chosen uniformly at random on the boundary of a smooth convex body, is considered. Proofs for lower and upper variance bounds, strong laws of large numbers and central…
We prove that each bounded polytope can be represented as a polynomial zonotope, which we refer to as the Z-representation of polytopes. Previous representations are the vertex representation (V-representation) and the halfspace…
This note is a comment to the paper by D.R.Heath-Brown and B.Z.Moroz (Math Proc. Camb. Phil. Soc. 125 (1999)). That paper concerns with the projective surface $S$ in $\mathbb{P}^{3}$ defined by the equation $x_{1}x_{2}x_{3}=x_{4}^{3}$. It…
The free sum is a basic geometric operation among convex polytopes. This note focuses on the relationship between the normalized volume of the free sum and that of the summands. In particular, we show that the normalized volume of the free…
The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…
In this work, we find an explicit expression for the volume of the trace nonnegative polytope via a generalization of the Irwin-Hall distribution. This volume is an upper bound for the volume of all projected, normalized realizable spectra.…
Several theorems on the volume computing of the polyhedron spanned by a n-dimensional vector set with the finite-interval parameters are presented and proved firstly, and then are used in the analysis of the controllable regions of the…
We consider the following problem: given a program, find tight asymptotic bounds on the values of some variables at the end of the computation (or at any given program point) in terms of its input values. We focus on the case of…
A new intrinsic volume metric is introduced for the class of convex bodies in $\mathbb{R}^n$. As an application, an inequality is proved for the asymptotic best approximation of the Euclidean unit ball by arbitrarily positioned polytopes…
Over finite fields, if the image of a polynomial map is not the entire field, then its cardinality can be bounded above by a significantly smaller value. Earlier results bound the cardinality of the value set using the degree of the…
In this paper, we investigate the problem of finding tight linear lower bounding functions for multivariate polynomials over boxes. These functions are obtained by the expansion of polynomials into Bernstein form and using the linear least…
There are already quite a few tools for solving the Satisfiability Modulo Theories (SMT) problems. In this paper, we present \texttt{VolCE}, a tool for counting the solutions of SMT constraints, or in other words, for computing the volume…
The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…
We provide a manifestly positive expression for the volume of the moduli spaces of flat $\mathrm{U}(n)$-valued connections on punctured compact oriented surfaces. This volume is obtained by summing volumes of explicit polytopes describing…
The normalized volume of the Chan-Robbins-Yuen polytope ($CRY_n$) is the product of consecutive Catalan numbers. The polytope $CRY_n$ has captivated combinatorial audiences for over a decade, as there is no combinatorial proof for its…
We show how higher-genus su(N) fusion multiplicities may be computed as the discretized volumes of certain polytopes. The method is illustrated by explicit analyses of some su(3) and su(4) fusions, but applies to all higher-point and…