• 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
Sum of elements in finite Sidon sets II
. A set S ⊂ { 1 , 2 , ..., n } is called a Sidon set if all the sums a + b ( a, b ∈ S ) are diﬀerent. Let S n be the largest cardinality of the Sidon sets in { 1 , 2 , ..., n } . In a former article,
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