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 > Sets of integers with many solutions to a linear equation

## Sets of integers with many solutions to a linear equationAdd to your list(s) Download to your calendar using vCal - James Aaronson (University of Oxford)
- Thursday 17 May 2018, 14:30-15:30
- MR13.
If you have a question about this talk, please contact Andrew Thomason. It is possible to prove, via a fairly elementary argument, that the number of triples x+y=z in a set of integers of given size is maximised for the set [-n/2, n/2]. Suppose we were to consider an equation with arbitrary coefficients; it turns out that we can construct examples of sets which provide a uniform lower bound on the maximal number of solutions. In this talk, we will discuss why such examples are, in some sense, optimal. This talk is part of the Combinatorics Seminar series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- Hanchen DaDaDash
- Interested Talks
- MR13
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsEarly modern seminar, Pembroke College, Cambridge The Politics of Economics Physics of the Impossible## Other talksSir Richard Stone Annual Lecture: The Emergence of Weak, Despotic and Inclusive States Giant response of weakly driven systems Systems for Big Data Applications: Revolutionising personal computing Populism and Central Bank Independence Energy landscape of multivariate time series data |