Nonlinear problems in arithmetic Ramsey theory

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

• Sean Prendiville (Lancaster University)
• Thursday 21 November 2019, 14:00-15:00
• Watson 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.

This talk is included in these lists:

• Combinatorics and Probability Seminar
• School of Mathematics Events
• Watson LTB

Note that ex-directory lists are not shown.