Results on the Erd\H os-Falconer distance problem in $\mathbb{Z}_q^d$ for odd $q$
Number Theory
2014-03-05 v2 Combinatorics
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.
Cite
@article{arxiv.1309.1495,
title = {Results on the Erd\H os-Falconer distance problem in $\mathbb{Z}_q^d$ for odd $q$},
author = {David Covert},
journal= {arXiv preprint arXiv:1309.1495},
year = {2014}
}
Comments
9 pages, typos fixed, general condition for main theorem has been corrected/simplified