11 research outputs found
The inverse moment problem for convex polytopes
The goal of this paper is to present a general and novel approach for the
reconstruction of any convex d-dimensional polytope P, from knowledge of its
moments. In particular, we show that the vertices of an N-vertex polytope in
R^d can be reconstructed from the knowledge of O(DN) axial moments (w.r.t. to
an unknown polynomial measure od degree D) in d+1 distinct generic directions.
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, and what variously known as Prony's method, or Vandermonde
factorization of finite rank Hankel matrices.Comment: LaTeX2e, 24 pages including 1 appendi
Valuations on lattice polytopes
This survey is on classification results for valuations defined on lattice polytopes that intertwine the special linear group over the integers. The basic real valued valuations, the coefficients of the Ehrhart polynomial, are introduced and their characterization by Betke and Kneser is discussed. More recent results include classification theorems for vector and convex body valued valuations. © Springer International Publishing AG 2017