Distances and trees in dense subsets of \(\mathbb{Z}^d\)

DOI10.1007/s11856-020-2079-8zbMath1468.11031arXiv1509.09298OpenAlexW3097316872MaRDI QIDQ2218734

Neil Lyall, Ákos Magyar

Publication date: 18 January 2021

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.09298

Mathematics Subject Classification ID

Measure-preserving transformations (28D05) Density, gaps, topology (11B05) Ramsey theory (05D10)

Related Items

Density theorems for anisotropic point configurations ⋮ Weak hypergraph regularity and applications to geometric Ramsey theory ⋮ The discrete spherical maximal function: A new proof of ℓ²-boundedness

Cites Work

• Unnamed Item
• Finite chains inside thin subsets of \(\mathbb{R}^d\)
• On distance sets of large sets of integer points
• A Szemerédi type theorem for sets of positive density in \(\mathbb R^k\)
• Discrete analogues in harmonic analysis: spherical averages
• Distance graphs and sets of positive upper density in \(\mathbb{R}^d\)
• Simplices and sets of positive upper density in $\mathbb {R}^d$
• Spherical recurrence and locally isometric embeddings of trees into positive density subsets of ℤ^d
• Embedding distance graphs in finite field vector spaces