Abstract
The Erd\H os-Falconer distance problem in asks one to show that if is of sufficiently large cardinality, then satisfies . Here, is the set of integers modulo , and is the free module of rank over . We extend known results in two directions. Previous results were known only in the setting , where is an odd prime, and as such only showed that all units were obtained in the distance set. We remove the constriction that is a power of a prime, and despite this, shows that the distance set of contains \emph{all} of whenever is sufficiently large.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.