Related papers: An arithmetic proof of John's ellipsoid theorem

This paper gives a concise proof of the Jordan curve theorem on discrete surfaces. We also embed the discrete surface in the 2D plane to prove the original version of the Jordan curve theorem. This paper is a simple version of L. Chen, Note…

It is proved that if $u_1,\ldots, u_n$ are vectors in ${\Bbb R}^k, k\le n, 1 \le p < \infty$ and $$r = ({1\over k} \sum ^n_1 |u_i|^p)^{1\over p}$$ then the volume of the symmetric convex body whose boundary functionals are $\pm u_1,\ldots,…

We prove a topological rigidity theorem for closed hypersurfaces of the Euclidean sphere and of an elliptic space form. It asserts that, under a lower bound hypothesis on the absolute value of the principal curvatures, the hypersurface is…

The Blaschke-Santal\'o Inequality is the assertion that the volume product of a centrally symmetric convex body in Euclidean space is maximized by (and only by) ellipsoids. In this paper we give a Fourier analytic proof of this fact.

We extend the notion of the smallest volume ellipsoid containing a convex body in~$\mathbb{R}^{d}$ to the setting of logarithmically concave functions. We consider a vast class of logarithmically concave functions whose superlevel sets are…

We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…

A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…

The volume charge density for a conducting ellipsoid is expressed in simple geometrical terms, and then used to obtain the known surface charge density as well as the uniform charge per length along any principal axis. Corresponding results…

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…

Let $K$ be a convex body in $\mathbb R^n$. We prove that in small codimensions, the sections of a convex body through the centroid are quite symmetric with respect to volume. As a consequence of our estimates we give a positive answer to a…

We propose a version of the volume conjecture that would relate a certain limit of the colored Jones polynomials of a knot to the volume function defined by a representation of the fundamental group of the knot complement to the special…

In this work we bring together tools and ideology from two different fields, Symplectic Geometry and Asymptotic Geometric Analysis, to arrive at some new results. Our main result is a dimension-independent bound for the symplectic capacity…

We prove that every indefinite quadratic form with non-negative integer coefficients is the volume polynomial of a pair of lattice polygons. This solves the discrete version of the Heine-Shephard problem for two bodies in the plane. As an…

This paper settles the existence question for a rather general class of convex optimal design problems with a volume constraint. In low dimensions, we prove the existence of an optimal configuration for general convex minimization problems…

We consider four problems. Rogers proved that for any convex body $K$, we can cover ${\mathbb R}^d$ by translates of $K$ of density very roughly $d\ln d$. First, we extend this result by showing that, if we are given a family of positive…

In this paper, we investigate the relationships between the volumes of four convex bodies: the cut polytope, metric polytope, rooted metric polytope, and elliptope, defined on graphs with $n$ vertices. The cut polytope is contained in each…

Minkowski's Theorem asserts that every centered measure on the sphere which is not concentrated on a great subsphere is the surface area measure of some convex body, and, moreover, the surface area measure determines a convex body uniquely.…

At the heart of convex geometry lies the observation that the volume of convex bodies behaves as a polynomial. Many geometric inequalities may be expressed in terms of the coefficients of this polynomial, called mixed volumes. Among the…

In his classical work, W. Blaschke proved that a convex body whose shadow boundaries are flat for every direction of parallel illumination must be an ellipsoid. An extension recently proposed by I. Gonzalez-Garc\'ia, J. Jer\'onimo-Castro,…

The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…