Combinatorial problems in finite fields and Sidon sets

From MaRDI portal



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.




Cited in
(43)








This page was built for publication: Combinatorial problems in finite fields and Sidon sets

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