COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Combinatorics Seminar > Generalized sum-product phenomenon and group configurations
Generalized sum-product phenomenon and group configurationsAdd to your list(s) Download to your calendar using vCal
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. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsLife Sciences & Society Cambridge Conference on Global Food Security 2016 All transferable skills in the university: computingOther talksCafe Synthetique- AI and Automation: Revolutionising Biology Designing Active Macroscopic Heat Engines Quantum geometry from the quantisation of gravitational boundary modes on a null surface Reading and Panel Discussion with Emilia Smechowski Academic CV Workshop Peak Youth: the end of the beginning |