English
Related papers

Related papers: Variations on the Sum-Product Problem

200 papers

In this paper we prove new upper bounds for the sum $\sum_{n=a+1}^{a+N}f(n)$, for a certain class of arithmetic functions $f$. Our results improve the previous results of G. Bachman and L. Rachakonda.

Number Theory · Mathematics 2011-07-05 Dmitriy Frolenkov

We prove, for a sufficiently small subset $\mathcal{A}$ of a prime residue field, an estimate on the number of solutions to the equation $(a_1-a_2)(a_3-a_4) = (a_5-a_6)(a_7-a_8)$ with all variables in $\mathcal{A}$. We then derive new…

Combinatorics · Mathematics 2020-12-16 Simon Macourt , Giorgis Petridis , Ilya D. Shkredov , Igor E. Shparlinski

Pilz's conjecture states that for any finite set $A=\{a_1,a_2,\dots,a_k\}$ of positive integers and positive integer $n$ in the union of the sets $\{a_1,2a_1,\dots,na_1\},\dots, \{a_k,2a_k,\dots,na_k\}$ (considered as a multiset) at least…

Combinatorics · Mathematics 2024-09-24 János Nagy , Péter Pál Pach

We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…

Number Theory · Mathematics 2021-04-26 Peter J. Bradshaw , Brandon Hanson , Misha Rudnev

Let $A \subset \mathbb{F}_p$ of size at most $p^{3/5}$. We show $$|A+A| + |AA| \gtrsim |A|^{6/5 + c},$$ for $c = 4/305$. Our main tools are the cartesian product point--line incidence theorem of Stevens and de Zeeuw and the theory of higher…

Combinatorics · Mathematics 2018-06-20 G. Shakan , I. D. Shkredov

We make further progress towards a Kneser-type generalization of Pollard's Theorem to general abelian groups. For two sets $A$ and $B$ in an abelian group $G$, the \emph{$t$-popular sumset} of $A$ and $B$, denoted by $A+_t B$, is the set of…

Number Theory · Mathematics 2026-01-27 David J. Grynkiewicz , Runze Wang

Let $A$ be a finite subset of $\ffield$, the field of Laurent series in $1/t$ over a finite field $\mathbb{F}_q$. We show that for any $\epsilon>0$ there exists a constant $C$ dependent only on $\epsilon$ and $q$ such that…

Number Theory · Mathematics 2013-03-05 Thomas Bloom , Timothy G. F. Jones

Let $B$ be a set of natural numbers of size $n$. We prove that the length of the longest arithmetic progression contained in the product set $B.B = \{bb'| \, b, b' \in B\}$ cannot be greater than $O(n \log n)$ which matches the lower bound…

Number Theory · Mathematics 2015-02-13 Dmitry Zhelezov

A conjecture of Graham (repeated by Erd\H{o}s) asserts that for any set $A \subseteq \mathbb{F}_p \setminus \{0\}$, there is an ordering $a_1, \ldots, a_{|A|}$ of the elements of $A$ such that the partial sums $a_1, a_1+a_2, \ldots,…

Combinatorics · Mathematics 2024-08-20 Noah Kravitz

The boundedness of the kissing numbers of convex bodies has been known to Hadwiger for long. We present an application of it to the sum-product estimate…

Combinatorics · Mathematics 2017-09-27 Jozsef Solymosi , Ching Wong

We show that if $A=\{a_1 < a_2 < \ldots < a_k\}$ is a set of real numbers such that the differences of the consecutive elements are distinct, then for and finite $B \subset \mathbb{R}$, $$|A+B|\gg |A|^{1/2}|B|.$$ The bound is tight up to…

Combinatorics · Mathematics 2019-12-11 Imre Ruzsa , George Shakan , Jozsef Solymosi , Endre Szemerédi

Let $A\subset [1,x]$ be a non-empty set of primes with $|A|= \alpha x(\log x)^{-1}$. We prove that there exist absolute constants $c_1,c_2>0$ such that, as $x$ gets sufficiently large, we have $|A+A|\geq c_1(\log x)(\log \log…

Number Theory · Mathematics 2025-04-16 Genheng Zhao

This is an expository survey on recent sum-product results in finite fields. We present a number of sum-product or "expander" results that say that if $|A| > p^{2/3}$ then some set determined by sums and product of elements of $A$ is nearly…

Combinatorics · Mathematics 2017-01-09 Brendan Murphy , Giorgis Petridis

We show that if $A\subset \{1,\ldots,N\}$ has no solutions to $a-b=n^2$ with $a,b\in A$ and $n\geq 1$ then \[|A|\ll \frac{N}{(\log N)^{c\log\log \log N}}\] for some absolute constant $c>0$. This improves upon a result of…

Number Theory · Mathematics 2021-02-25 Thomas F. Bloom , James Maynard

Let $\mathbb{N}$ be the set of natural numbers and $\mathcal{S}_r=\big\{1^r, 2^r, 3^r,\cdots\big\}$ the set of $r$-th powers, where $r\ge 2$ is a natural number. Let $\mathcal{W}_r$ be an additive complement of $\mathcal{S}_r$ and $$…

Number Theory · Mathematics 2026-05-19 Yuchen Ding , Csaba Sándor , Zihan Zhang

Let $\E$ be an ordinary elliptic curve over a finite field $\F_{q}$ of $q$ elements and $x(Q)$ denote the $x$-coordinate of a point $Q = (x(Q),y(Q))$ on $\E$. Given an $\F_q$-rational point $P$ of order $T$, we show that for any subsets…

Number Theory · Mathematics 2008-06-05 Omran Ahmadi , Igor Shparlinski

Let $A$ be a finite set of positive real numbers. We present a sum-division estimate: |A+A|^2|A/A|\geq\frac{|A|^4}{4}.

Number Theory · Mathematics 2009-05-16 Liangpan Li , Jian Shen

Multidimensional continuous-domain inverse problems are often solved by the minimization of a loss functional, formed as the sum of a data fidelity and a regularization. In this work, we present a new construction where the regularization…

Numerical Analysis · Mathematics 2025-11-25 Vincent Guillemet , Michael Unser

We prove new bounds for sums of multiplicative characters over sums of set with small doubling and applying this result we break the square--root barrier in a problem of Balog concerning products of differences in a field of prime order.

Number Theory · Mathematics 2020-04-07 Tomasz Schoen , Ilya D. Shkredov

In this note, an upper bound for the sum of fractional parts of certain smooth functions is established. Such sums arise naturally in numerous problems of analytic number theory. The main feature is here an improvement of the main term due…

Number Theory · Mathematics 2019-01-03 Olivier Bordellès