pith. sign in

arxiv: math/0304462 · v1 · submitted 2003-04-28 · 🧮 math.CO

Random points, convex bodies, lattices

classification 🧮 math.CO
keywords convexpointsrandomcasesintegerpolytopepolytopeswhen
0
0 comments X
read the original abstract

Assume $K$ is a convex body in $R^d$, and $X$ is a (large) finite subset of $K$. How many convex polytopes are there whose vertices come from $X$? What is the typical shape of such a polytope? How well the largest such polytope (which is actually $\conv X$) approximates $K$? We are interested in these questions mainly in two cases. The first is when $X$ is a random sample of $n$ uniform, independent points from $K$ and is motivated by Sylvester's four-point problem, and by the theory of random polytopes. The second case is when $X=K \cap Z^d$ where $Z^d$ is the lattice of integer points in $R^d$. Motivation comes from integer programming and geometry of numbers. The two cases behave quite similarly.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.