University of Cambridge > > Discrete Analysis Seminar > Combinatorial problems in finite fields and Sidon sets

Combinatorial problems in finite fields and Sidon sets

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Boris Bukh.

Many combinatorial problems in finite fields have been studied in recent years: number of solutions of equations, sum-product estimates or incidence problems.

In this work we introduce a new approach to deal with these and other problems. Our method is simple, combinatorial and avoids the use of trigonometric sums, the usual tool to deal with these problems. Sidon sets, which are important objects in combinatorial number theory, are the main tool in our method.

This talk is part of the Discrete Analysis Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity