Related papers: An upper bound on the size of Sidon sets

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…

What is the smallest size of a family of subsets of $[n]$ such that it does not contain an induced copy of $Q_2$ as a poset (known as the \textit{diamond}), but adding a new set creates such a copy? It is easy to see that a maximal chain…

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…

We use Sidon sets to present an elementary method to study some combinatorial problems in finite fields, such as sum product estimates, solubility of some equations and distribution of sequences in small intervals. We obtain classic and…

A symmetric subset of the reals is one that remains invariant under some reflection x --> c-x. Given 0 < x < 1, there exists a real number D(x) with the following property: if 0 < d < D(x), then every subset of [0,1] with measure x contains…

A subset of the Hamming cube over $n$-letter alphabet is said to be $d$-maximal if its diameter is $d$, and adding any point increases the diameter. Our main result shows that each $d$-maximal set is either of size at most $(n+o(n))^d$ or…

We study the maximum size of a subset of the $n \times n$ integer grid that does not contain specific geometric configurations, a variation of the classical problems initiated by Erd\H{o}s and Purdy. While extremal problems for 3-point…

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.…

Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal.

A cap set is a subset of $\mathbb{F}_3^n$ with no solutions to $x+y+z=0$ other than when $x=y=z$. In this paper, we provide a new lower bound on the size of a maximal cap set. Building on a construction of Edel, we use improved…

This note presents an upper bound of $1.252 n$ on the size of a set system that satisfies the mod-6 town rules. Under these rules the sizes of the sets are not congruent to $0\bmod 6$ while the sizes of all pairwise intersections are…

Dorais asked for the maximum guaranteed size of a dimension $d$ subposet of an $n$-element poset. A lower bound of order $\sqrt{n}$ was found by Goodwillie. We provide a sublinear upper bound for each $d$. For $d=2$, our bound is…

The problem of bounding the size of a set system under various intersection restrictions has a central place in extremal combinatorics. We investigate the maximum number of disjoint pairs a set system can have in this setting. In…

Given a size-$k$ subset $S$ of a group $G$, how large can the product set $S^n$ be? We study this question, at several layers of refinement, for the infinite dihedral group. First, we give an explicit formula for the maximum size of $S^n$…

We prove that if $A=\{a_1,\dots ,a_{|A|}\}\subset \{1,2,\dots ,n\}$ is a Sidon set so that $|A|=n^{1/2}-L^\prime$, then $$a_m = m\cdot n^{1/2} + \mathcal O\left( n^{7/8}\right) + \mathcal O\left(L^{1/2}\cdot n^{3/4}\right)$$ where…

We study s(k,n), the maximum size of A+A where A is a k-subset of [n]. A few known functions from additive number theory can be expressed via s(k,n). For example, our estimates of s(k,n) imply new bounds on the maximum size of quasi-Sidon…

Let n(2,k) denote the largest integer n for which there exists a set A of k nonnegative integers such that the sumset 2A contains {0,1,2,...,n-1}. A classical problem in additive number theory is to find an upper bound for n(2,k). In this…

We show that for any finite set $A$ and an arbitrary $\varepsilon>0$ there is $k=k(\varepsilon)$ such that the higher energy ${\mathsf{E}}_k(A)$ is at most $|A|^{k+\varepsilon}$ unless $A$ has a very specific structure. As an application we…

Let n be a nonzero integer and assume that a set S of positive integers has the property that xy+n is a perfect square whenever x and y are distinct elements of S. In this paper we find some upper bounds for the size of the set S. We prove…

For a point set of $n$ elements in the $d$-dimensional unit cube and a class of test sets we are interested in the largest volume of a test set which does not contain any point. For all natural numbers $n$, $d$ and under the assumption of a…