Related papers: Sidon sets are proportionally Sidon with small Sid…
A set $S\subset\{1,2,...,n\}$ is called a Sidon set if all the sums $a+b~~(a,b\in S)$ are different. Let $S_n$ be the largest cardinality of the Sidon sets in $\{1,2,...,n\}$. In a former article, the author proved the following asymptotic…
A Sidon set is a set of the positive integers such that the sums of two pairs is not repeated. I. Ruzsa gave a probabilistic construction of an infinite Sidon set. In this work we present the details of a simplified proof of this…
Generalising results of Erd\H{o}s-Freud and Lindstr\"om, 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…
A set A of positive integers is called a perfect difference set if every nonzero integer has an unique representation as the difference of two elements of A. We construct dense perfect difference sets from dense Sidon sets. As a consequence…
A family $\mathcal{F}\subset 2^G$ of subsets of an abelian group $G$ is a Sidon system if the sumsets $A+B$ with $A,B\in \mathcal{F}$ are pairwise distinct. Cilleruelo, Serra and the author previously proved that the maximum size $F_k(n)$…
A Sidon set is a set A of integers such that no integer has two essentially distinct representations as the sum of two elements of A. More generally, for every positive integer g, a B_2[g]-set is a set A of integers such that no integer has…
Using a new graphical representation for partitions, the author obtains a family of partition identities associated with partitions into distinct parts of an arithmetic progression, or, more generally, with partitions into distinct parts of…
A finite set $S \subset \mathbb{Z}$ is a Sidon set if its pairwise differences are distinct. Recall that a perfect difference set (PDS) of order $n$ is a set $B \subset \mathbb{Z}_v$ ($v = n^2 - n + 1$) of size $n$ such that every nonzero…
A Sidon set $S$ in $\mathbb{F}_2^n$ is a set such that $x+y=z+w$ has no solutions $x,y,z,w \in S$ with $x,y,z,w$ all distinct. In this paper, we prove various results on Sidon sets by using or generalizing known cryptographic results. In…
The Sidon constant for the index set of nonzero m-homogeneous polynomials P in n complex variables is the supremum of the ratio between the l^1 norm of the coefficients of P and the supremum norm of P in D^n. We present an estimate which…
A set $S$ of natural numbers is multiplicative Sidon if the products of all pairs in $S$ are distinct. Erd\H{o}s in 1938 studied the maximum size of a multiplicative Sidon subset of $\{1,\ldots, n\}$, which was later determined up to the…
We prove that a uniformly bounded system of orthonormal functions satisfying the $\psi_2$ condition: (1) must contain a Sidon subsystem of proportional size, (2) must satisfy the Rademacher-Sidon property, and (3) must have its 5-fold…
In this entry point into the subject, combining two elementary proofs, we decrease the gap between the upper and lower bounds by $0.2\%$ in a classical combinatorial number theory problem. We show that the maximum size of a Sidon set of $\{…
We prove that every infinite, discrete abelian group admits a pair of $I_0$ sets whose union is not $I_0$. In particular, this implies that every such group contains a Sidon set that is not $I_{0}$.
A Sidon set $S$ in $\mathbb{F}_2^n$ is a set such that the pairwise sums of distinct points are all distinct. The exclude points of a Sidon set $S$ are the sums of three distinct points in $S$, and the exclude multiplicity of a point in…
We study the maximum size of Sidon sets in unions of integers intervals. If $A\subseteq\mathbb{N}$ is the union of two intervals and if $\left| A \right|=n$ (where $\left| A \right|$ denotes the cardinality of $A$), we prove that $A$…
A Sidon set $M$ is a subset of $\mathbb{F}_2^t$ such that the sum of four distinct elements of $M$ is never 0. The goal is to find Sidon sets of large size. In this note we show that the graphs of almost perfect nonlinear (APN) functions…
A set $S\subset \mathbb{N}$ is a Sidon set if all pairwise sums $s_1+s_2$ (for $s_1, s_2\in S$, $s_1\leq s_2$) are distinct. A set $S\subset \mathbb{N}$ is an asymptotic basis of order 3 if every sufficiently large integer $n$ can be…
A set $A$ of nonnegative integers is called a Sidon set if there is no Sidon 4-tuple, i.e., $(a,b,c,d)$ in $A$ with $a+b=c+d$ and $\{a, b\}\cap \{c, d\}=\emptyset$. Cameron and Erd\H os proposed the problem of determining the number of…
We presents an independence relation on sets, one can define dimension by it, assuming that we have an abstract elementary class with a forking notion that satisfies the axioms of a good frame minus stability.