Generalized sidon sets

@article{Cilleruelo2009GeneralizedSS,
  title={Generalized sidon sets},
  author={Javier Cilleruelo and Imre Z. Ruzsa and Carlos Vinuesa},
  journal={Advances in Mathematics},
  year={2009},
  volume={225},
  pages={2786-2807}
}
We give asymptotic sharp estimates for the cardinality of a set of residue classes with the property that the representation function is bounded by a prescribed number. We then use this to obtain an analogous result for sets of integers, answering an old question of Simon Sidon. 
On Additive Representative Functions
TLDR
This paper gives a short survey of additive representation functions on their regularity properties and value distribution and proves a couple of new results and presents many related unsolved problems. Expand
Sidon sets in Nd
  • J. Cilleruelo
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 2010
TLDR
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 proofs of already known results. Expand
Improved bounds on the supremum of autoconvolutions
We give a slight improvement of the best known lower bound for the supremum of autoconvolutions of nonnegative functions supported in a compact interval. Also, by means of explicit examples weExpand
Popular differences and generalized Sidon sets
Abstract For a subset A ⊆ [ N ] , we define the representation function r A − A ( d ) : = # { ( a , a ′ ) ∈ A × A : d = a − a ′ } and define M D ( A ) : = max 1 ≤ d D ⁡ r A − A ( d ) for D > 1 . WeExpand
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 areExpand
Threshold functions and Poisson convergence for systems of equations in random sets
We study threshold functions for the existence of solutions to linear systems of equations in random sets and present a unified framework which includes arithmetic progressions, sum-free sets,Expand
On symmetric intersecting families
TLDR
It is proved that a symmetric intersecting family of k-element subsets of 1,2, n of sets has size at most where $c > 0$ is a universal constant. Expand
SYMMETRY AND COLORINGS: SOME RESULTS AND OPEN PROBLEMS, II
We survey some principal results and open problems related to colorings of geometric and algebraic objects endowed with symmetries. We concentrate the exposition on the maximal symmetry numbersExpand
On sidon sequences of farey sequences, square roots and reciprocals
Abstract In this paper, I will construct three families of Sidon sequences of certain subsets of ℝ, in particular I will study Farey sequences, square roots, and reciprocals. It will be shown thatExpand
Generalized difference sets and autocorrelation integrals
In 2010, Cilleruelo, Ruzsa, and Vinuesa established a surprising connection between the maximum possible size of a generalized Sidon set in the first $N$ natural numbers and the optimal constant inExpand
...
1
2
3
...

References

SHOWING 1-10 OF 59 REFERENCES
Representations of Integers as the Sum of k Terms
TLDR
It is proved that, for every fixed k, there exists an asymptotic basis of order k such that the number of representations of n is Θ(log n). Expand
An Upper Bound for B2[2] Sequences
  • J. Cilleruelo
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 2000
TLDR
A new counting method is introduced to deal with B2[2] sequences, getting a new upper bound for the size of these sequences, F(N, 2)?6N+1. Expand
Sums of Dilates
  • B. Bukh
  • Computer Science, Mathematics
  • Combinatorics, Probability and Computing
  • 2008
TLDR
An asymptotically sharp lower bound on the size of sumsets of the form λ1ċA+ċċ ċ+λkA for arbitrary integers, and an upper bound for such sums, which is similar to, but often stronger than Plünnecke's inequality. Expand
A New Upper Bound for B2[2] Sets
  • A. Plagne
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 2001
A new upper bound for the cardinality of finite B22] sets is obtained, namely F2(N, 2)<2.363584N for N sufficiently large. This improves on a recent result by Cilleruelo.
An upper bound for B 2 (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 thisExpand
Constructions of generalized Sidon sets
We give explicit constructions of sets S with the property that for each integer k, there are at most g solutions to k = S1 + s2, si ∈ S; such sets are called Sidon sets if g = 2 and generalizedExpand
Probabilistic constructions of B2[g] sequences
AbstractWe use the probabilistic method to prove that for any positive integer g there exists an infinite B2[g] sequence $$ \mathcal{A} $$ = {ak} such that ak ≤ k2+1/g(log k)1/g+o(1) as k→∞. TheExpand
Sidon sets in Nd
  • J. Cilleruelo
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 2010
TLDR
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 proofs of already known results. Expand
Additive combinatorics
  • T. Tao, V. Vu
  • Computer Science
  • Cambridge studies in advanced mathematics
  • 2007
TLDR
The circle method is introduced, which is a nice application of Fourier analytic techniques to additive problems and its other applications: Vinogradov without GRH, partitions, Waring’s problem. Expand
Improved bounds on the supremum of autoconvolutions
We give a slight improvement of the best known lower bound for the supremum of autoconvolutions of nonnegative functions supported in a compact interval. Also, by means of explicit examples weExpand
...
1
2
3
4
5
...