• Corpus ID: 239885930

Extremal Sidon sets are Fourier uniform, with applications to partition regularity

  title={Extremal Sidon sets are Fourier uniform, with applications to partition regularity},
  author={Miquel Ortega and Sean Prendiville},
Generalising results of Erdős-Freud and Lindström, we prove that the largest Sidon subset of a bounded interval of integers is equidistributed in Bohr neighbourhoods. We establish this by showing that extremal Sidon sets are Fourier-pseudorandom, in that they have no large non-trivial Fourier coefficients. As a further application we deduce that, for any partition regular equation in five or more variables, every finite colouring of an extremal Sidon set has a monochromatic solution. 


The apparent structure of dense Sidon sets
The correspondence between perfect difference sets and transitive projective planes is well-known. We observe that all known dense (i.e., close to square-root size) Sidon subsets of abelian groups
Gaps in dense sidon sets
We prove that if A ⊂ [1, N ] is a Sidon set with N1/2−L elements, then any interval I ⊂ [1, N ] of length cN contains c|A|+EI elements of A, with |EI | ≤ 52N(1+ c1/2N1/8)(1+L + N−1/8), L+ = max{0,
Let a,<&<... be a sequence of positive integers, and suppose that the suma czi+lzi (where i ,<j) are all different. Such sequences, called B, sequences by Sidont, occur in the theory of Fourier
Well Distribution of Sidon Sets in Residue Classes
Abstract A set A of non-negative integers is a Sidon set if the sums a + b ( a ,  b ∈ A ,  a ⩽ b ) are distinct. Assume that a ⊆[1,  n ] and that | A |=(1+ o (1)) n 1/2 . Let m ⩾2 be an integer. In
Ten lectures on the interface between analytic number theory and harmonic analysis
Uniform distribution van der Corput sets Exponential sums I: The methods of Weyl and van der Corput Exponential sums II: Vinogradov's method An introduction to Turan's method Irregularities of
On the Uniform Distribution in Residue Classes of Dense Sets of Integers with Distinct Sums
Abstract A set A ⊆{1, …,  N } is of the type B 2 if all sums a + b , with a ⩾ b , a ,  b ∈ A , are distinct. It is well known that the largest such set is of size asymptotic to N 1/2 . For a B 2 set
On the difference between consecutive primes
Update: This work reproduces an earlier result of Peck, which the author was initially unaware of. The method of the proof is essentially the same as the original work of Peck. There are no new
On sums of a Sidon-sequence
Let 1 ≤ a1 < … < ak ≤ n be a Sidon-sequence, i.e., ai + aj are all distinct, and denote by S(n) the maximal number of the sums ai + aj which are less than n. We prove 1 − 1√2 − e ≤ S(n)n ≤ 1π + e and
Combinatorial theorems in sparse random sets
We develop a new technique that allows us to show in a unified way that many well-known combinatorial theorems, including Tur\'an's theorem, Szemer\'edi's theorem and Ramsey's theorem, hold almost
On a conjecture of Erdős and Simonovits: Even cycles
This paper shows that the extremal C2ℓ∪{Ck}-free graphs are bipartite incidence graphs of generalized polygons and makes use of pseudorandomness properties of nearly extremal graphs that are of independent interest.