On Triple Intersections of Three Families of Unit Circles

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, Simonovits, and Szabó [4]. The problem is a special instance of a more general problem studied by Elekes and Szabó [5] (and by Elekes and Rónyai [3]).

[1]  J. Pach,et al.  Combinatorial geometry , 1995, Wiley-Interscience series in discrete mathematics and optimization.

[2]  Miklós Simonovits,et al.  A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have? , 2009, Comb. Probab. Comput..

[3]  Lajos Rónyai,et al.  A Combinatorial Problem on Polynomials and Rational Functions , 2000, J. Comb. Theory, Ser. A.

[4]  Orit E. Raz,et al.  Polynomials vanishing on grids: The Elekes-Rónyai problem revisited , 2014, SoCG.

[5]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[6]  L. A. Oa,et al.  Crossing Numbers and Hard Erd} os Problems in Discrete Geometry , 1997 .

[7]  Micha Sharir,et al.  Distinct distances on two lines , 2013, J. Comb. Theory, Ser. A.

[8]  László A. Székely,et al.  Crossing Numbers and Hard Erdős Problems in Discrete Geometry , 1997, Combinatorics, Probability and Computing.

[9]  J. Milnor.  On the Betti numbers of real varieties , 1964 .

[10]  János Pach,et al.  Combinatorial Geometry , 2012 .

[11]  Orit E. Raz,et al.  Polynomials Vanishing on Cartesian Products: The Elekes-Szabó Theorem Revisited , 2015, SoCG.

[12]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[13]  Orit E. Micha József Raz,et al.  Polynomials vanishing on grids: The Elekes-Rónyai problem revisited , 2014 .

[14]  Richard Zippel,et al.  An Explicit Separation of Relativised Random Polynomial Time and Relativised Deterministic Polynomial Time , 1989, Inf. Process. Lett..

[15]  C. Wall.  Singular Points of Plane Curves , 2004 .

[16]  Micha Sharir,et al.  On the Number of Incidences Between Points and Curves , 1998, Combinatorics, Probability and Computing.

[17]  R. Thom.  Sur L'Homologie des Varietes Algebriques Réelles , 1965 .

[18]  György Elekes,et al.  How to find groups? (and how to use them in Erdős geometry?) , 2012, Comb..

[19]  Orit E. Raz,et al.  The Number of Unit-Area Triangles in the Plane: Theme and Variation , 2015, Comb..

[20]  David A. Cox,et al.  Using Algebraic Geometry , 1998 .

[21]  Micha Sharir,et al.  Distinct Distances from Three Points , 2013, Combinatorics, Probability and Computing.