English
Related papers

Related papers: On the few products, many sums problem

200 papers

In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…

Number Theory · Mathematics 2020-03-03 Zhi-Wei Sun

Let $A(s) = \sum_n a_n n^{-s}$ be a Dirichlet series with meromorphic continuation. Say we are given information on the poles of $A(s)$ with $|\Im s| \leq T$ for some large constant $T$. What is the best way to use such finite spectral data…

Number Theory · Mathematics 2025-11-19 Andrés Chirre , Harald Andrés Helfgott

We obtain a series of lower bounds for the product set of combinatorial cubes, as well as some non--trivial upper estimates for the multiplicative energy of such sets.

Combinatorics · Mathematics 2020-08-04 Ilya D. Shkredov

Given two subsets $A, B \subseteq \mathbb{F}_p$ and a binary relation $\mathcal{R} \subseteq A \times B$, the restricted sumset of $A, B$ with respect to $\mathcal{R}$ is defined as $A +_{\mathcal{R}} B = \{ a+b \colon (a,b) \notin…

Combinatorics · Mathematics 2025-09-05 Minghui Ouyang

In this paper we prove some results on sum-product estimates over arbitrary finite fields. More precisely, we show that for sufficiently small sets $A\subset \mathbb{F}_q$ we have \[|(A-A)^2+(A-A)^2|\gg |A|^{1+\frac{1}{21}}.\] This can be…

Number Theory · Mathematics 2018-07-17 Doowon Koh , Sujin Lee , Thang Pham , Chun-Yen Shen

We introduce a general class $F_0$ of additive functions $f$ such that $f(p) = 1$ and prove a tight bound for exponential sums of the form $\sum_{n \le x} f(n) e(\alpha n)$ where $f \in F_0$ and $e(\theta) = \exp(2\pi i \theta)$. Both…

Number Theory · Mathematics 2026-02-13 Ayla Gafni , Nicolas Robles

In this paper we prove that every set $A\subset\mathbb{Z}$ satisfying the inequality $\sum_{x}\min(1_A*1_A(x),t)\le(2+\delta)t|A|$ for $t$ and $\delta$ in suitable ranges, then $A$ must be very close to an arithmetic progression. We use…

Combinatorics · Mathematics 2015-06-02 Przemysław Mazur

We consider the multiplicative structure of sets of the form AA+1, where where A is a large, finite set of real numbers. In particular, we show that the additively shifted product set, AA+1 must have a large part outside of any generalized…

Combinatorics · Mathematics 2012-05-23 Steven Senger

We show that if $A\subset \mathbb{Z}$ is a finite set of integers in which every integer is divisible by $O(1)$ many primes then \[\max(\lvert A+A\rvert,\lvert AA\rvert) \geq \lvert A\rvert^{12/7-o(1)}\] and, for any $m\geq 2$,…

Number Theory · Mathematics 2026-01-07 Rishika Agrawal , Thomas F. Bloom , Giorgis Petridis

Let $A$ be a subset of the cyclic group $\mathbf{Z}/p\mathbf{Z}$ with $p$ prime. It is a well-studied problem to determine how small $|A|$ can be if there is no unique sum in $A+A$, meaning that for every two elements $a_1,a_2\in A$, there…

Combinatorics · Mathematics 2023-09-20 Benjamin Bedert

This note improves the best known exponent 1/12 in the prime field sum-product inequality (for small sets) to 1/11, modulo a logarithmic factor.

Combinatorics · Mathematics 2011-04-21 Misha Rudnev

We give an improved bound on the famed sum-product estimate in a field of residue class modulo $p$ ($\mathbb{F}_{p}$) by Erd\H{o}s and Szemeredi, and a non-empty set $A \subset \mathbb{F}_{p}$ such that: $$ \max \{|A+A|,|A A|\} \gg \min…

Combinatorics · Mathematics 2020-12-16 Connor Paul Wilson

We improve the exponent in the finite field sum-product problem from $11/9$ to $5/4$, improving the results of Rudnev, Shakan and Shkredov. That is, we show that if $A\subset \mathbb{F}_p$ has cardinality $|A|\ll p^{1/2}$ then \[…

Combinatorics · Mathematics 2021-04-05 Ali Mohammadi , Sophie Stevens

We establish the restricted sumset analogue of the celebrated conjecture of S\'{a}rk\"{o}zy on additive decompositions of the set of nonzero squares over a finite field. More precisely, we show that if $q>13$ is an odd prime power, then the…

Number Theory · Mathematics 2026-04-22 Chi Hoi Yip

In this paper we start to investigate a new body of questions in additive combinatorics. The fundamental Cauchy--Davenport theorem gives a lower bound on the size of a sumset A+B for subsets of the cyclic group Zp of order p (p prime), and…

Combinatorics · Mathematics 2022-05-16 Bela Bollobas , Imre Leader , Marius Tiba

We study additive double character sums over two subsets of a finite field. We show that if there is a suitable rational self-map of small degree of a set $D$, then this set contains a large subset $U$ for which the standard bound on the…

Number Theory · Mathematics 2020-11-30 Cathy Swaenepoel , Arne Winterhof

In this paper, we investigate the multiplicative structure of a shifted multiplicative subgroup and its connections with additive combinatorics and the theory of Diophantine equations. Among many new results, we highlight our main…

Number Theory · Mathematics 2026-04-13 Seoyoung Kim , Chi Hoi Yip , Semin Yoo

For $p$ prime, $A \subseteq \mathbb{Z}/p\mathbb{Z}$ and $\lambda \in \mathbb{Z}$, the sum of dilates $A + \lambda \cdot A$ is defined by \[A + \lambda \cdot A = \{a + \lambda a' : a, a' \in A\}.\] The basic problem on such sums of dilates…

Combinatorics · Mathematics 2024-09-26 David Conlon , Jeck Lim

We obtain asymptotics for sums of the form $$ \sum_{n=1}^P e(\alpha_kn^k + \alpha_1n), $$ involving lower order main terms. As an application, we show that for almost all $\alpha_2 \in [0,1)$ one has $$ \sup_{\alpha_1 \in [0,1)} \Big|…

Number Theory · Mathematics 2020-01-17 Julia Brandes , Scott T. Parsell , Konstantinos Poulias , George Shakan , Robert C. Vaughan

By making use of arithmetic information inequalities, we give a strong quantitative bound for the discretised ring theorem. In particular, we show that if $A \subset [1,2]$ is a $(\delta,\sigma)$-set, with $|A| = \delta^{-\sigma},$ then…

Classical Analysis and ODEs · Mathematics 2025-11-19 András Máthé , William O'Regan