• Corpus ID: 44313019

# SIDON SETS IN N

@inproceedings{Cilleruelo2008SIDONSI,
title={SIDON SETS IN N},
author={Javier Cilleruelo},
year={2008}
}
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 proofs of already known results. We also disprove a conjecture of Lindstrom on the largest Sidon set in [1, N ]× [1, N ] and relate it to a known conjecture of Vinogradov concerning the size of the smallest quadratic residue modulo a prime p. For infinite Sidon sets A ⊂ N, we prove that lim infn…
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,
An upper bound on the size of Sidon sets
• Mathematics
ArXiv
• 2021
It is shown that the maximum size of a Sidon set of {1, 2, . . . , n} is at most √n+ 0.998n for sufficiently large n.
A note on Sidon-Ramsey numbers
• Mathematics
• 2021
Given a positive integer k, the Sidon-Ramsey number SR(k) is defined as the minimum n such that in every partition of [1, n] into k parts there is a part containing two pairs of numbers with the same
QUASI SIDON SETS
We study sets of integers A with |A− A| close to |A| and prove that |A| < √ n + √ |A|2 − |A−A| for any set A ⊂ {1, . . . , n}. For infinite sequences of positive integers A = (an) we define An = {a1,
On Sidon sets in a random set of vectors
For positive integers $d$ and $n$, let $[n]^d$ be the set of all vectors $(a_1,a_2,\dots, a_d)$, where $a_i$ is an integer with $0\leq a_i\leq n-1$. A subset $S$ of $[n]^d$ is called a \emph{Sidon
Generalization of a theorem of Erdős and Rényi on Sidon sequences
• Mathematics, Computer Science
Random Struct. Algorithms
• 2010
Erdős and Rényi claimed and Vu proved that for all h ≥ 2 and for all ϵ > 0, there exists g = gh(ϵ) and a sequence of integers A such that the number of ordered representations of any number as a sum
Bounds for generalized Sidon sets
• Mathematics
Discret. Math.
• 2015
Sets of integers avoiding congruent subsets
• R. Tesoro
• Mathematics
Electron. Notes Discret. Math.
• 2013
Threshold functions and Poisson convergence for systems of equations in random sets
• Mathematics, Computer Science
• 2018
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,
k-Fold Sidon Sets
• Mathematics
Electron. J. Comb.
• 2014
It is proved that for any integer $k \geq 1$, a -fold Sidon set A \subset [N] has at most $(N/k)^{1/2} + O((c_k^2N/ k)^{ 1/4})$ elements.