Related papers: Multivariate Splines and Polytopes
We study the problem of approximating the mixed volume $V(P_1^{(\alpha_1)}, \dots, P_k^{(\alpha_k)})$ of an $k$-tuple of convex polytopes $(P_1, \dots, P_k)$, each of which is defined as the convex hull of at most $m_0$ points in…
We give a deterministic polynomial-time approximation scheme (FPTAS) for the volume of the truncated fractional matching polytope for graphs of maximum degree $\Delta$, where the truncation is by restricting each variable to the interval…
We present a change of basis that may allow more efficient calculation of the volumes of Birkhoff polytopes using a slicing method. We construct the basis from a special set of square matrices. We explain how to construct this basis easily…
We give a closed formula for the volume of a two-bridge knot, more precisely for its Bloch invariant. We obtain this formula without triangulating the complement: instead, we derive it from the Hopf formula for the second homology of the…
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…
Motivated by understanding the quality of tractable convex relaxations of intractable polytopes, Ko et al. gave a closed-form expression for the volume of a standard relaxation $\mathscr{Q}(G)$ of the boolean quadric polytope (also known as…
We study bracketing covering numbers for spaces of bounded convex functions in the $L_p$ norms. Bracketing numbers are crucial quantities for understanding asymptotic behavior for many statistical nonparametric estimators. Bracketing number…
Using the celebrated Morris Constant Term Identity, we deduce a recent conjecture of Chan, Robbins, and Yuen (math.CO/9810154), that asserts that the volume of a certain $n(n-1)/2$-dimensional polytope is given by the product of the first…
We consider the problem of estimating the multiplicity of a polynomial when restricted to the smooth analytic trajectory of a (possibly singular) polynomial vector field at a given point or points, under an assumption known as the…
For a convex body $K \subset {\mathbb R}^n$, let $K^z = \{y\in{\mathbb R}^n : \langle y-z, x-z\rangle\le 1, \mbox{\ for all\ } x\in K\}$ be the polar body of $K$ with respect to the center of polarity $z \in {\mathbb R}^n$. The goal of this…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
Recently, the properties of a binomial sum related to the multi-link inverted pendulum enumeration problem have been studied. In this note, we establish bounds for this binomial sum.
In these notes, we explain residue formulae for volumes of convex polytopes, and for Ehrahrt polynomials based on the notion of total residue. We apply this method to the computation of the volume of the Chan-Robbins polytope. The final…
We define and study the dual mixed volume rational function of a sequence of polytopes, a dual version of the mixed volume polynomial. This concept has direct relations to the adjoint polynomials and the canonical forms of polytopes. We…
We extend to Barvinok's valuations the Euler-Maclaurin expansion formula which we obtained previously for the sum of values of a polynomial over the integral points of a rational polytope. This leads to an improvement of Barvinok's…
Our aim in this article is to compute the mixed volume of a matroid. We give two computations. The first one is based on the integration formula for complete fans given by Brion. The second computation is a step-by-step method using…
Several problems in computer algebra can be efficiently solved by reducing them to calculations over finite fields. In this paper, we describe an algorithm for the reconstruction of multivariate polynomials and rational functions from their…
The problem of simultaneous decomposition of binary forms as sums of powers of linear forms is studied. For generic forms the minimal number of linear forms needed is found and the space parametrizing all the possible decompositions is…
The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…
The tree-width of a multivariate polynomial is the tree-width of the hypergraph with hyperedges corresponding to its terms. Multivariate polynomials of bounded tree-width have been studied by Makowsky and Meer as a new sparsity condition…