English
Related papers

Related papers: On product sets of arithmetic progressions

200 papers

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

A $k$-configuration is a collection of $k$ distinct integers $x_1,\ldots,x_k$ together with their pairwise arithmetic means $\frac{x_i+x_j}{2}$ for $1 \leq i < j \leq k$. Building on recent work of Filmus, Hatami, Hosseini and Kelman on…

Number Theory · Mathematics 2025-01-20 Adrian Beker

We give a new proof of the discretized ring theorem for sets of real numbers. As a special case, we show that if $A\subset\mathbb{R}$ is a $(\delta,1/2)_1$-set in the sense of Katz and Tao, then either $A+A$ or $A.A$ must have measure at…

Classical Analysis and ODEs · Mathematics 2023-08-24 Larry Guth , Nets Hawk Katz , Joshua Zahl

We prove the following one-sided product-mixing theorem for the alternating group: Given subsets $X,Y,Z \subset A_n$ of densities $\alpha,\beta,\gamma$ satisfying $\min(\alpha\beta,\alpha\gamma,\beta\gamma)\gg n^{-1}(\log n)^7$, there are…

Group Theory · Mathematics 2017-02-14 Sean Eberhard

Let $f(N)$ denote the least integer $k$ such that, if $G$ is an abelian group of order $N$ and $A \subseteq G$ is a uniformly random $k$-element subset, then with probability at least $\tfrac12$ the subset-sum set $\{ \sum_{x \in S} x : S…

Combinatorics · Mathematics 2026-03-20 Jie Ma , Quanyu Tang

We show that if $\lambda_1,\ldots,\lambda_k$ are algebraic numbers, then $$|A+\lambda_1\cdot A+\dots+\lambda_k\cdot A|\geq H(\lambda_1,\ldots,\lambda_k)|A|-o(|A|)$$ for all finite subsets $A$ of $\mathbb{C}$, where…

Combinatorics · Mathematics 2025-08-27 David Conlon , Jeck Lim

We study the number of $k$-element sets $A \subset \{1,\ldots,N\}$ with $|A + A| \leq K|A|$ for some (fixed) $K > 0$. Improving results of the first author and of Alon, Balogh, Samotij and the second author, we determine this number up to a…

Combinatorics · Mathematics 2014-02-05 Ben Green , Robert Morris

In 2022, using methods from ergodic theory, Kra, Moreira, Richter, and Robertson resolved a longstanding conjecture of Erd\H{o}s about sumsets in large subsets of the natural numbers. In this paper, we extend this result to several…

Dynamical Systems · Mathematics 2025-01-29 Dimitrios Charamaras , Andreas Mountakis

In this paper we further study the relationship between convexity and additive growth, building on the work of Schoen and Shkredov (\cite{SS}) to get some improvements to earlier results of Elekes, Nathanson and Ruzsa (\cite{ENR}). In…

Combinatorics · Mathematics 2011-11-23 Liangpan Li , Oliver Roche-Newton

In their seminal paper from 1983, Erd\H{o}s and Szemer\'edi showed that any $n$ distinct integers induce either $n^{1+\epsilon}$ distinct sums of pairs or that many distinct products, and conjectured a lower bound of $n^{2-o(1)}$. They…

Combinatorics · Mathematics 2009-09-08 Noga Alon , Omer Angel , Itai Benjamini , Eyal Lubetzky

It is known that if a subset of $\mathbb{R}$ has positive Lebesgue measure, then it contains arbitrarily long finite arithmetic progressions. We prove that this result does not extend to infinite arithmetic progressions in the following…

Classical Analysis and ODEs · Mathematics 2023-04-21 Laurestine Bradford , Hannah Kohut , Yuveshen Mooroogen

Given a sequence $\mathscr{A}=\{a_0<a_1<a_2\ldots\}\subseteq \mathbb{N}$, let $r_{\mathscr{A},h}(n)$ denote the number of ways $n$ can be written as the sum of $h$ elements of $\mathscr{A}$. Fixing $h\geq 2$, we show that if $f$ is a…

Combinatorics · Mathematics 2024-12-18 Christian Táfula

Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theory for a long time. An extension of this classical hypergraph…

Number Theory · Mathematics 2007-05-23 Nils Hebbinghaus

It was asked by E. Szemer\'edi if, for a finite set $A\subset\mathbb{Z}$, one can improve estimates for $\max\{|A+A|,|A\cdot A|\}$, under the constraint that all integers involved have a bounded number of prime factors -- that is, each…

Number Theory · Mathematics 2025-07-02 Brandon Hanson , Misha Rudnev , Ilya Shkredov , Dmitrii Zhelezov

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

Combinatorics · Mathematics 2021-07-01 Imre Ruzsa , Jozsef Solymosi

Let $[a_1(x),a_2(x),\ldots, a_n(x), \ldots]$ be the continued fraction expansion of an irrational number $x\in (0, 1)$. The study of the growth rate of the product of consecutive partial quotients $a_n(x)a_{n+1}(x)$ is associated with the…

Number Theory · Mathematics 2022-02-25 Hui Hu , Mumtaz Hussain , Yueli Yu

We improve a result of Solymosi on sum-products in R, namely, we prove that max{|A+A|,|AA|}\gg |A|^{4/3+c}, where c>0 is an absolute constant. New lower bounds for sums of sets with small product set are found. Previous results are improved…

Combinatorics · Mathematics 2015-03-31 Sergei Konyagin , Ilya D. Shkredov

Fix an integer $h \geq 2$, and let $b_1, \ldots, b_h$ be (not necessarily distinct) positive integers with $\gcd(b_1, \ldots, b_h) = 1$. For any subset $A \subseteq \mathbb{N}$, let $r_A(n)$ denote the number of solutions $(k_1, \ldots,…

Number Theory · Mathematics 2026-05-06 Christian Táfula

We prove that there is a small but fixed positive integer e such that for every prime larger than a fixed integer, every subset S of the integers modulo p which satisfies |2S|<(2+e)|S| and 2(|2S|)-2|S|+2 < p is contained in an arithmetic…

Number Theory · Mathematics 2009-10-03 Oriol Serra , Gilles Zémor

Let A be a finite subset of a commutative additive group Z. The sumset and difference set of A are defined as the sets of pairwise sums and differences of elements of A, respectively. The well-known inequality $\sigma(A)^{1/2} \leq…

Combinatorics · Mathematics 2015-10-20 Merlijn Staps