ABSTRACT
We present new bounds on the first selection lemma in ℜ3. This makes progress on the open problems of Bukh, Matouaek and Nivash [6] and Boros-Füredi [4] for the three-dimensional case, improving the previously best result of Wagner [8]. While our results narrow the gap between the current best lower and upper bounds, they do not settle this question. However, they indicate that it is the current lower-bounds that are not tight, and we conjecture that the lower-bounds can be further improved to match the current upper bound.
- N. Alon, I. Bárány, Z. Füredi, and D. J. Kleitman. Point selections and weak e-nets for convex hulls. Combinatorics, Probability & Computing, 1:189--200, 1992.Google ScholarCross Ref
- N. Alon and D. Kleitman. Piercing convex sets and the hadwiger debrunner (p, q)-problem. Adv. Math., 96(1):103--112, 1992.Google ScholarCross Ref
- I. Barany. A generalization of caratheodory's theorem. Discrete Math., 40:189--200, 1982.Google ScholarDigital Library
- E. Boros and Z. Furedi. The number of triangles covering the center of an n-set. Geometriae Dedicata, 17(1):69--77, 1984.Google ScholarCross Ref
- B. Bukh. A point in many triangles. Electronic Journal of Combinatorics, 13(10), 2006.Google Scholar
- B. Bukh, M. Matousek, and G. Nivasch. Stabbing simplices by points and flats. http://arxiv.org/abs/0804.4464, 2008. Google ScholarDigital Library
- J. Matousek. Lectures in Discrete Geometry. Springer-Verlag, New York, NY, 2002. Google ScholarDigital Library
- U. Wagner. On k-Sets and Applications. PhD thesis, ETH Zurich, 2003.Google Scholar
Index Terms
- Improving the first selection lemma in R3
Recommendations
A proof of the Oja depth conjecture in the plane
Given a set P of n points in the plane, the Oja depth of a point x R 2 is defined to be the sum of the areas of all triangles defined by x and two points from P, normalized with respect to the area of the convex hull of P. The Oja depth of P is the ...
A polytopal generalization of Sperner's lemma
We prove the following conjecture of Atanassov (Studia Sci. Math. Hungar. 32 (1996), 71-74). Let T be a triangulation of a d-dimensional polytope P with n vertices v1, v2,...., vn. Label the vertices of T by 1,2,..., n in such a way that a vertex of T ...
A Unifying Note on Fatou's Lemma in Several Dimensions
A general version of Fatou's lemma in several dimensions is presented. It subsumes the Fatou lemmas given by Schmeidler Schmeidler, D. 1970. Fatou's lemma in several dimensions. Proc. Amer. Math. Soc.24 300--306., Hildenbrand Hildenbrand, W. 1974. Core ...
Comments