Combinatorial problems in finite fields and Sidon sets

2010/03/18 by Javier Cilleruelo, Cilleruelo, Javier · 1 citation
Computer Science · Engineering · Mathematics · #11B30 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Number Theory (math.NT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1003.3576

openalex publication_date 2010/03/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Szemeredi-Trotter type theorem and sum-product estimate in finite fields

Cited by

• Sums, products, and exponents in two-colorings of the naturals

Related

• Sum of elements in finite Sidon sets II
• Finite field models in additive combinatorics
• An improved sum-product estimate for general finite fields
• An upper bound on the size of Sidon sets
• k-fold Sidon sets