On uncommon systems of equations

DOI10.1007/S11856-024-2649-2MaRDI QIDQ6660134zbMATH OpenFDO

Authors Nina Kamčev, Anita Liebenau, Natasha Morrison

Publication date 10 January 2025

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11856-024-2649-2

zbMATH Keywords

additive combinatoricslinear homogeneous equationSidorenko's conjecture

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10) Other combinatorial number theory (11B75)

Recommendations

• On a common-extendable, non-Sidorenko linear system
• Common and Sidorenko linear equations
• Towards a characterization of Sidorenko systems
• Linear configurations containing 4-term arithmetic progressions are uncommon
• Common and Sidorenko equations in abelian groups

Cites work

• A 2-coloring of \([1, N]\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less
• A correlation inequality for bipartite graphs
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• A uniform set with fewer than expected arithmetic progressions of length 4
• Additive combinatorics
• An approximate version of Sidorenko's conjecture
• Common and Sidorenko linear equations
• Generalizations of Fourier analysis, and how to apply them
• Graph norms and Sidorenko's conjecture
• Graph products and monochromatic multiplicities
• scientific article; zbMATH DE number 4135981 (Why is no real title available?)
• scientific article; zbMATH DE number 3188526 (Why is no real title available?)
• Linear configurations containing 4-term arithmetic progressions are uncommon
• Multiplicities of subgraphs
• Non-three-colourable common graphs exist
• On monochromatic solutions of equations in groups
• On Schur properties of random subsets of integers
• On Sets of Acquaintances and Strangers at any Party
• On the number of monochromatic Schur triples.
• On the Ramsey multiplicities of graphs—problems and recent results
• On the Ramsey multiplicity of complete graphs
• Rado Partition Theorem for Random Subsets of Integers
• Ramsey multiplicity of linear patterns in certain finite abelian groups
• Sidorenko's conjecture for blow-ups
• Some advances on Sidorenko's conjecture
• The minimum number of monochromatic 4-term progressions in Z_p
• The number of monochromatic Schur triples
• There exist graphs with super‐exponential Ramsey multiplicity constant
• Toward characterizing locally common graphs
• Towards a characterization of Sidorenko systems
• Two approaches to Sidorenko's conjecture

Cited in

(7)

• Common and Sidorenko equations in abelian groups
• Towards a characterization of Sidorenko systems
• On a common-extendable, non-Sidorenko linear system
• A new family of Sidorenko linear configurations
• Common pairs of graphs
• On the uncommonness of minimal rank-2 systems of linear equations
• Local aspects of the Sidorenko property for linear equations

This page was built for publication: On uncommon systems of equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660134)