Related papers: Improved bounds on the set A(A+1)

We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$

We study the number of degree $n$ number fields with discriminant bounded by $X$. In this article, we improve an upper bound due to Schmidt on the number of such fields that was previously the best known upper bound for $6 \leq n \leq 94$.

For a field $\mathbb{F}$ and integers $d, k$ and $\ell$, a set $A \subseteq \mathbb{F}^d$ is called $(k,\ell)$-nearly orthogonal if all vectors in $A$ are non-self-orthogonal and every $k+1$ vectors in $A$ contain $\ell + 1$ pairwise…

Given a family $F$ of pairwise almost disjoint sets on a countable set $S$, we study maximal almost disjoint (mad) families $F^+$ extending $F$. We define $a^+(F)$ to be the minimal possible cardinality of $F^+\setminus F$ for such $F^+$,…

We consider the set $$\mathcal{A} = \left\{10\cdot a + 11\cdot b \ | \gcd(a,b)=1, a\geq 1, b\geq 2a+1 \right\}.$$ We will prove that $\mathcal{A}$ is unbounded and that there exists a natural number $M\notin \mathcal{A}$ for which…

Let $(G, +)$ be an abelian group. In 2004, Eliahou and Kervaire found an explicit formula for the smallest possible cardinality of the sumset $A+A$, where $A \subseteq G$ has fixed cardinality $r$. We consider instead the smallest possible…

A sunflower with a core $Y$ is a family ${\cal B}$ of sets such that $U \cap U' = Y$ for each two different elements $U$ and $U'$ in ${\cal B}$. The well-known sunflower lemma states that a given family ${\cal F}$ of sets, each of…

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

We consider families F of sequences converging to +infinity that F satisfies the following condition (C): (C): if an open set U in the real line is unbounded above then there exists a sequence belonging to F, which has an infinite number of…

This thesis presents an alternative to Cantor's theory of cardinality, insofar as that is understood as a theory of set size. The alternative is based on a general theory, ClassSize. ClassSize contains all sentences in the first order…

Let $\mathcal{A}$ be a finite set of positive integers and $y\geq 1$. We give an effective lower bound of the cardinality of the set $\{n\in\mathcal{A};\,p|n\Longrightarrow p\leq y\}$ under the condition of a good knowledge of the level of…

A set of non-negative integers A is an additive 2-basis with range n, if its sumset A+A contains 0, 1, ..., n but not n+1. Explicit bases are known with arbitrarily large size |A|=k and $n/k^2 \ge 2/7 > 0.2857$. We present a more general…

Let k be a definable L-cardinal. Then there is a set of reals X, class-generic over L, such that L(X) and L have the same cardinals, X has size k in L(X) and some pi-1-2 formula defines X in all set-generic extensions of L(X). Two…

Starting from a supercompact cardinal we build a model in which $2^{\aleph_{\omega_1}}=2^{\aleph_{\omega_1+1}}=\aleph_{\omega_1+3}$ but there is a jointly universal family of size $\aleph_{\omega_1+2}$ of graphs on $\aleph_{\omega_1+1}$.…

We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…

This note proves that there exists positive constants $c_1$ and $c_2$ such that for all finite $A \subset \mathbb R$ with $|A+A| \leq |A|^{1+c_1}$ we have $|AAA| \gg |A|^{2+c_2}$.

Let $C\subseteq \{1,\ldots,k\}^n$ be such that for any $k$ distinct elements of $C$ there exists a coordinate where they all differ simultaneously. Fredman and Koml\'os studied upper and lower bounds on the largest cardinality of such a set…

Erd\H{o}s showed that every set of $n$ positive integers contains a subset of size at least $n/(k+1)$ containing no solutions to $x_1 + \cdots + x_k = y$. We prove that the constant $1/(k+1)$ here is best possible by showing that if $(F_m)$…

How large can a family \cal A \subset \cal P [n] be if it does not contain A,B with |A\setminus B| = 1? Our aim in this paper is to show that any such family has size at most \frac{2+o(1)}{n} \binom {n}{\lfloor n/2\rfloor }. This is tight…

We study the relationship between the number of minus signs in a generalized sumset, $A+...+A-...-A$, and its cardinality; without loss of generality we may assume there are at least as many positive signs as negative signs. As addition is…