Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Results on the Erd\H os-Falconer distance problem in $\mathbb{Z}_q^d$ for odd $q$ (1309.1495v2)

Published 5 Sep 2013 in math.NT and math.CO

Abstract: The Erd\H os-Falconer distance problem in $\mathbb{Z}_qd$ asks one to show that if $E \subset \mathbb{Z}_qd$ is of sufficiently large cardinality, then $\Delta(E) := {(x_1 - y_1)2 + \dots + (x_d - y_d)2 : x, y \in E}$ satisfies $\Delta(E) = \mathbb{Z}_q$. Here, $\mathbb{Z}_q$ is the set of integers modulo $q$, and $\mathbb{Z}_qd$ is the free module of rank $d$ over $\mathbb{Z}_q$. We extend known results in two directions. Previous results were known only in the setting $q = p{\ell}$, 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 $\mathbb{Z}_q$ whenever $E$ is sufficiently large.

Summary

We haven't generated a summary for this paper yet.