Common systems of equations are rare

Abstract: 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 $\mathcal{F}_q$ is \emph{common} if the number of monochromatic solutions to $L=0$ in any two-colouring of $\mathcal{F}_q^n$ is asymptotically at least the expected number of monochromatic solutions in a random two-colouring of $\mathcal{F}_q^n$. 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, any system containing a four-term arithmetic progression is uncommon. This follows from a more general result which allows us to deduce the uncommonness of a general system from certain properties of one- or two-equation subsystems. Joint work with Anita Liebenau and Natasha Morrison.

computational geometrydiscrete mathematicscommutative algebracombinatorics

Audience: researchers in the topic

Copenhagen-Jerusalem Combinatorics Seminar

Series comments: There is a mailing list for talk announcements. If you want to receive the announcements, send an e-mail to the organizer to subscribe to the mailing list.

The password for the zoom room is 123456