Moment Varieties of Measures on Polytopes
Boris ShapiroANNALI DELLA SCUOLA NORMALE SUPERIORE DI PISA - CLASSE DI SCIENZE
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
The uniform probability measure on a convex polytope induces piecewise polynomial densities on its projections. For a fixed combinatorial type of simplicial polytopes, the moments of these measures are rational functions in the vertex coordinates. We study projective varieties that are parametrized by finite collections of such rational functions. Our focus lies on determining the prime ideals of these moment varieties. Special cases include Hankel determinantal ideals for polytopal splines on line segments, and the relations among multisymmetric functions given by the cumulants of a simplex. In general, our moment varieties are more complicated than in these two special cases. They offer challenges for both numerical and symbolic computing in algebraic geometry.
Related papers
On moments of a polytope
Analysis and Mathematical Physics
We show that the multivariate generating function of appropriately normalized moments of a measure with homogeneous polynomial density supported on a compact polytope P ⊂ R d is a rational function. Its denominator is the product of linear forms dual to the vertices of P raised to the power equal to the degree of the density function. Using this, we solve the inverse moment problem for the set of, not necessarily convex, polytopes having a given set S of vertices. Under a weak nondegeneracy assumption we also show that the uniform measure supported on any such polytope is a linear combination of uniform measures supported on simplices with vertices in S.
Moment-angle complexes and polyhedral products for convex polytopes
arXiv (Cornell University), 2010
Let P be a convex polytope not simple in general. In the focus of this paper lies a simplicial complex K P which carries complete information about the combinatorial type of P. In the case when P is simple, K P is the same as ∂P * , where P * is a polar dual polytope. Using the canonical embedding of a polytope P into nonnegative orthant R m , where m is a number of its facets, we introduce a moment-angle space Z P for a polytope P. It is known, that in the case of a simple polytope P the space Z P is homeomorphic to the moment-angle complex (D 2 , S 1) KP. When P is not simple, we prove that the space Z P is homotopically equivalent to the space (D 2 , S 1) KP. This allows to introduce bigraded Betti numbers for any convex polytope. A Stanley-Reisner ring of a polytope P can be defined as a Stanley-Reisner ring of a simplicial complex K P. All these considerations lead to a natural question: which simplicial complexes arise as K P for some polytope P ? We have proceeded in this direction by introducing a notion of a polytopic simplicial complex. It has the following property: link of each simplex in a polytopic complex is either contractible, or retractible to a subcomplex, homeomorphic to a sphere. The complex K P is a polytopic simplicial complex for any polytope P. Links of so called face simplices in a polytopic complex are polytopic complexes as well. This fact is sufficient enough to connect face polynomial of a simplicial complex K P to the face polynomial of a polytope P , giving a series of inequalities on certain combinatorial characteristics of P. Two of these inequalities are equalities for each P and represent Euler-Poincare formula and one of Bayer-Billera relations for flag f-numbers. In the case when P is simple all inequalities turn out to be classical Dehn-Sommerville relations.
The inverse moment problem for convex polytopes
2012
We present a general and novel approach for the reconstruction of any convex d-dimensional polytope P , assuming knowledge of finitely many of its integral moments. In particular, we show that the vertices of an N-vertex convex polytope in R d can be reconstructed from the knowledge of O(DN) axial moments (w.r.t. to an unknown polynomial measure of degree D), in d + 1 distinct directions in general position. Our approach is based on the collection of moment formulas due to Brion, Lawrence, Khovanskii-Pukhikov, and Barvinok that arise in the discrete geometry of polytopes, combined with what is variously known as Prony's method, or the Vandermonde factorization of finite rank Hankel matrices.
The Convex Polytopes and Homogeneous Coordinate Rings of Bivariate Polynomials
Scientific Research Journal, 2019
Concepts from algebraic geometry such as cones and fans are related to toric varieties and can be applied to determine the convex polytopes and homogeneous coordinate rings of multivariate polynomial systems. The homogeneous coordinates of a system in its projective vector space can be associated with the entries of the resultant matrix of the system under consideration. This paper presents some conditions for the homogeneous coordinates of certain system of bivariate polynomials through the construction and implementation of the Sylvester-Bèzout hybrid resultant matrix formulation. This basis of the implementation of the Bèzout block applies a combinatorial approach on a set of linear inequalities, named 5-rule. The inequalities involved the set of exponent vectors of the monomials of the system and the entries of the matrix are determined from the coefficients of facets variable known as brackets. The approach can determine the homogeneous coordinates of the given system and the e...
The moment polytope of the abelian polygon space
Topology and its Applications, 2021
The moduli space of n chains in the plane with generic side lengths that terminate on a fixed line is a smooth, closed manifold of dimension n − 1. This manifold is also equipped with a locally standard action of Z n−1 2. The orbit space of this action is a simple polytope called the moment polytope. Interestingly, this manifold is also the fixed point set of an involution on a toric manifold known as the abelian polygon space. In this article we show that the moment polytope of the moduli space of chains is completely characterized by the combinatorial data, called the short code of the length vector. We also classify aspherical chain spaces using a result of Davis, Januszkiewicz and Scott.
An Arithmetic Poisson Formula for the multi-variate resultant
Journal of Complexity, 2013
In these pages we compute the expectation of several functions of multi-variate complex polynomials. The common thread of all our outcomes is the basic technique used in their proofs. The used techniques combine essentially the unitary invariance of Bombieri-Weyl's Hermitian product and some elementary Integral Geometry. Using different combinations of these techniques we compute the expectation of the logarithm of the absolute value of an affine polynomial and we compute the expected value of Akatsuka Zeta Mahler's measure. As main consequences of these results and techniques, we show a probabilistic answer to question (d) in , concerning the complexity of one point homotopy, and an Arithmetic Poisson Formula for the multi-variate resultant. These two last statements and bounds are related to the complexity of algorithms for polynomial equation solving.
An Ehrhart polynomial for a dual polytope and the number of lattice points
IOSR Journal of Mathematics, 2012
The aim of this work is to find the Ehrhart polynomial for a certain type of a convex polytope and the Ehrhart polynomial for the dual of these polytopes together with a comparison between them; two theorems that related with the number of lattice points and the volume are also given. Different examples are presented in order to demonstrate our results.
Combinatorial Structure of the Polytope of 2-Additive Measures
IEEE Transactions on Fuzzy Systems, 2019
In this paper we study the polytope of 2-additive measures, an important subpolytope of the polytope of fuzzy measures. For this polytope, we obtain its combinatorial structure, namely the adjacency structure and the structure of 2-dimensional faces, 3-dimensional faces, and so on. Basing on this information, we build a triangulation of this polytope satisfying that all simplices in the triangulation have the same volume. As a consequence, this allows a very simple and appealing way to generate points in a random way in this polytope, an interesting problem arising in the practical identification of 2-additive measures. Finally, we also derive the volume, the centroid, and some properties concerning the adjacency graph of this polytope.
The null set of a polytope, and the Pompeiu property for polytopes
Cornell University - arXiv, 2021
We study the null set N (P) of the Fourier-Laplace transform of a polytope P ⊂ R d , and we find that N (P) does not contain (almost all) circles in R d. As a consequence, the null set does not contain the algebraic varieties {z ∈ C d | z 2 1 + • • • + z 2 d = α 2 } for each fixed α ∈ C, and hence we get an explicit proof that the Pompeiu property is true for all polytopes. Our proof uses the Brion-Barvinok theorem, which gives a concrete formulation for the Fourier-Laplace transform of a polytope, and it also uses properties of Bessel functions. The original proof that polytopes (as well as other bodies) possess the Pompeiu property was given by Brown, Schreiber, and Taylor [7] for dimension 2. Williams [14, p. 184] later observed that the same proof also works for d > 2 and, using eigenvalues of the Laplacian, gave another proof valid for d ≥ 2 that polytopes have the Pompeiu property.
Related topics
Related papers
Effective lattice point counting in rational convex polytopes
Journal of Symbolic Computation, 2004
This paper discusses algorithms and software for the enumeration of all lattice points inside a rational convex polytope: we describe LattE, a computer package for lattice point enumeration which contains the first implementation of A. Barvinok's algorithm (Math. Oper. Res. 19 (1994)
Polyhedra and polytopes: algebra and combinatorics
Contemporary Mathematics, 2006
Universal counting of lattice points in polytopes
Arxiv preprint math/9905109, 1999
On lattice point counting in Δ-modular polyhedra
arXiv (Cornell University), 2020
Let a polyhedron P be defined by one of the following ways: (i) P = {x ∈ R n : Ax ≤ b}, where A ∈ Z (n+k)×n , b ∈ Z (n+k) and rank A = n, (ii) P = {x ∈ R n + : Ax = b}, where A ∈ Z k×n , b ∈ Z k and rank A = k, and let all rank order minors of A be bounded by ∆ in absolute values. We show that the short rational generating function for the power series m∈P ∩Z n x m can be computed with the arithmetical complexity O T SNF (d) • d k • d log 2 ∆ , where k and ∆ are fixed, d = dim P , and T SNF (m) is the complexity of computing the Smith Normal Form for m × m integer matrices. In particular, d = n, for the case (i), and d = n − k, for the case (ii). The simplest examples of polyhedra that meet the conditions (i) or (ii) are the simplices, the subset sum polytope and the knapsack or multidimensional knapsack polytopes. Previously, the existence of a polynomial time algorithm in varying dimension for the considered class of problems was unknown already for simplicies (k = 1). We apply these results to parametric polytopes and show that the step polynomial representation of the function c P (y) = |P y ∩ Z n |, where P y is a parametric polytope, whose structure is close to the cases (i) or (ii), can be computed in polynomial time even if the dimension of P y is not fixed. As
Representing polynomials by positive linear functions on compact convex polyhedra
Pacific Journal of Mathematics, 1988
Algebraic vertices of non-convex polyhedra
Advances in Mathematics, 2017
In this article we define an algebraic vertex of a generalized polyhedron and show that the set of algebraic vertices is the smallest set of points needed to define the polyhedron. We prove that the indicator function of a generalized polytope P is a linear combination of indicator functions of simplices whose vertices are algebraic vertices of P. We also show that the indicator function of any generalized polyhedron is a linear combination, with integer coefficients, of indicator functions of cones with apices at algebraic vertices and line-cones. The concept of an algebraic vertex is closely related to the Fourier-Laplace transform. We show that a point v is an algebraic vertex of a generalized polyhedron P if and only if the tangent cone of P , at v, has non-zero Fourier-Laplace transform.
On the genera of moment-angle manifolds associated to dual-neighborly polytopes, combinatorial formulas and sequences
arXiv: Geometric Topology, 2020
For a family of polytopes of even dimension $2p$, known as \textit{dual-neighborly}, it has been shown for $p\ne 2$ that the associated intersection of quadrics is a connected sum of sphere products $S^p\times S^p$. In this article we give formulas for the number of terms in that connected sum. Certain combinatorial operations produce new polytopes whose associated intersections are also connected sums of sphere products and we give also formulas for their number. These include a large amount of simple polytopes, including many odd-dimensional ones.
Counting Integer Points of Flow Polytopes
Discrete & Computational Geometry, 2021
The Baldoni–Vergne volume and Ehrhart polynomial formulas for flow polytopes are significant in at least two ways. On one hand, these formulas are in terms of Kostant partition functions, connecting flow polytopes to this classical vector partition function, fundamental in representation theory. On the other hand, the Ehrhart polynomials can be read off from the volume functions of flow polytopes. The latter is remarkable since the leading term of the Ehrhart polynomial of an integer polytope is its volume! Baldoni and Vergne proved these formulas via residues. To reveal the geometry of these formulas, the second author and Morales gave a fully geometric proof for the volume formula and a partial generating function proof for the Ehrhart polynomial formula. The goal of the present paper is to provide a fully geometric proof for the Ehrhart polynomial formula for flow polytopes.
Weighted Lattice Point Sums in Lattice Polytopes, Unifying Dehn–Sommerville and Ehrhart–Macdonald
Discrete & Computational Geometry
Let V be a real vector space of dimension n and let M ⊂ V be a lattice. Let P ⊂ V be an n-dimensional polytope with vertices in M , and let ϕ : V → C be a homogeneous polynomial function of degree d. For q ∈ Z >0 and any face F of P , let D ϕ,F (q) be the sum of ϕ over the lattice points in the dilate qF. We define a generating function G ϕ (q, y) ∈ Q[q][y] packaging together the various D ϕ,F (q), and show that it satisfies a functional equation that simultaneously generalizes Ehrhart-Macdonald reciprocity and the Dehn-Sommerville relations. When P is a simple lattice polytope (i.e., each vertex meets n edges), we show how G ϕ can be computed using an analogue of Brion-Vergne's Euler-Maclaurin summation formula. (For instance, if P is a simplex, then h(P, t) = t n + t n−1 + • • • + 1.) The Dehn-Sommerville relations say that h k (P) = h n−k (P) for all k.
Möbius Polynomials of Face Posets of Convex Polytopes
Communications in Algebra, 2016
The Möbius polynomial is an invariant of ranked posets, closely related to the Möbius function. In this paper, we study the Möbius polynomial of face posets of convex polytopes. We present formulas for computing the Möbius polynomial of the face poset of a pyramid or a prism over an existing polytope, or of the gluing of two or more polytopes in terms of the Möbius polynomials of the original polytopes. We also present general formulas for calculating Möbius polynomials of face posets of simplicial polytopes and of Eulerian posets in terms of their f -vectors and some additional constraints.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.