Random points, convex bodies, lattices
Abstract
Assume K is a convex body in Rd, 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 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 Zd where Zd is the lattice of integer points in Rd. Motivation comes from integer programming and geometry of numbers. The two cases behave quite similarly.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.