Related papers: The inverse moment problem for convex polytopes

We present a formula that expresses the Hankel determinants of a linear combination of length $d+1$ of moments of orthogonal polynomials in terms of a $d\times d$ determinant of the orthogonal polynomials. This formula exists somehow hidden…

We give explicit formulas as well as a quadratic time algorithm to solve (so called) generalized Vandermonde's systems of p linear equations and n variables. It allows in particular to find all (so called Lagrange's) interpolation polynoms…

In two dimensions, we consider the problem of reconstructing a vector field from partial knowledge of its zeroth and first moment ray transforms. Different from existing works the data is known on a subset of lines, namely the ones…

We address the classical inverse problem of recovering the position and shape of obstacles immersed in a planar Stokes flow using boundary measurements. We prove that this problem can be transformed into a shape-from-moments problem to…

The problem of calculating exact lower bounds for the number of $k$-faces of $d$-polytopes with $n$ vertices, for each value of $k$, and characterising the minimisers, has recently been solved for $n\le2d$. We establish the corresponding…

Any integral convex polytope $P$ in $\mathbb{R}^N$ provides a $N$-dimensional toric variety $X_P$ and an ample divisor $D_P$ on this variety. This paper gives an explicit construction of the algebraic geometric error-correcting code on…

The distance between convex bodies \(K, L \subseteq \R^n\) is defined as \[ d(K,L)= \inf \left\{ \lambda \ge 1: \ L-x \subseteq T (K-y) \subseteq \lambda (L-x) \right\}, \] where the infimum is taken over all \(x,y \in \R^n\) and all…

We solve an inverse initial data problem for the incompressible Navier-Stokes system. The objective is to recover the initial velocity and pressure from lateral boundary observations, without assuming that the time-independent body force is…

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…

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…

In this paper we show how to construct inner and outer convex approximations of a polytope from an approximate cone factorization of its slack matrix. This provides a robust generalization of the famous result of Yannakakis that polyhedral…

In this paper, a new method to compute a B\'ezier curve of degree n = 2m-1 is introduced, here formulated as a set of points whose coordinates are calculated from two Hankel forms in $\C^m$. From Vandermonde factorizations of the two…

We present two theorems describing analytic left-inverses of partial X-ray transforms. The first theorem concerns X-ray data collected with an arbitrary distribution of parallel projections; it contains a convolution-backprojection formula…

In this paper, we investigate the sample size requirement for exact recovery of a high order tensor of low rank from a subset of its entries. We show that a gradient descent algorithm with initial value obtained from a spectral method can,…

We treat the following "polynomial moment problem": for a complex polynomial P(z) and distinct complex numbers a,b such that P(a)=P(b) to describe polynomials q(z)=Q'(z) orthogonal to all degrees of P(z) on the segment [a,b]. We show that…

Denoting by $P_N(A,\theta)=\det(I-Ae^{-i\theta})$ the characteristic polynomial on the unit circle in the complex plane of an $N\times N$ random unitary matrix $A$, we calculate the $k$th moment, defined with respect to an average over…

This paper is concerned with the detection of objects immersed in anisotropic media from boundary measurements. We propose an accurate approach based on the Kohn-Vogelius formulation and the topological sensitivity analysis method. The…

The non-convex quadratic orogramming problem and the non-monotone linear complementarity problem are NP-complete problems. In this paper we first show taht the inverse problem of determinning a KKT point of the non-convex quadratic…

We present a general framework to study uniqueness, stability and reconstruction for infinite-dimensional inverse problems when only a finite-dimensional approximation of the measurements is available. For a large class of inverse problems…

Let K be a convex body in $R^d$. A random polytope is the convex hull $[x_1,...,x_n]$ of finitely many points chosen at random in K. $\Bbb E(K,n)$ is the expectation of the volume of a random polytope of n randomly chosen points. I.…