Random points, convex bodies, lattices
Imre Bárány
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.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.