2021/06/16 by Nina Kamčev, Anita Liebenau, Kamčev, Nina +3
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.2106.08986
openalex publication_date 2021/06/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A system of linear equations L over \mathbbFq is common if the number of monochromatic solutions to L in any two-colouring of \mathbbFqn is asymptotically at least the expected number of monochromatic solutions in a random two-colouring of \mathbbFqn. 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. Building upon earlier work of Cameron, Cilleruelo and Serra, as well as Saad and Wolf, common linear equations have recently been fully characterised by Fox, Pham and Zhao, who asked about common systems of equations. In this paper we move towards a classification of common systems of two or more linear equations. In particular we prove that any system containing an arithmetic progression of length four is uncommon, confirming a conjecture of Saad and Wolf. 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.