Abstract
Let p1, p2, p3 be three distinct points in the plane, and, for i = 1, 2, 3, let Ci be a family of n unit circles that pass through pi. We address a conjecture made by Székely, and show that the number of points incident to a circle of each family is O(n11/6), improving an earlier bound for this problem due to Elekes et al. (Comb Probab Comput 18:691–705, 2009). The problem is a special instance of a more general problem studied by Elekes and Szabó (Combinatorica 32:537–571, 2012) [and by Elekes and Rónyai (J Comb Theory Ser A 89:1–20, 2000)].
Original language | American English |
---|---|
Pages (from-to) | 930-953 |
Number of pages | 24 |
Journal | Discrete and Computational Geometry |
Volume | 54 |
Issue number | 4 |
DOIs | |
State | Published - 13 Oct 2015 |
Externally published | Yes |
Bibliographical note
Funding Information:We would like to thank an anonymous referee, whose helpful and constructive comments helped us a lot to improve the paper. Part of this research was performed while the authors were visiting the Institute for Pure and Applied Mathematics (IPAM), which is supported by the National Science Foundation. The authors deeply appreciate the stimulating environment and facilities provided by IPAM. Work on this paper by Orit E. Raz and Micha Sharir was supported by Grant 892/13 from the Israel Science Foundation. Work by Micha Sharir was also supported by Grant 2012/229 from the U.S.–Israel Binational Science Foundation, by the Israeli Centers of Research Excellence (I-CORE) program (Center No. 4/11), and by the Hermann Minkowski-MINERVA Center for Geometry at Tel Aviv University. Work by József Solymosi was supported by NSERC, ERC-AdG 321104, and OTKA NK 104183 grants.
Publisher Copyright:
© 2015, Springer Science+Business Media New York.
Keywords
- Combinatorial geometry
- Incidences
- Unit circles