English
Related papers

Related papers: Sums, Differences and Dilates

200 papers

Let $n,k,a$ and $c$ be positive integers and $b$ be a nonnegative integer. Let $\nu_2(k)$ and $s_2(k)$ be the 2-adic valuation of $k$ and the sum of binary digits of $k$, respectively. Let $S(n,k)$ be the Stirling number of the second kind.…

Number Theory · Mathematics 2014-03-19 Jianrong Zhao , Shaofang Hong , Wei Zhao

Our main result states that when A, B, C are subsets of Z/NZ of respective densities \alpha,\beta,\gamma, the sumset A + B + C contains an arithmetic progression of length at least e^{c(\log N)^c} for densities \alpha > (\log N)^{-2 +…

Number Theory · Mathematics 2013-10-10 Kevin Henriot

Let $d\geq 2$ and $k\geq 1$ be fixed. We prove that, for every $\epsilon>0$ and every real $\beta$, there exist integers $1\leq b_1,\ldots,b_k\leq N$ such that \[ \left\|\sum_{j=1}^k b_j^{1/d}-\beta\right\| \ll_{d,k,\epsilon}…

Number Theory · Mathematics 2026-05-27 Samuel Korsky

For a set $A$ of integers, the sumset $lA =A+...+A$ consists of those numbers which can be represented as a sum of $l$ elements of $A$ $$lA =\{a_1+... a_l| a_i \in A_i \}. $$ A closely related and equally interesting notion is that of…

Number Theory · Mathematics 2007-05-23 E. Szemeredi , V. Vu

It is an open problem in additive number theory to compute and understand the full range of sumset sizes of finite sets of integers, that is, the set $\mathcal{R}_{\mathbf{Z}}(h,k)= \{|hA|:A \subseteq {\mathbf{Z}} \text{ and } |A|=k\}$ for…

Number Theory · Mathematics 2026-04-07 Melvyn B. Nathanson

This paper explores the relationship between convexity and sum sets. In particular, we show that elementary number theoretical methods, principally the application of a squeezing principle, can be augmented with the Elekes-Szab\'{o} Theorem…

Combinatorics · Mathematics 2024-01-17 Oliver Roche-Newton , Elaine Wong

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…

Combinatorics · Mathematics 2024-02-21 Yifan Jing , Shukun Wu

Let $h$ be a positive integer and let $\varepsilon > 0$. The Haight-Ruzsa method produces a positive integer $m^*$ and a subset $A$ of the additive abelian group $\mathbf{Z}/m^*\mathbf{Z}$ such that the difference set is large in the sense…

Number Theory · Mathematics 2021-01-06 Melvyn B. Nathanson

This article proves the bound $|\zeta(\frac{1}{2} + it)|\leq 0.732 t^{\frac{1}{6}} \log t$ for $t \geq 2$, which improves on a result by Cheng and Graham. We also show that $|\zeta(\frac{1}{2}+it)|\leq 0.732 |3.3081+it|^{\frac{1}{6}} \log…

Number Theory · Mathematics 2015-07-02 Dave Platt , Tim Trudgian

Let $S(t) \;:=\; \frac{\displaystyle 1}{\displaystyle \pi}\arg \zeta(\frac{1}{2} + it)$. We prove that, for $T^{\,27/82+\varepsilon} \le H \le T$, we have $$ {\rm mes}\Bigl\{t\in [T, T+H]\;:\; S(t)>0\Bigr\} = \frac{H}{2} +…

Number Theory · Mathematics 2018-09-03 Aleksandar Ivić , Maxim Korolev

Let $A$ be a nonempty finite subset of an additive abelian group $G$. Define $A + A := \{a + b : a, b \in A\}$ and $A \dotplus A := \{a + b : a, b \in A~\text{and}~ a \neq b\}$. The set $A$ is called a {\em sum-dominant (SD) set} if $|A +…

Number Theory · Mathematics 2017-12-27 Raj Kumar Mistri , R. Thangadurai

In this short note, we derive an upper-bound for the sum of two comparison functions, namely for the sum of a class K and an extended class K function. To the best of our knowledge, the relations derived in this note have not been…

Systems and Control · Electrical Eng. & Systems 2024-08-23 Adrian Wiltz , Dimos V. Dimarogonas

If $A$ and $B$ are subsets of an abelian group, their sumset is $A+B:=\{a+b:a\in A, b\in B\}$. We study sumsets in discrete abelian groups, where at least one summand has positive upper Banach density. Renling Jin proved that if $A$ and $B$…

Number Theory · Mathematics 2025-07-15 John T. Griesmer

Let $A \subseteq F_2^n$ be a set with $|2A| = K|A|$. We prove that if (1) for at least a fraction $1-K^{-9}$ of all $s \in 2A$, the set $(A+s) \cap A$ has size at most $L\cdot|A|/K$, or (2) for at least a fraction $K^{-L}$ of all $s \in…

Discrete Mathematics · Computer Science 2013-11-04 Thomas Holenstein

We show that for any finite set $P$ of points in the plane and $\epsilon>0$ there exist $\displaystyle O\left(\frac{1}{\epsilon^{3/2+\gamma}}\right)$ points in ${\mathbb{R}}^2$, for arbitrary small $\gamma>0$, that pierce every convex set…

Combinatorics · Mathematics 2022-07-22 Natan Rubin

We show that, for a finite set $A$ of real numbers, the size of the set $$\frac{A+A}{A+A} = \left\{ \frac{a+b}{c+d} : a,b,c,d \in A, c+d \neq 0 \right \}$$ is bounded from below by $$\left|\frac{A+A}{A+A} \right| \gg \frac{|A|^{2+1/4}}{|A /…

Combinatorics · Mathematics 2016-10-13 Ben Lund

We study the number of $s$-element subsets $J$ of a given abelian group $G$, such that $|J+J|\leq K|J|$. Proving a conjecture of Alon, Balogh, Morris and Samotij, and improving a result of Green and Morris, who proved the conjecture for $K$…

Combinatorics · Mathematics 2019-05-06 Marcelo Soares Campos

Improving upon a technique of Croot and Hart, we show that for every $h$, there exists an $\epsilon > 0$ such that if $A \subseteq \mathbb{R}$ is sufficiently large and $|A.A| \le |A|^{1+\epsilon}$, then $|hA| \ge…

Combinatorics · Mathematics 2014-10-21 Albert Bush , Ernie Croot

Let $p\geq 3$ be a prime and $n\geq 1$ be an integer. Let $K\subseteq {\mathbb{F}_p}$ denote a fixed subset with $0\in K$. Let $A\subseteq ({\mathbb{F}_p})^n$ be an arbitrary subset such that $$\{…

Number Theory · Mathematics 2018-12-06 Gábor Hegedűs

In a recent paper with Sprang and Zudilin, the following result was proved: if $a$ is large enough in terms of $\varepsilon>0$, then at least $2^{(1-\varepsilon)\frac{\log a}{\log \log a}}$ values of the Riemann zeta function at odd…

Number Theory · Mathematics 2019-11-13 Stéphane Fischler