Embedding distance graphs in finite field vector spaces
From MaRDI portal
Publication:4973826
DOI10.4134/JKMS.j180776zbMath1442.52013arXiv1802.06460OpenAlexW3030802540MaRDI QIDQ4973826
Alexander Iosevich, Hans Parshall
Publication date: 5 December 2019
Full work available at URL: https://arxiv.org/abs/1802.06460
Exponential sums (11T23) Distance in graphs (05C12) Erd?s problems and related topics of discrete geometry (52C10)
Related Items (6)
On Erd\H{o}s Chains in the Plane ⋮ Note on the number of hinges defined by a point set in \(\mathbb{R}^2\) ⋮ Embedding bipartite distance graphs under Hamming metric in finite fields ⋮ Simplices in thin subsets of Euclidean spaces ⋮ Distances and trees in dense subsets of \(\mathbb{Z}^d\) ⋮ Cycles of arbitrary length in distance graphs on \(\mathbb{F}_q^d\)
Cites Work
- Finite chains inside thin subsets of \(\mathbb{R}^d\)
- Pinned distance sets, \(k\)-simplices, Wolff's exponent in finite fields and sum-product estimates
- On the Erdős distinct distances problem in the plane
- On necklaces inside thin subsets of \(\mathbb{R}^d\)
- Group actions and geometric combinatorics in \(\mathbb{F}_{q}^{d}\)
- On Falconer's distance set problem in the plane
- LONG PATHS IN THE DISTANCE GRAPH OVER LARGE SUBSETS OF VECTOR SPACES OVER FINITE FIELDS
- Simplices over finite fields
- The sovability of norm, bilinear and quadratic equations over finite fields via spectra of graphs
- Erdös distance problem in vector spaces over finite fields
- On the Hausdorff dimensions of distance sets
- On kaleidoscopic pseudo-randomness of finite Euclidean graphs
- Rigidity, Graphs and Hausdorff Dimension
- On Some Exponential Sums
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Embedding distance graphs in finite field vector spaces
