Abstract
We use bounds of exponential sums to derive new lower bounds on the number of distinct distances between all pairs of points
Open Access
On the set of distances between two sets over finite fields
Received13 Mar 2006
Revised12 May 2006
Accepted09 Jul 2006
Published05 Sept 2006
References
M. B. Erdogan, “A bilinear Fourier extension theorem and applications to the distance set problem,” International Mathematics Research Notices, vol. 2005, no. 23, pp. 1411–1425, 2005.
View at: Publisher Site | Google Scholar | MathSciNetS. Hofmann and A. Iosevich, “Circular averages and Falconer/Erdös distance conjecture in the plane for random metrics,” Proceedings of the American Mathematical Society, vol. 133, no. 1, pp. 133–143, 2005.
View at: Publisher Site | Google Scholar | MathSciNetA. Iosevich and I. Łaba, “Distance sets of well-distributed planar point sets,” Discrete & Computational Geometry, vol. 31, no. 2, pp. 243–250, 2004.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNetA. Iosevich and M. Rudnev, “Erdös distance problem in vector spaces over finite fields,” to appear in Transactions of the American Mathematical Society.
View at: Google ScholarA. Iosevich and M. Rudnev, “Spherical averages, distance sets, and lattice points on convex surfaces,” preprint, 2005.
View at: Google ScholarN. H. Katz and G. Tardos, “A new entropy inequality for the Erdös distance problem,” in Towards a Theory of Geometric Graphs, vol. 342 of Contemp. Math., pp. 119–126, American Mathematical Society, Rhode Island, 2004.
View at: Google Scholar | Zentralblatt MATH | MathSciNetR. Lidl and H. Niederreiter, Finite Fields, vol. 20 of Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, 1997.
View at: MathSciNetI. E. Shparlinski, “On some generalisations of the Erdös distance problem over finite fields,” Bulletin of the Australian Mathematical Society, vol. 73, no. 2, pp. 285–292, 2006.
View at: Google Scholar | MathSciNet
Copyright
Copyright © 2006 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.