Abstract
We give an overview of recent progress around a problem introduced by Elekes and Rónyai. The prototype problem is to show that a polynomial \(f\in \mathbb R[x,y]\) has a large image on a Cartesian product \(A\times B\subset \mathbb R^2\), unless f has a group-related special form. We discuss this problem and a number of variants and generalizations. This includes the Elekes-Szabó problem, which generalizes the Elekes-Rónyai problem to a question about an upper bound on the intersection of an algebraic surface with a Cartesian product, and curve variants, where we ask the same questions for Cartesian products of finite subsets of algebraic curves. These problems lie at the crossroads of combinatorics, algebra, and geometry: They ask combinatorial questions about algebraic objects, whose answers turn out to have applications to geometric questions involving basic objects like distances, lines, and circles, as well as to sum-product-type questions from additive combinatorics. As part of a recent surge of algebraic techniques in combinatorial geometry, a number of quantitative and qualitative steps have been made within this framework. Nevertheless, many tantalizing open questions remain.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The result in [28, Proposition 8.3] has the same proof setup as [47], but it appears to be somewhat isolated; it makes no reference to [17], and in turn is not referred to in [43, 47]. This may be because [28] primarily concerns expansion bounds over finite fields. The arXiv publication date of [47] is half a year before that of [28].
- 2.
The maximum of the degrees of the numerator and denominator, assuming that these do not have a common factor.
- 3.
- 4.
A preprint version of [26] became available in 2010.
- 5.
- 6.
The word “grid” is often used in this context, but may lead to confusion with integer grids.
- 7.
We write Z(F) for the zero set of a polynomial F, i.e., the set of points at which F vanishes.
- 8.
- 9.
- 10.
- 11.
This is a special case of a more general object from category theory; what we call a fiber product here is sometimes called a set-theoretic fiber product, or also a relative product.
- 12.
As in Sect. 1.3, \(D(p,q) = (p_x-q_x)^2+(p_y-q_y)^2\) is the squared Euclidean distance function.
- 13.
We say that two curves are linearly equivalent if there is a linear transformation \((x,y)\mapsto (ax+by,cx+dy)\) that gives a bijection between the point sets of the curves.
- 14.
This brings into question if “Schwartz–Zippel” is the right name, but it has become standard in combinatorics.
References
E. Aksoy Yazici, B. Murphy, M. Rudnev, I. Shkredov, Growth estimates in positive characteristic via collisions. International Mathematics Research Notices, 2017(23), 7148–7189 (1 December 2017), arXiv:1512.06613
J. Beck, On the lattice property of the plane and some problems of Dirac, Motzkin, and Erdős in combinatorial geometry. Combinatorica 3, 281–297 (1983)
J. Bourgain, More on the sum-product phenomenon in prime fields and its applications. Int. J. Number Theory 1, 1–32 (2005)
J. Bourgain, N. Katz, T. Tao, A sum-product estimate in finite fields, and applications. Geom. Funct. Anal. 14, 27–57 (2004)
P. Brass, W. Moser, J. Pach, Research Problems in Discrete Geometry (Springer, Berlin, 2005)
A. Bronner, A. Sheffer, M. Sharir, Distinct distances on a line and a curve (2016) [manuscript]
B. Bukh, J. Tsimerman, Sum-product estimates for rational functions. Proc. Lond. Math. Soc. 104, 1–26 (2012)
M. Charalambides, Distinct distances on curves via rigidity. Discret. Comput. Geom. 51, 666–701 (2014)
F. de Zeeuw, A course in algebraic combinatorial geometry, lecture notes available from the author’s website http://dcg.epfl.ch/page-84876-en.html (2015)
G. Elekes, in SUMS versus PRODUCTS in Number Theory Algebra and Erdős Geometry, Paul Erdős and his Mathematics II, Bolyai Society Mathematical Studies, vol. 11 (2002), pp. 241–290
G. Elekes, E. Szabó, On triple lines and cubic curves: the orchard problem revisited, arXiv:1302.5777 (2013)
G. Elekes, Circle grids and bipartite graphs of distances. Combinatorica 15, 167–174 (1995)
G. Elekes, On the number of sums and products. Acta Arith. 81, 365–367 (1997)
G. Elekes, A combinatorial problem on polynomials. Discret. Comput. Geom. 19, 383–389 (1998)
G. Elekes, A note on the number of distinct distances. Period. Math. Hung. 38, 173–177 (1999)
G. Elekes, On linear combinatorics III, few directions and distorted lattices. Combinatorica 1, 43–53 (1999)
G. Elekes, L. Rónyai, A combinatorial problem on polynomials and rational functions. J. Comb. Theory Ser. A 89, 1–20 (2000)
G. Elekes, M. Sharir, Incidences in three dimensions and distinct distances in the plane. Comb. Probab. Comput. 20, 571–608 (2011)
G. Elekes, E. Szabó, How to find groups? (And how to use them in Erdős geometry?). Combinatorica 32, 537–571 (2012)
G. Elekes, M.B. Nathanson, I.Z. Ruzsa, Convexity and sumsets. J. Number Theory 83, 194–201 (1999)
G. Elekes, M. Simonovits, E. Szabó, A combinatorial distinction between unit circles and straight lines: how many coincidences can they have? Comb. Probab. Comput. 18, 691–705 (2009)
P. Erdős, E. Szemerédi, On sums and products of integers, in Studies in Pure Mathematics (Birkhäuser, 1983), pp. 213–218
P. Erdős, On sets of distances of \(n\) points. Am. Math. Mon. 53, 248–250 (1946)
P. Erdős, G. Purdy, Some extremal problems in geometry. J. Comb. Theory 10, 246–252 (1971)
B. Green, T. Tao, On sets defining few ordinary lines. Discret. Comput. Geom. 50, 409–468 (2013)
L. Guth, N.H. Katz, On the Erdős distinct distances problem in the plane. Ann. Math. 181, 155–190 (2015)
R. Hartshorne, Algebraic Geometry (Springer, Berlin, 1977)
N. Hegyvári, F. Hennecart, Conditional expanding bounds for two-variable functions over prime fields. Eur. J. Comb. 34, 1365–1382 (2013)
S. Konyagin, I. Shkredov, On sum sets of sets, having small product set, in Proceedings of the Steklov Institute of Mathematics, vol. 290, n.1 (August 2015), pp. 288–299, arXiv:1503.05771
S. Lang, A. Weil, Number of points of varieties in finite fields. Am. J. Math. 76, 819–827 (1954)
R.J. Lipton, blog post (2009), http://rjlipton.wordpress.com/2009/11/30//the-curious-history-of-the-schwartz-zippel-lemma/
B. Lund, A. Sheffer, F. de Zeeuw, Bisector energy and few distinct distances, in 31st International Symposium on Computational Geometry (SoCG 2015) (2015), pp. 537–552, arXiv:1411.6868
J. Matoušek, Lectures on Discrete Geometry (Springer, Berlin, 2002)
H. Nassajian Mojarrad, T. Pham, C. Valculescu, F. de Zeeuw, Schwartz–Zippel Bounds for Two-dimensional Products (2015), arXiv:1507.08181
J. Pach, F. de Zeeuw, Distinct distances on algebraic curves in the plane, Comb. Probab. Comput. 26(1), 99–117 (2017), arXiv:1308.0177; Proceedings of the Thirtieth Annual Symposium on Computational geometry (2014), pp. 549–557
J. Pach, M. Sharir, On the number of incidences between points and curves. Comb. Probab. Comput. 7, 121–127 (1998)
O.E. Raz, A Note on Distinct Distance Subsets (2016), arXiv:1603.00740
O.E. Raz, M. Sharir, Rigidity of complete bipartite graphs in the plane (2016) [manuscript]
O.E. Raz, M. Sharir, The number of unit-area triangles in the plane: Theme and variations. Combinatorica 37(6), 1221–1240 (December 2017), arXiv:1501.00379
O.E. Raz, M. Sharir, F. de Zeeuw, Polynomials vanishing on cartesian products: The Elekes–Szabó theorem revisited, Duke Math. J. 165(18), 3517–3566 (2016), arXiv:1504.05012; in 31st International Symposium on Computational Geometry (SoCG 2015) (2015), pp. 522–536
O.E. Raz, M. Sharir, F. de Zeeuw, The Elekes–Szabó theorem in four dimensions. Israel Journal of Mathematics 227(2), 663–690 (August 2018) [manuscript]
O.E. Raz, M. Sharir, J. Solymosi, On triple intersections of three families of unit circles, Discret. Comput. Geom. 54, 930–953 (2015); in Proceedings of the Thirtieth Annual Symposium on Computational Geometry (2014), pp. 198–205
O.E. Raz, M. Sharir, J. Solymosi, Polynomials vanishing on grids: the Elekes–Rónyai problem revisited. Am. J. Math. arXiv:1401.7419; in Proceedings of the thirtieth annual symposium on Computational geometry (2014), pp. 251–260
R. Schwartz, J. Solymosi, F. de Zeeuw, Extensions of a result of Elekes and Rónyai. J. Comb. Theory Ser. A 120, 1695–1713 (2013)
M. Sharir, S. Smorodinsky, C. Valculescu, F. de Zeeuw, Distinct distances between points and lines. Comput. Geom. 69, 2–15 (2018), arXiv:1512.09006
M. Sharir, J. Solymosi, Distinct distances from three points, Comb. Probab. Comput. 25(4), 623–632 (2016), arXiv:1308.0814
M. Sharir, A. Sheffer, J. Solymosi, Distinct distances on two lines. J. Comb. Theory Ser. A 120, 1732–1736 (2013)
A. Sheffer, The polynomial method, lecture notes from a course at Caltech (2015), http://www.math.caltech.edu/~2014-15/3term/ma191c-sec2/
A. Sheffer, E. Szabó, J. Zahl, Point-curve incidences in the complex plane. Combinatorica 38(2), 487–499 (April 2018), arXiv:1502.0
A. Sheffer, J. Zahl, F. de Zeeuw, Few distinct distances implies no heavy lines or circles. Combinatorica 36(3), 349–364 (June 2016), arXiv:1308.5620
C.-Y. Shen, Algebraic methods in sum-product phenomena. Isr. J. Math. 188, 123–130 (2012)
J.H. Silverman, J. Tate, Rational Points on Elliptic Curves (Springer, Berlin, 1992)
J. Solymosi, F. de Zeeuw, Incidence bounds for complex algebraic curves on cartesian products (2018) [this volume]
J. Solymosi, Bounding multiplicative energy by the sumset. Adv. Math. 222, 402–408 (2009)
J. Spencer, E. Szemerédi, W.T. Trotter, Unit distances in the Euclidean plane, in Graph Theory and Combinatorics, (Academic Press, Dublin, 1984), pp. 293–303
E. Szemerédi, W.T. Trotter, Extremal problems in discrete geometry. Combinatorica 3, 381–392 (1983)
T. Tao, blog post (2012), http://terrytao.wordpress.com/2012/08/31/the-lang-weil-bound/
T. Tao, Expanding polynomials over finite fields of large characteristic, and a regularity lemma for definable sets. Contrib. Discret. Math. 10, 22–98 (2015)
P. Ungar, \(2N\) noncollinear points determine at least \(2N\) directions. J. Comb. Theory Ser. A 33, 343–347 (1982)
C. Valculescu, F. de Zeeuw, Distinct values of bilinear forms on algebraic curves, Contrib. Discret. Math (2015). arXiv:1403.3867
H. Wang, Exposition of Elekes Szabo paper, arXiv:1512.04998 (2015)
J. Zahl, A Szemerédi–Trotter type theorem in \({\mathbb{R}^4}\). Discret. Comput. Geom. 54, 513–572 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 János Bolyai Mathematical Society and Springer-Verlag GmbH Germany, part of Springer Nature
About this chapter
Cite this chapter
de Zeeuw, F. (2018). A Survey of Elekes-Rónyai-Type Problems. In: Ambrus, G., Bárány, I., Böröczky, K., Fejes Tóth, G., Pach, J. (eds) New Trends in Intuitive Geometry. Bolyai Society Mathematical Studies, vol 27. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-57413-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-57413-3_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-57412-6
Online ISBN: 978-3-662-57413-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)