Combinatorial problems in finite fields and Sidon sets
classification
🧮 math.NT
math.CO
keywords
problemscombinatorialfieldsfinitesetssidonsomeavoiding
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.