How to find groups? (and how to use them in Erdős geometry?)


Geometric questions which involve Euclidean distances often lead to polynomial relations of type F(x, y, z)=0 for some F ∈ ℝ[x, y, z]. Several problems of Combinatorial Geometry can be reduced to studying such polynomials which have many zeroes on n×n×n Cartesian products. The special case when the relation F = 0 can be re-written as z = f(x, y), for a polynomial or rational function f ∈ ℝ(x, y), was considered in [8]. Our main goal is to extend the results found there to full generality (and also to show some geometric applications, e.g. one on “circle grids”).

The main result of our paper concerns low-degree algebraic sets F which contain “too many” points of a (large) n×n×n Cartesian product. Then we can conclude that, in a neighborhood of almost any point, the set F must have a very special (and very simple) form. More precisely, then either F is a cylinder over some curve, or we find a group behind the scene: F must be the image of the graph of the multiplication function of an appropriate algebraic group (see Theorem 3 for the 3D special case and Theorem 27 in full generality).

This is a preview of subscription content, access via your institution.


  1. [1]

    P. Brass and C. Knauer: On counting point-hyperplane incidences, Comput. Geom. Theory Appl. 25(12) (2003), 13–20.

    MathSciNet  MATH  Article  Google Scholar 

  2. [2]

    B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir: A singly-exponential stratification scheme for real semi-algebraic varieties and its applications, Theoretical Computer Science 84 (1991), 77–105.

    MATH  Article  Google Scholar 

  3. [3]

    Gy. Elekes: Circle grids and bipartite graphs of distances, Combinatorica 15 (1995), 167–174.

    MathSciNet  MATH  Article  Google Scholar 

  4. [4]

    Gy. Elekes: On the number of sums and products, Acta Arithmetica LXXXI.4 (1997), 365–367.

    MathSciNet  Google Scholar 

  5. [5]

    Gy. Elekes. Sums versus products in number theory, algebra and Erdős geometry, Paul Erdős and his mathematics, II (Budapest, 1999), Bolyai Soc. Math. Stud. 11, János Bolyai Math. Soc., Budapest, 2002, 241–290.

    Google Scholar 

  6. [6]

    P. Erdős, L. Lovász, and K. Vesztergombi: On graphs of large distances, Discrete and Computational Geometry 4 (1989), 541–549.

    MathSciNet  Article  Google Scholar 

  7. [7]

    Gy. Elekes, M. B. Nathanson, and I. Z. Ruzsa: Convexity and sumsets, Journal of Number Theory 83 (1999), 194–201.

    MathSciNet  Article  Google Scholar 

  8. [8]

    Gy. Elekes and L. Rónyai: A combinatorial problem on polynomials and rational functions, Journal of Combinatorial Theory, series A 89 (2000), 1–20.

    MathSciNet  MATH  Article  Google Scholar 

  9. [9]

    M. Gromov: Groups of polynomial growth and expanding maps, Publ. Math., Inst. Hautes Étud. Sci. 53 (1981), 53–78.

    MathSciNet  MATH  Article  Google Scholar 

  10. [10]

    J. Harris: Algebraic geometry: A first course, Springer-Verlag, New York, 1992.

    Google Scholar 

  11. [11]

    F. Hirzebruch: Singularities of algebraic surfaces and characteristic numbers, Contemp. Math. 58 (1986), 141–155.

    MathSciNet  Article  Google Scholar 

  12. [12]

    E. Hrushovski: Contributions to stable model theory, PhD thesis, University of California, Berkeley, 1986.

    Google Scholar 

  13. [13]

    N. Jacobson: Lectures in abstract algebra, III. Theory of fields and Galois theory, University Series in Higher Mathematics, Van Nostrand Reinhold Co., 1964.

  14. [14]

    J. Kollár: Rational Curves on Algebraic Varieties, Springer, Berlin, 1996.

    Google Scholar 

  15. [15]

    J. Matoušek: Lectures on Discrete Geometry, Springer-Verlag, Berlin, Heidelberg, New York, 2002.

    Google Scholar 

  16. [16]

    G. Megyesi and E. Szabó: On the tacnodes of configurations of conics in the projective plane, Mathematische Annalen 305 (1996), 693–703.

    MathSciNet  MATH  Article  Google Scholar 

  17. [17]

    A. L. Onishchik and E. B. Vinberg: Lie groups and algebraic groups, Springer, Berlin, 1990.

    Google Scholar 

  18. [18]

    A. Pillay: Geometric Stability Theory, volume 32 of Oxford Logic Guides, Clarendon Press, Oxford, 1996.

    Google Scholar 

  19. [19]

    J. Pach and M. Sharir: On the number of incidences between points and curves, Combinatorics, Probability and Computing 7 (1998), 121–127.

    MathSciNet  MATH  Article  Google Scholar 

  20. [20]

    E. Szemerédi and W. T. Trotter Jr.: Extremal problems in Discrete Geometry, Combinatorica 3(3–4) (1983), 381–392.

    MathSciNet  MATH  Article  Google Scholar 

  21. [21]

    A. Weil: On algebraic groups and homogeneous spaces, American Journal of Mathematics 77 (1955), 493–512.

    MathSciNet  MATH  Article  Google Scholar 

  22. [22]

    A. Weil: On algebraic groups of transformations, American Journal of Mathematics 77 (1955), 355–391.

    MathSciNet  MATH  Article  Google Scholar 

Download references

Author information



Corresponding author

Correspondence to Endre Szabó.

Additional information

Dedicated to the memory of Paul Erdős.

Research partially supported by OTKA grants T 42750 and T 47056

Research partially supported by OTKA grants K84233 and NK81203

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Elekes, G., Szabó, E. How to find groups? (and how to use them in Erdős geometry?). Combinatorica 32, 537–571 (2012).

Download citation

Mathematics Subject Classification (2000)

  • 05A16
  • 14N10