Results on the Erdős-Falconer distance problem in Z_q^d for odd q

Abstract: The ErdH os-Falconer distance problem in

m a t h b b Z_{q}^{d}

asks one to show that if

E s u b s e t m a t h b b Z_{q}^{d}

is of sufficiently large cardinality, then

D e l t a (E) := (x_{1} - y_{1})^{2} + d o t s + (x_{d} - y_{d})^{2} : x, y i n E

satisfies

D e l t a (E) = m a t h b b Z_{q}

. Here,

m a t h b b Z_{q}

is the set of integers modulo

q

, and

m a t h b b Z_{q}^{d}

is the free module of rank

d

over

m a t h b b Z_{q}

. We extend known results in two directions. Previous results were known only in the setting

q = p^{e l l}

, where

p

is an odd prime, and as such only showed that all units were obtained in the distance set. We remove the constriction that

q

is a power of a prime, and despite this, shows that the distance set of

E

contains emph{all} of

m a t h b b Z_{q}

whenever

E

is sufficiently large.

Recommendations

Cites Work

Cited In (4)

This page was built for publication: Results on the Erdős-Falconer distance problem in \(\mathbb{Z}_q^d\) for odd \(q\)