arXiv · 1003.3576
Combinatorial problems in finite fields and Sidon sets
Abstract
We use Sidon sets to present an elementary method to study some combinatorial problems in finite fields, such as sum product estimates, solubility of some equations and distribution of sequences in small intervals. We obtain classic and more recent results avoiding the use of exponential sums, the usual tool to deal with these problems.
Explore related subjects
Keep this discovery
Javier Cilleruelo. 2010-03-18. Combinatorial problems in finite fields and Sidon sets. https://arxiv.org/abs/1003.3576
Cite the original work for its findings. Save a collection to share your selection of sources.