Erdos distance problem in vector spaces over finite fields
| dc.creator | Iosevich, Alex | |
| dc.creator | Rudnev, Misha | |
| dc.date | 2005-09-01 | |
| dc.date.accessioned | 2026-07-07T05:22:52Z | |
| dc.date.available | 2026-07-07T05:22:52Z | |
| dc.description | We study the Erdös/Falconer distance problem in vector spaces over finite fields. Let ${\Bbb F}_q$ be a finite field with $q$ elements and take $E \subset {\Bbb F}^d_q$, $d \ge 2$. We develop a Fourier analytic machinery, analogous to that developed by Mattila in the continuous case, for the study of distance sets in ${\Bbb F}^d_q$ to provide estimates for minimum cardinality of the distance set $Δ(E)$ in terms of the cardinality of $E$. Kloosterman sums play an important role in the proof. | |
| dc.identifier | https://arxiv.org/abs/math/0509005 | |
| dc.identifier | http://arxiv.org/abs/math/0509005 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/76225 | |
| dc.subject | Classical Analysis and ODEs | |
| dc.subject | Number Theory | |
| dc.subject | 42B | |
| dc.title | Erdos distance problem in vector spaces over finite fields | |
| dc.type | text |