University of Cambridge > > Combinatorics Seminar > Common linear patterns are rare

Common linear patterns are rare

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

  • UserN. Kamcev (Zagreb)
  • ClockThursday 21 October 2021, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Professor Imre Leader.

Several classical results in Ramsey theory (including famous theorems of Schur, van der Waerden, Rado) deal with finding monochromatic linear patterns in two-colourings of the integers. Our topic will be quantitative extensions of such results. A linear system L over F_q is common if the number of monochromatic solutions to L=0 in any two-colouring of F_qn is asymptotically at least the expected number of monochromatic solutions in a random two-colouring of F_qn. Motivated by existing results for specific systems (such as Schur triples and arithmetic progressions), as well as extensive research on common and Sidorenko graphs, the systematic study of common systems of linear equations was recently initiated by Saad and Wolf. Fox, Pham and Zhao characterised common linear equations. I will talk about recent progress towards a classification of common systems of two or more linear equations. In particular, the uncommonness of an arbitrarily large system L can be reduced to studying single equations implied by L. Joint work with Anita Liebenau and Natasha Morrison.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity