• Corpus ID: 115769326

# Gaps in dense sidon sets

```@inproceedings{Cilleruelo2000GapsID,
title={Gaps in dense sidon sets},
author={Javier Cilleruelo},
year={2000}
}```
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, L}. In particular, if |A| = N + O(N), and g(A) is the maximum gap in A, we deduce that g(A) ? N. Also we prove that, under this condition, the exponent 3/4 is sharp.
12 Citations
SIDON SETS IN N
We study finite and infinite Sidon sets in N. The additive energy of two sets is used to obtain new upper bounds for the cardinalities of finite Sidon subsets of some sets as well as to provide short
A NOTE ON B2[G] SETS
Suppose g is a fixed positive integer. For N ≥ 2, a set A ⊂ Z ⋂ [1, N ] is called a B2[g] set if every integer n has at most g distinct representations as n = a + b with a, b ∈ A and a ≤ b. In this
New Upper Bounds for Finite Bh Sequences
Abstract Let F h ( N ) be the maximum number of elements that can be selected from the set {1, …,  N } such that all the sums a 1 +…+ a h , a 1 ⩽…⩽ a h are different. We introduce new combinatorial
Sidon sets in Nd
In this thesis we investigate graphs that are constructed using objects from additive number theory. Sidon sets are used to construct C₄-free graphs that show ex( q² - q - 2 , C₄) > 1/2q³ - q² -
Extremal Sidon sets are Fourier uniform, with applications to partition regularity
• Mathematics
• 2021
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
On an application of higher energies to Sidon sets
Sidon sets is a classical object of Combinatorial Number theory, which was introduced by S. Sidon in [24]. A subset S of an abelian group G is a Sidon set iff all its non–zero differences are
An Ordered Turán Problem for Bipartite Graphs
An ordered version of the Turan problem for bipartite graphs is introduced and the Turan number of \$F\$, written \$\textrm{ex}(n,F)\$, is investigated and shown to be the maximum number of edges in an F-free graph with \$n\$ vertices.
for bipartite graphs
Let F be a graph. A graph G is F -free if it does not contain F as a subgraph. The Tur an number of F , written ex(n;F ), is the maximum number of edges in an

## References

SHOWING 1-10 OF 11 REFERENCES
ON A PROBLEM OF SIDON IN ADDITIVE NUMBER THEORY, AND ON SOME RELATED PROBLEMS
• Mathematics
• 2002
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
On a problem of sidon in additive number theory, and on some related problems
• Mathematics
• 1941
To the memory of S. Sidon. Let 0 < a, < a,. .. be an infinite sequence of positive integers. Denote by f(n) the number of solutions of n=a i +a;. About twenty years ago, SIDON 1) raised the question
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
B h sequences
Let A be a set (finite or infinite) of natural numbers, and let a i denote a generic element of A. We say that A is a B h sequence if the sums of the form a 1 + … + a h (a 1 ≤ … ≤ a h ) are all
Solving a linear equation in a set of integers I
(1.1) a1x1 + . . .+ akxk = b with x1, . . . , xk in a prescribed set of integers. We saw that the vanishing of the constant term b and the sum of coefficients s = a1 + . . . + ak had a strong effect
Analytic Number Theory : Proceedings of a Conference In Honor of Heini Halberstam Volume 1
• Mathematics
• 1996
An estimate for Heilbronn's exponential sum, D.R. Heath-Brown On B3 sequences, M. Helm On an elementary inequality in the theory of Diophantine approximation, C. Hooley The integer points close to a
Theorems in the additive theory of numbers