On the uncommonness of minimal rank-2 systems of linear equations
Preprint
Abstract
We prove that suitably generic pairs of linear equations on an even number of variables are uncommon. This verifies a conjecture of Kamčev, Morrison and the second author. Moreover, we prove that any large system containing such a $(2\times k)$-system as a minimal subsystem is uncommon.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Local aspects of the Sidorenko property for linear equationsForum of Mathematics, Sigma, 2025
- Linear configurations containing 4-term arithmetic progressions are uncommonJournal of Combinatorial Theory, Series A, 2023
- Common and Sidorenko Linear EquationsThe Quarterly Journal of Mathematics, 2021
- Two approaches to Sidorenko’s conjectureTransactions of the American Mathematical Society, 2015
- An Approximate Version of Sidorenko’s ConjectureGeometric and Functional Analysis, 2010
- Graph norms and Sidorenko’s conjectureIsrael Journal of Mathematics, 2010
- Multiplicities of subgraphsCombinatorica, 1996
- A correlation inequality for bipartite graphsGraphs and Combinatorics, 1993
- Cycles in graphs and functional inequalitiesMathematical Notes, 1989
- On the Ramsey multiplicities of graphs—problems and recent resultsJournal of Graph Theory, 1980