Common and Sidorenko Linear Equations
Abstract
A linear equation with coefficients in Fq is common if the number of monochromatic solutions in any two-coloring of Fqn is asymptotically (as n ∞) 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 Fqn 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.