University of Cambridge > Talks.cam > Combinatorics Seminar > Generalized sum-product phenomenon and group configurations

Generalized sum-product phenomenon and group configurations

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

  • UserEmmanuel Breuillard (University of Cambridge)
  • ClockThursday 01 March 2018, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

A large finite set of numbers must grow under either addition or multiplication (sum-product phenomenon) and more generally under any polynomial map which is not of a special form coming either from addition only or from multiplication only. Several years ago Elekes and Szabo have shown more generally that if an algebraic constraint is satisfied by too many triples of numbers from the same finite set, then this algebraic constraint must come from the graph of a group operation. In joint work with Martin Bays (Muenster) we present a new approach to this problem which enables us to completely classify the type of constraints that can arise in all dimensions and all arities.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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