2000 character limit reached
On the uncommonness of minimal rank-2 systems of linear equations
Published 29 Apr 2024 in math.CO, math.NT, and math.PR | (2404.18908v1)
Abstract: We prove that suitably generic pairs of linear equations on an even number of variables are uncommon. This verifies a conjecture of Kam\v{c}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.
- D. Altman. Local aspects of the sidorenko property for linear equations. arXiv preprint arXiv:2210.17493, 2022.
- S. A. Burr and V. Rosta. On the Ramsey multiplicities of graphs—problems and recent results. J. Graph Theory, 4(4):347–361, 1980.
- An approximate version of Sidorenko’s conjecture. Geom. Funct. Anal., 20(6):1354–1366, 2010.
- Some advances on Sidorenko’s conjecture. J. Lond. Math. Soc. (2), 98(3):593–608, 2018.
- D. Conlon and J. Lee. Sidorenko’s conjecture for blow-ups. Discrete Anal., page 21472, 2021.
- Uncommon linear systems of two equations. arXiv:2404.17005, 2024.
- P. Erdős. On the number of complete subgraphs contained in certain graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl., 7:459–464, 1962.
- Common and Sidorenko Linear Equations. Q. J. Math. To appear.
- A. W. Goodman. On sets of acquaintances and strangers at any party. Amer. Math. Monthly, 66:778–783, 1959.
- H. Hatami. Graph norms and Sidorenko’s conjecture. Israel J. Math., 175:125–150, 2010.
- Multiplicities of subgraphs. Combinatorica, 16(1):123–141, 1996.
- On uncommon systems of equations, 2022.
- Towards a characterization of Sidorenko systems. Q. J. Math., 74(3):957–974, 2023.
- Two approaches to Sidorenko’s conjecture. Trans. Amer. Math. Soc., 368(7):5057–5074, 2016.
- J. X. Li and B. Szegedy. On the logarithmic calculus and Sidorenko’s conjecture. arXiv:1107.1153, 2011.
- D. L. McLeish. Dependent central limit theorems and invariance principles. Ann. Probability, 2:620–628, 1974.
- A. Saad and J. Wolf. Ramsey multiplicity of linear patterns in certain finite abelian groups. Q. J. Math., 68(1):125–140, 2017.
- A. F. Sidorenko. Cycles in graphs and functional inequalities. Mat. Zametki, 46(5):72–79, 104, 1989.
- A. F. Sidorenko. A correlation inequality for bipartite graphs. Graphs Combin., 9(2):201–204, 1993.
- B. Szegedy. An information theoretic approach to Sidorenko’s conjecture. arXiv:1406.6738, 2014.
- A. Thomason. A disproof of a conjecture of in Ramsey theory. J. London Math. Soc. (2), 39(2):246–255, 1989.
- L. Versteegen. Linear configurations containing 4-term arithmetic progressions are uncommon. arXiv:2106.06846, 2021.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.