Point sets with many $k$sets
Geza Toth
MIT
December 8,
4:15pm
refreshments at 3:45pm
2338
ABSTRACT

For any $n$, $k$, $n\ge 2k>0$, we construct a set of $n$ points in the
plane
with $ne^{\Omega\left({\sqrt{\log k}}\right)}$ $k$sets.
This improves the bounds of
Erd\H os, Lov\'asz, et al.
As a consequence, we also improve the lower bound of Edelsbrunner for
the number of halving hyperplanes in higher dimensions.

Speaker's Contact Info: toth(atsign)math.mit.edu
Return to seminar home page
Page loaded on October 19, 1999 at 05:37 PM.

Copyright © 199899, Sara C. Billey.
All rights reserved.

