Related papers: A Small Maximal Sidon Set In $Z_2^n$
A subset $A$ of an additive abelian group is an $h$-Sidon set if every element in the $h$-fold sumset $hA$ has a unique representation as the sum of $h$ not necessarily distinct elements of $A$. Let $\mathbf{F}$ be a field of characteristic…
A family ${\mathcal A}$ of $k$-subsets of $\{1,2,\dots, N\}$ is a Sidon system if the sumsets $A+B$, $A,B\in \mathcal{A}$ are pairwise distinct. We show that the largest cardinality $F_k(N)$ of a Sidon system of $k$-subsets of $[N]$…
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…
New sets (typically found by computer search) with Sidon constant equal to the square root of their cardinalities are given. For each integer $N$ there are only a finite number of groups of prime order containing $N$-element extreme sets.…
We say that a set is a multiplicative 3-Sidon set if the equation $s_1s_2s_3=t_1t_2t_3$ does not have a solution consisting of distinct elements taken from this set. In this paper we show that the size of a multiplicative 3-Sidon subset of…
In his seminal work on Sidon sets, Pisier found an important characterization of Sidonicity: A set is Sidon if and only if it is proportionally quasi-independent. Later, it was shown that Sidon sets were proportionally `special' Sidon in…
The correspondence between perfect difference sets and transitive projective planes is well-known. We observe that all known dense (i.e., close to square-root size) Sidon subsets of abelian groups come from projective planes through a…
We prove that the diameter of a Sidon set (also known as a Babcock sequence, Golomb ruler, or $B_2$ set) with $k$ elements is at least $k^2-b k^{3/2}-O(k)$ where $b\le 1.96365$, a comparatively large improvement on past results.…
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…
Let $\left\{a_1, \dots, a_n\right\} \subset \mathbb{N}$ be a set of positive integers, $a_n$ denoting the largest element, so that for any two of the $2^n$ subsets the sum of all elements is distinct. Erd\H{o}s asked whether this implies…
In answer to a question raised recently by Bourgain and Lewko, we show, with their paper's terminology, that any uniformly bounded $\psi_2 (C)$-orthonormal system ($\psi_2 (C)$ is a variant of subGaussian)is 2-fold tensor Sidon. This…
We extend the concepts of sum-free sets and Sidon-sets of combinatorial number theory with the aim to provide explicit constructions for spherical designs. We call a subset $S$ of the (additive) abelian group $G$ {\it $t$-free} if for all…
A subset $E$ of a discrete abelian group is called $\epsilon $-Kronecker if all $E$-functions of modulus one can be approximated to within $\epsilon$ by characters. $E$ is called a Sidon set if all bounded $E$-functions can be interpolated…
For a set $A$ of $k$ elements from an additive abelian group $G$ and a positive integer $r \leq k$, we consider the set of elements of $G$ that can be written as a sum of $h$ elements of $A$ with at least $r$ distinct elements. We denote…
We obtain a new lower bound on the largest Sidon subset of an arbitrary finite set of integers. If $H(n)$ denotes the minimum, over all $n$-element subsets of $\mathbb Z$, of the largest Sidon subset they contain, we prove that $H(n)…
Let $k \ge 2$ be an integer. We say a set $A$ of positive integers is an asymptotic basis of order $k$ if every large enough positive integer can be represented as the sum of $k$ terms from $A$. A set of positive integers $A$ is called…
We highlight a certain compactness of Sidon sets and $B_2[g]$-sets and provide several applications. Notably, we prove the existence of such sets that maximize certain functions. In particular, we show the existence of a Sidon set whose…
Erd\"os conjectured the existence of an infinite Sidon sequence of positive integers which is also an asymptotic basis of order 3. We make progress towards this conjecture in several directions. First we prove the conjecture for all cyclic…
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…