Refined estimates concerning sumsets contained in the roots of unity
Brandon Hanson, Giorgis Petridis
Abstract
We prove that the clique number of the Paley graph is at most p / 2 + 1 , and that any supposed additive decompositions of the set of quadratic residues can only come from co-Sidon sets.
Topics & Concepts
MathematicsCliqueCombinatoricsGraphQuadratic equationClique numberSet (abstract data type)Discrete mathematicsParity (physics)Perfect graphAdditive functionLimits and Structures in Graph TheoryAnalytic Number Theory ResearchAdvanced Harmonic Analysis Research