![]() |
![]() |
University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Nonlinear problems in arithmetic Ramsey theory
![]() Nonlinear problems in arithmetic Ramsey theoryAdd to your list(s) Download to your calendar using vCal
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:Note that ex-directory lists are not shown. |
Other listsNuclear physics seminars Geometry and Mathematical Physics seminar Facts and SnacksOther talksTopological magnons and quantum magnetism Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems The percolating cluster is invisible to image recognition with deep learning Many-body localization from Hilbert- and real-space points of view [Friday seminar]: Irradiated brown dwarfs in the desert Signatures of structural criticality and universality in the cellular anatomy of the brain |