The generalized Erdős-Falconer distance problems in vector spaces over finite fields

From MaRDI portal
Publication:452378

DOI10.1016/J.JNT.2012.05.003zbMATH Open1252.52013arXiv1004.4012OpenAlexW2962729862MaRDI QIDQ452378FDOQ452378


Authors: Doowon Koh, Chun-Yen Shen Edit this on Wikidata


Publication date: 21 September 2012

Published in: Journal of Number Theory (Search for Journal in Brave)

Abstract: In this paper we study the generalized Erdos-Falconer distance problems in the finite field setting. The generalized distances are defined in terms of polynomials, and various formulas for sizes of distance sets are obtained. In particular, we develop a simple formula for estimating the cardinality of distance sets determined by diagonal polynomials. As a result, we generalize the spherical distance problems due to Iosevich and Rudnev and the cubic distance problems due to Iosevich and Koh. Moreover, our results are of higher dimensional version for Vu's work on two dimension. In addition, we set up and study the generalized pinned distance problems in finite fields. We give a nice generalization of some recent work in which the pinned distance problems related to spherical distances were investigated. Discrete Fourier analysis and exponential sum estimates play an important role in our proof.


Full work available at URL: https://arxiv.org/abs/1004.4012




Recommendations




Cites Work


Cited In (23)





This page was built for publication: The generalized Erdős-Falconer distance problems in vector spaces over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452378)