Skip to main content
Log in

Distances and trees in dense subsets of ℤd

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

In [4] Furstenberg, Katznelson and Weiss establish that all sufficiently large distances can always be attained between pairs of points from any given measurable subset of ℝ2 of positive upper (Banach) density. A second proof of this result, as well as a stronger “pinned variant”, was given by Bourgain in [2] using Fourier analytic methods. In [8] the second author adapted Bourgain’s Fourier analytic approach to establish a result analogous to that of Furstenberg, Katznelson and Weiss for subsets ℤd provided d ≥ 5. We present a new direct proof of this discrete distance set result and generalize this to arbitrary trees. Using appropriate discrete spherical maximal function theorems we ultimately establish the natural “pinned variants” of these results.

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. M. Bennett, A. Iosevich and K. Taylor, Finite chains inside thin subsets ofd, Analysis &PDE 9 (2016), 597–614.

    Article  MathSciNet  Google Scholar 

  2. J. Bourgain, A Szemerédi type theorem for sets of positive density ink, Israel Journal of Mathematics 54 (1986), 307–316.

    Article  MathSciNet  Google Scholar 

  3. K. Bulinski, Spherical Recurrence and locally isometric embeddings of trees into positive density subsets ofd, Mathematical Proceedings of the Cambridge Philosophical Society 165 (2018), 267–278.

    Article  MathSciNet  Google Scholar 

  4. H. Furstenberg, Y. Katznelson and B. Weiss, Ergodic theory and configurations in sets of positive density, in Mathematics of Ramsey Theory, Algorithms and Combinatorics, Vol. 5, Springer, Berlin, 1990, pp. 184–198.

    Chapter  Google Scholar 

  5. L. Huckaba, N. Lyall and Á. Magyar, Simplices and sets of positive upper density ind, Proceedings of the American Mathematical Society 145 (2017), 2335–2347.

    Article  MathSciNet  Google Scholar 

  6. A. Iosevich and H. Parshall, Embedding distance graphs in finite field vector spaces, Journal of the Korean Mathematical Society 56 (2019), 1515–1528.

    MathSciNet  MATH  Google Scholar 

  7. N. Lyall and Á. Magyar, Distance Graphs and sets of positive upper density ind, Analysis & PDE 13 (2020), 685–700.

    Article  MathSciNet  Google Scholar 

  8. A. Magyar, On distance sets of large sets of integer points, Israel Journal of Mathematics 164 (2008), 251–263.

    Article  MathSciNet  Google Scholar 

  9. Á. Magyar, E. M. Stein and S. Wainger, Discrete analogues in harmonic analysis: spherical averages, Annals of Mathematics 155 (2002), 189–208.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Neil Lyall.

Additional information

The first and second authors were partially supported by grants NSF-DMS 1702411 and NSF-DMS 1600840, respectively.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lyall, N., Magyar, Á. Distances and trees in dense subsets of ℤd. Isr. J. Math. 240, 769–790 (2020). https://doi.org/10.1007/s11856-020-2079-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11856-020-2079-8

Navigation