arXiv (All)
open access
The Erdős-Falconer distance problem in the integer lattice
In this paper we propose and study what we call the Erdős-Falconer distance problem in the integer lattice. One motivation is Magyar's discrete analog of the result of Furstenberg, Katznelson, and Weiss, who showed that all arbitrarily large distances had to appear for a set of positive upper Banach
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On indecomposable elements in lattices#1199863
- On (n,k)-Simple Random Integer Lattices.#315711
- Full-radius dimension-free maximal inequalities for discrete Euclidean balls#1070936
- Dimension-free estimates for full discrete maximal functions associated with Euclidean balls and spheres#997753
- Bounded common fundamental domains for two lattices#821705
Record · ID 1247592
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive