Local aspects of the Sidorenko property for linear equations

Altman, Daniel

Forum of Mathematics, Sigma, Tome 13 (2025) no. 1, p. e177

Résumé

A system of linear equations in $\mathbb {F}_p^n$ is Sidorenko if any subset of $\mathbb {F}_p^n$ contains at least as many solutions to the system as a random set of the same density, asymptotically as $n\to \infty $. A system of linear equations is common if any two-colouring of $\mathbb {F}_p^n$ yields at least as many monochromatic solutions to the system of equations as a random 2-colouring, asymptotically as $n\to \infty $. Both classification problems remain wide open despite recent attention.We show that a certain generic family of systems of two linear equations is not Sidorenko. In fact, we show that systems in this family are not locally Sidorenko, and that systems in this family which do not contain additive tuples are not weakly locally Sidorenko. This endeavour answers a conjecture and question of Kamčev–Liebenau–Morrison. Insofar as methods, we observe that the true complexity of a linear system is not maintained under Fourier inversion; our main novelty is the use of higher-order methods in the frequency space of systems which have complexity one. We also give a shorter proof of the recent result of Kamčev–Liebenau–Morrison and independently Versteegen that any linear system containing a four-term arithmetic progression is uncommon.

Détail

DOI : 10.1017/fms.2025.10128

Bibliographie

[AL25] Altman, D. and Liebenau, A., ‘On the uncommonness of minimal rank-2 systems of linear equations’, Bull. Lond. Math. Soc., 2025. https://doi.org/10.1112/blms.70135. Google Scholar | DOI

[Alt23] Altman, D., ‘On a common-extendable, non-Sidorenko linear system’, Comb. Theory, 3(3):Paper No. 5, 12, 2023. Google Scholar

[BR80] Burr, S. A. and Rosta, V., ‘On the Ramsey multiplicities of graphs—problems and recent results’, J. Graph Theory 4(4):347–361, 1980.10.1002/jgt.3190040403 Google Scholar | DOI

[CFS10] Conlon, D., Fox, J., and Sudakov, B., ‘An approximate version of Sidorenko’s conjecture’, Geom. Funct. Anal. 20(6):1354–1366, 2010.10.1007/s00039-010-0097-0 Google Scholar | DOI

[CHL22] Cs’Oka, E., Hubai, T., and Lov’Asz, L. M., ‘Locally common graphs’, J. Graph Theory 102:472–483, 2022.10.1002/jgt.22881 Google Scholar | DOI

[CKLL18] Conlon, D., Kim, J. H., Lee, C., and Lee, J., ‘Some advances on Sidorenko’s conjecture’, J. Lond. Math. Soc. (2) 98(3):593–608, 2018.10.1112/jlms.12142 Google Scholar | DOI

[CL17] Conlon, D. and Lee, J., ‘Finite reflection groups and graph norms’, Adv. Math. 315:130–165, 2017.10.1016/j.aim.2017.05.009 Google Scholar | DOI

[CL21] Conlon, D. and Lee, J., ‘Sidorenko’s conjecture for blow-ups’, Discrete Anal., page 21472, 2021. Google Scholar

[DLZ24] Dong, D., Li, A., and Zhao, Y., ‘Uncommon linear systems of two equations’, , 2024. Google Scholar | arXiv

[Erd62] Erdős, P., ‘On the number of complete subgraphs contained in certain graphs’, Magyar Tud. Akad. Mat. Kutató Int. Közl. 7:459–464, 1962. Google Scholar

[FPZ21] Fox, J., Pham, H. T., and Zhao, Y., ‘Common and Sidorenko linear equations’, Q. J. Math. 72(4):1223–1234, 2021.10.1093/qmath/haaa068 Google Scholar | DOI

[FW17] Fox, J. and Wei, F., ‘On the local approach to Sidorenko’s conjecture’, Electron. Notes Discret. Math. 61:459–465, 2017.10.1016/j.endm.2017.06.074 Google Scholar | DOI

[Goo59] Goodman, A. W., ‘On sets of acquaintances and strangers at any party’, Amer. Math. Mon. 66:778–783, 1959.10.1080/00029890.1959.11989408 Google Scholar | DOI

[Gow20] Gowers, W. T., ‘A uniform set with fewer than expected arithmetic progressions of length 4’, Acta Math. Hungar. 161(2):756–767, 2020.10.1007/s10474-020-01072-z Google Scholar | DOI

[Gre07] Green, B., ‘Montréal notes on quadratic Fourier analysis’, in Additive Combinatorics, vol. 43 of CRM Proc. Lecture Notes, 69–102, American Mathematical Society, Providence, RI, 2007.10.1090/crmp/043/06 Google Scholar | DOI

