University of Cambridge > Talks.cam > Combinatorics Seminar > Sets of integers with many solutions to a linear equation

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Sets of integers with many solutions to a linear equation

Download to your calendar using vCal

  • UserJames Aaronson (University of Oxford)
  • ClockThursday 17 May 2018, 14:30-15:30
  • HouseMR13.

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:

Note that ex-directory lists are not shown.

Other lists

Pippard lecture theatre and https://tinyurl.com/3fpmjscv MPLT, MRC-LMB, Francis Crick Avenue, Cambridge Biomedical Campus, CB2 0QH Goldsmiths' 2 & https://zoom.us/j/96836714124

Other talks

Precision psychiatry Afternoon Break Scientific Steering Committee meeting John Kendrew Lecture - Title TBC Morning Tea and Coffee Why people with schizophrenia die earlier? Mortality and accelerated ageing
 

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