Papers
Topics
Authors
Recent
Search
2000 character limit reached

The generalized Erdos-Falconer distance problems in vector spaces over finite fields

Published 22 Apr 2010 in math.CA | (1004.4012v1)

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.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.