[GW10] Gowers, W. T. and Wolf, J., ‘The true complexity of a system of linear equations’, Proc. Lond. Math. Soc. (3) 100(1):155–176, 2010.10.1112/plms/pdp019 Google Scholar | DOI

[GW11a] Gowers, W. T. and Wolf, J., ‘Linear forms and higher-degree uniformity for functions on ’, Geom. Funct. Anal. 21(1):36–69, 2011.10.1007/s00039-010-0106-3 Google Scholar | DOI

[GW11b] Gowers, W. T. and Wolf, J., ‘Linear forms and quadratic uniformity for functions on ’, Mathematika 57(2):215–237, 2011.10.1112/S0025579311001264 Google Scholar | DOI

[Hat10] Hatami, H., ‘Graph norms and Sidorenko’s conjecture’, Israel J. Math. 175:125–150, 2010.10.1007/s11856-010-0005-1 Google Scholar | DOI

[HKKV22] Hancock, R., Král’, D., Krnc, M., and Volec, J., ‘Toward characterizing locally common graphs’, Random Struct. Algorithms 62:181–218, 2022.10.1002/rsa.21099 Google Scholar | DOI

[JvT96] Jagger, C., Šťovíček, P., and Thomason, A., ‘Multiplicities of subgraphs’, Combinatorica 16(1):123–141, 1996.10.1007/BF01300130 Google Scholar | DOI

[KLL16] Kim, J. H., Lee, C., and Lee, J., ‘Two approaches to Sidorenko’s conjecture’, Trans. Amer. Math. Soc. 368(7):5057–5074, 2016.10.1090/tran/6487 Google Scholar | DOI

[KLM23] Kamčev, N., Liebenau, A., and Morrison, N., ‘Towards a characterization of Sidorenko systems’, Q. J. Math. 74(3):957–974, 2023.10.1093/qmath/haad013 Google Scholar | DOI

[KLM24] Kamčev, N., Liebenau, A., and Morrison, N., ‘On uncommon systems of equations’, Israel J. Math. 264(1):331–362, 2024.10.1007/s11856-024-2649-2 Google Scholar | DOI

[KLP22] Král’, D., Lamaison, A., and Pach, P. P., ‘Common systems of two equations over the binary field’, in Discrete Math. Days, Conf. Proc., 2022, 169–173. Extended abstracts available at https://dmd2022.unican.es/978-84-19024-03-9.pdf. Google Scholar

[Lov11] Lovász, L., ‘Subgraph densities in signed graphons and the local Simonovits–Sidorenko conjecture’, Electron. J. Combin. 18(1):Paper 127, 21, 2011.10.37236/614 Google Scholar | DOI

[Lov12] Lovász, L., Large Networks and Graph Limits, Amer. Math. Soc. Colloq. Publ. 60, American Mathematical Society, Providence, RI, 2012. Google Scholar

[LS11] Li, J. X. and Szegedy, B., ‘On the logarithmic calculus and Sidorenko’s conjecture’, , 2011. Google Scholar | arXiv

[Sid89] Sidorenko, A. F., ‘Cycles in graphs and functional inequalities’, Mat. Zametki 46(5):72–79, 104, 1989. Google Scholar

[Sid91] Sidorenko, A. F., ‘Inequalities for functionals generated by bipartite graphs’, Diskret. Mat. 3(3):50–65, 1991. Google Scholar

[Sid93] Sidorenko, A. F., ‘A correlation inequality for bipartite graphs’, Graphs Combin. 9(2):201–204, 1993.10.1007/BF02988307 Google Scholar | DOI

[SW17] Saad, A. and Wolf, J., ‘Ramsey multiplicity of linear patterns in certain finite abelian groups’, Q. J. Math. 68(1):125–140, 2017. Google Scholar

[Sze14] Szegedy, B., ‘An information theoretic approach to Sidorenko’s conjecture’, , 2014. Google Scholar | arXiv

[Tho89] Thomason, A., ‘A disproof of a conjecture in Ramsey theory’, J. Lond. Math. Soc. (2) 39(2):246–255, 1989.10.1112/jlms/s2-39.2.246 Google Scholar | DOI

[Ver21] Versteegen, L., ‘Linear configurations containing 4-term arithmetic progressions are uncommon’, J. Combin. Theory Ser. A 200:105792, 2021. Google Scholar

[Zha23] Zhao, Y., Graph Theory and Additive Combinatorics—Exploring Structure and Randomness, Cambridge University Press, Cambridge, 2023.10.1017/9781009310956 Google Scholar | DOI