The analog of the Erdös distance problem in finite fields

DOI10.1142/S1793042117501275zbMath1430.11161OpenAlexW2605338013MaRDI QIDQ4595070

Sukumar Das Adhikari, Anirban Mukhopadhyay, M. Ram Murty

Publication date: 28 November 2017

Published in: International Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793042117501275

zbMATH Keywords

Fourier analysisfinite fieldsErdös-Falconer distance problem

Mathematics Subject Classification ID

Other character sums and Gauss sums (11T24) Erd?s problems and related topics of discrete geometry (52C10)

Related Items

Большие пути в дистанционных графах в векторных пространствах над конечным полем ⋮ Embedding bipartite distance graphs under Hamming metric in finite fields ⋮ Erdös--Falconer Distance Problem under Hamming Metric in Vector Spaces over Finite Fields

Cites Work

• Unnamed Item
• The generalized Erdős-Falconer distance problems in vector spaces over finite fields
• Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces
• Group actions and geometric combinatorics in \(\mathbb{F}_{q}^{d}\)
• Erdös distance problem in vector spaces over finite fields
• The Erdös–Falconer Distance Problem, Exponential Sums, and Fourier Analytic Approach to Incidence Theorems in Vector Spaces over Finite Fields
• Sum-product Estimates in Finite Fields via Kloosterman Sums