中文

Random points, convex bodies, lattices

组合数学 2007-05-23 v1

摘要

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

关键词

引用

@article{arxiv.math/0304462,
  title  = {Random points, convex bodies, lattices},
  author = {Imre Bárány},
  journal= {arXiv preprint arXiv:math/0304462},
  year   = {2007}
}