Abstract
A linear system L over \(\mathbb{F}_{q}\) is common if the number of monochromatic solutions to L = 0 in any two-colouring of \(\mathbb{F}_{q}^{n}\) is asymptotically at least the expected number of monochromatic solutions in a random two-colouring of \(\mathbb{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, Saad and Wolf recently initiated the systematic study of common systems of linear equations.
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, resolving a question 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.
Article PDF
Avoid common mistakes on your manuscript.
References
S. A. Burr and V. Rosta, On the Ramsey multiplicities of graphs—problems and recent results, Journal of Graph Theory 4 (1980), 347–361.
P. Cameron, J. Cilleruelo and O. Serra, On monochromatic solutions of equations in groups, Revista Matemática Iberoamerican 23 (2007), 385–395.
D. Conlon, On the Ramsey multiplicity of complete graphs, Combinatorica 32 (2012), 171–186.
D. Conlon, J. Fox and B. Sudakov, An approximate version of Sidorenko’s conjecture, Geometric and Functional Analysis 20 (2010), 1354–1366.
D. Conlon, J. H. Kim, C. Lee and J. Lee, Some advances on Sidorenko’s conjecture, Journal of the London Mathematical Society 98 (2018), 593–608.
D. Conlon and J. Lee, Sidorenko’s conjecture for blow-ups, Discrete Analysis (2021) Article no. 2.
B. A. Datskovsky, On the number of monochromatic Schur triples, Advances in Applied Mathematics 31 (2003), 193–198.
P. Erdős, On the number of complete subgraphs contained in certain graphs, A Magyar Tudományos Akadémia. Matematikai Kutató Intézetének Közleményei 7 (1962), 459–464.
J. Fox, There exist graphs with super-exponential Ramsey multiplicity constant, Journal of Graph Theory 57 (2008), 89–98.
J. Fox, H. T. Pham and Y. Zhao, Common and Sidorenko linear equations, Quarterly Journal of Mathematics 72 (2021), 1223–1234.
A. W. Goodman, On sets of acquaintances and strangers at any party, American Mathematical Monthly 66 (1959), 778–783.
W. T. Gowers, Generalizations of Fourier analysis, and how to apply them, Bulletin of the American Mathematical Society 54 (2017), 1–44.
W. T. Gowers, A uniform set with fewer than expected arithmetic progressions of length 4, Acta Mathematica Hungarica 161 (2020), 756–767.
R. Graham, V. Rödl and A. Ruciński, On Schur properties of random subsets of integers, Journal of Number Theory 61 (1996), 388–408.
R. Hancock, D. Král’, M. Krnc and J. Volec, Towards characterizing locally common graphs, Random Structures & Algorithms 62 (2023), 181–218.
H. Hatami, Graph norms and Sidorenko’s conjecture, Israel Journal of Mathematics 175 (2010), 125–150.
H. Hatami, J. Hladký, S. Norine and A. Razborov, Non-three-colourable common graphs exist, Combinatorics, Probability and Computing 21 (2012), 734–742.
C. Jagger, P. Šťovíček and A. Thomason, Multiplicities of subgraphs, Combinatorica 16 (1996), 123–141.
N. Kamčev, A. Liebenau and N. Morrison, Towards a characterisation of Sidorenko systems, Quarterly Journal of Mathematics 74 (2023), 957–974.
J. H. Kim, C. Lee and J. Lee, Two approaches to Sidorenko’s conjecture, Transactions of the American Mathematical Society 368 (2016), 5057–5074.
J. X. Li and B. Szegedy, On the logarithmic calculus and Sidorenko’s conjecture, https://arxiv.org/abs/1107.1153.
R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia of Mathematics and its Applications, Vol. 20, Cambridge University Press, Cambridge, 1997.
A. Robertson and D. Zeilberger, A 2-coloring of [1, n] can have (1/22)n2+O(n) monochromatic Schur triples, but not less!, Electronic Journal of Combinatorics 5 (1998), Article no. R19.
V. Rödl and A. Ruciński, Rado partition theorem for random subsets of integers, Proceedings of the London Mathematical Society 74 (1997), 481–502.
A. Saad and J. Wolf, Ramsey multiplicity of linear patterns in certain finite abelian groups, Quarterly Journal of Mathematics 68 (2017), 125–140.
T. Schoen, The number of monochromatic Schur triples, European Journal of Combinatorics 20 (1999), 855–866.
A. F. Sidorenko, Cycles in graphs and functional inequalities, Matematicheskie Zametki 46 (1989), 72–79.
A. F. Sidorenko, A correlation inequality for bipartite graphs, Graphs and Combinatorics 9 (1993), 201–204.
B. Szegedy, An information theoretic approach to Sidorenko’s conjecture, https://arxiv.org/abs/1406.6738.
T. Tao and V. H. Vu, Additive Combinatorics, Cambridge Studies in Advanced Mathematics, Vol. 105, Cambridge University Press, Cambridge, 2006.
A. Thomason, A disproof of a conjecture of in Ramsey theory, Journal of the London Mathematical Society 39 (1989), 246–255.
A. Thomason, Graph products and monochromatic multiplicities, Combinatorica 17 (1997), 125–134.
L. Versteegen, Linear configurations containing 4-term arithmetic progressions are uncommon, Journal Combinatorial Theory. Series A 200 (2023), Article no. 105792.
J. Wolf, The minimum number of monochromatic 4-term progressions in ℤp, Journal of Combinatorics 1 (2010), 53–68.
Acknowledgements
Partially supported by the Australian research council (DP180103684) and by the European Union’s Horizon 2020 research and innovation programme [MSCA GA No 101038085]. Part of this research was carried out during the Graph Theory Downunder workshop at the mathematical research institute Matrix. We would like to thank Matrix for its support and hospitality. We would also like to thank the anonymous referee for their careful reading and very helpful comments.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution and reproduction in any medium, provided the appropriate credit is given to the original authors and the source, and a link is provided to the Creative Commons license, indicating if changes were made (https://creativecommons.org/licenses/by/4.0/).
Open Access funding enabled and organized by CAUL and its Member Institutions.
About this article
Cite this article
Kamčev, N., Liebenau, A. & Morrison, N. On uncommon systems of equations. Isr. J. Math. (2024). https://doi.org/10.1007/s11856-024-2649-2
Received:
Revised:
Published:
DOI: https://doi.org/10.1007/s11856-024-2649-2