An Incidence Theorem in Higher Dimensions
- First Online:
- Cite this article as:
- Solymosi, J. & Tao, T. Discrete Comput Geom (2012) 48: 255. doi:10.1007/s00454-012-9420-x
- 358 Downloads
We prove almost tight bounds on the number of incidences between points and k-dimensional varieties of bounded degree in Rd. Our main tools are the polynomial ham sandwich theorem and induction on both the dimension and the number of points.