Skip to main content
Log in

The Additive Structure of Cartesian Products Spanning Few Distinct Distances

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

Guth and Katz proved that any point set P in the plane determines Ω(|P|/log |P|) distinct distances. We show that when near to this lower bound, a point set P of the form A × A must satisfy |A-A|≪|A-A|2-1/8.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. Cilleruelo and A. Granville: Lattice points on circles, squares in arithmetic progressions and sumsets of squares, Additive combinatorics, 241–262, CRM Proc. Lecture Notes, 43, Amer. Math. Soc., Providence, RI, 2007.

    Chapter  Google Scholar 

  2. G. Elekes, M. B. Nathanson and I. Ruzsa: Convexity and sumsets, J. Number Theory 83 (2000), 194–201.

    Article  MathSciNet  MATH  Google Scholar 

  3. P. Erdős: On sets of distances of n points, Amer. Math. Monthly 53 (1946), 248–250.

    Article  MathSciNet  MATH  Google Scholar 

  4. P. Erdős: On some metric and combinatorial geometric problems, Discrete Math. 60 (1986), 147–153.

    Article  MathSciNet  MATH  Google Scholar 

  5. L. Guth and N. H. Katz: On the Erdős distinct distances problem in the plane, Ann. of Math. 181 (2015), 155–190.

    Article  MathSciNet  MATH  Google Scholar 

  6. L. Li and O. Roche-Newton: Convexity and a sum-product type estimate, Acta Arith. 156 (2012), 247–255.

    Article  MathSciNet  MATH  Google Scholar 

  7. G. Petridis: New proofs of Plünnecke-type estimates for product sets in groups, Combinatorica 32 (2012), 721–733.

    Article  MathSciNet  MATH  Google Scholar 

  8. A. Sheffer, J. Zahl and F. de Zeeuw: Few distinct distances implies no heavy lines or circles, arXiv:1308.5620.

  9. I. D. Shkredov: Difference sets are not multiplicatively closed, arXiv:1602.02360.

  10. J. Solymosi: Bounding multiplicative energy by the sumset, Adv. Math. 222 (2009), 402–408.

    Article  MathSciNet  MATH  Google Scholar 

  11. P. Ungar: 2N noncollinear points determine at least 2N directions, J. Combinatorial Theory, Ser. A 33 (1982), 343–347.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Brandon Hanson.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hanson, B. The Additive Structure of Cartesian Products Spanning Few Distinct Distances. Combinatorica 38, 1095–1100 (2018). https://doi.org/10.1007/s00493-016-3665-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-016-3665-6

Mathematics Subject Classification (2000)

Navigation