University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Nonlinear problems in arithmetic Ramsey theory

Nonlinear problems in arithmetic Ramsey theory

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

  • UserSean Prendiville (Lancaster University)
  • ClockThursday 21 November 2019, 14:00-15:00
  • HouseWatson LTB.

If you have a question about this talk, please contact Eoin Long.

Rado characterised those systems of linear Diophantine equations which are ‘unbreakable’ with respect to finite partitions, so that any partition of the positive integers yields a set containing a solution. Similarly, a celebrated theorem of Szemerédi gives rise to a characterisation of linear systems possessing solutions in any ‘dense’ set of integers. We discuss variants of these results for certain nonlinear equations/configurations.

This talk is part of the Combinatorics and Probability Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.