Common and Sidorenko Linear Equations
Jacob Fox, Huy Tuan Pham, Yufei Zhao

TL;DR
This paper characterizes which linear equations over finite fields are common or Sidorenko, using a novel Fourier coefficient construction to identify equations lacking these properties, thus solving open problems.
Contribution
It provides a complete characterization of common and Sidorenko linear equations over finite fields, introducing a new Fourier-based construction to demonstrate non-properties.
Findings
Identifies which linear equations are common in finite fields.
Identifies which linear equations are Sidorenko in finite fields.
Introduces a Fourier coefficient construction to show non-properties.
Abstract
A linear equation with coefficients in is common if the number of monochromatic solutions in any two-coloring of is asymptotically (as ) at least the number expected in a random two-coloring. The linear equation is Sidorenko if the number of solutions in any dense subset of is asymptotically at least the number expected in a random set of the same density. In this paper, we characterize those linear equations which are common, and those which are Sidorenko. The main novelty is a construction based on choosing random Fourier coefficients that shows that certain linear equations do not have these properties. This solves problems posed in a paper of Saad and Wolf.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Graph theory and applications
