English
Related papers

Related papers: On Roth's theorem on progressions

200 papers

We obtain smoothing estimates for certain nonlinear convolution operators on prime fields, leading to quantitative nonlinear Roth type theorems. Compared with the usual linear setting (i.e. arithmetic progressions), the nonlinear nature of…

Number Theory · Mathematics 2016-08-22 Jean Bourgain , Mei-Chu Chang

We show that for all integers $2\le s\le t$, any $K_{s,t}$-free subset of $[N]$ with size $\Omega(n^{1-1/s})$ must contain a nontrivial solution to every fixed translation-invariant linear equation in at least five variables. This extends…

Combinatorics · Mathematics 2026-01-27 Yifan Jing , Cosmin Pohoata , Max Wenqiang Xu

Suppose that A is a subset of {1,...,N} such that the difference between any two elements of A is never one less than a prime. We show that |A| = O(N exp(-c(log N)^{1/4})) for some absolute c>0.

Classical Analysis and ODEs · Mathematics 2010-04-02 Imre Z. Ruzsa , Tom Sanders

Let a be a real number between 0 and 1. Ernie Croot showed that the quantity \max_A #(3-term arithmetic progressions in A)/p^2, where A ranges over all subsets of Z/pZ of size at most a*p, tends to a limit as p tends to infinity through…

Number Theory · Mathematics 2014-02-26 Ben Green , Olof Sisask

Suppose that $A \subset \mathbb{R}$ has positive upper density, \[ \limsup_{|I| \to \infty} \frac{|A \cap I|}{|I|} = \delta > 0,\] and $P(t) \in \mathbb{R}[t]$ is a polynomial with no constant or linear term, or more generally a non-flat…

Classical Analysis and ODEs · Mathematics 2019-01-08 Ben Krause

Let $N$ be a large prime and $P, Q \in \mathbb{Z}[x]$ two linearly independent polynomials with $P(0) = Q(0) = 0$. We show that if a subset $A$ of $\mathbb{Z}/N\mathbb{Z}$ lacks a progression of the form $(x, x + P(y), x + Q(y), x + P(y) +…

Number Theory · Mathematics 2024-05-22 James Leng

We construct Salem sets in $\mathbb{R}/\mathbb{Z}$ of any dimension (including $1$) which do not contain any arithmetic progressions of length $3$. Moreover, the sets can be taken to be Ahlfors regular if the dimension is less than $1$, and…

Classical Analysis and ODEs · Mathematics 2018-08-27 Pablo Shmerkin

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

We use topological ideas to show that, assuming the conjecture of Erd\"(o)s on subsets of positive integers having no $p$ terms in arithmetic progression (A. P.), there must exist a subset $M_p$ of positive integers with no $p$ terms in A.…

Number Theory · Mathematics 2007-05-23 Goutam Pal

Let G be an arbitrary finite group and let S and T be two subsets such that |S|>1, |T|>1, and |TS|< |T|+|S|< |G|-1. We show that if |S|< |G|-4|G|^{1/2}+1 then either S is a geometric progression or there exists a non-trivial subgroup H such…

Combinatorics · Mathematics 2013-10-07 Oriol Serra , Gilles Zémor

Let $G$ be a multiplicative subgroup of the prime field $\mathbb F_p$ of size $|G|> p^{1-\kappa}$ and $r$ an arbitrarily fixed positive integer. Assuming $\kappa=\kappa(r)>0$ and $p$ large enough, it is shown that any proportional subset…

Number Theory · Mathematics 2016-11-21 Mei-Chu Chang

Suppose that f : F_p^n -> [0,1] has expected value t in [p^(-n/9),1] (so, the density t can be quite low!). Furthermore, suppose that support(f) has no three-term arithmetic progressions. Then, we develop non-trivial lower bounds for f_j,…

Combinatorics · Mathematics 2007-07-11 Ernie Croot

We give an elementary, Fourier-free proof of Roth's theorem. The proof follows Roth's original density-increment strategy, but replaces the usual Fourier-analytic step with a direct combinatorial argument involving averages over…

Combinatorics · Mathematics 2026-05-20 Mark Lewko

Suppose that A is a subset of the integers {1,...,N} of density a. We provide a new proof of a result of Green which shows that A+A contains an arithmetic progression of length exp(ca(log N)^{1/2}) for some absolute c>0. Furthermore we…

Number Theory · Mathematics 2010-04-02 Tom Sanders

Answering a question of Gowers, Tao proved that any $A\times B\times C\subset SL_d(\mathbb{F}_q)^3$ contains $|A||B||C|/|SL_d(\mathbb{F}_q)|+O_d(|SL_d(\mathbb{F}_q)|^2/q^{\min(d-1,2)/8})$ three-term progressions $(x,xy,xy^2)$. Using a…

Combinatorics · Mathematics 2023-01-11 Sarah Peluse

Green developed an arithmetic regularity lemma to prove a strengthening of Roth's theorem on arithmetic progressions in dense sets. It states that for every $\epsilon > 0$ there is some $N_0(\epsilon)$ such that for every $N \ge…

Combinatorics · Mathematics 2020-04-29 Jacob Fox , Huy Tuan Pham , Yufei Zhao

We prove that every subset of $\{1,\dots, N\}$ which does not contain any solutions to the equation $x+y+z=3w$ has at most $\exp(-c(\log N)^{1/5+o(1)})N$ elements, for some $c>0$. This theorem improves upon previous estimates. Additionally,…

Combinatorics · Mathematics 2023-10-17 Tomasz Schoen

Addressing a question of Cameron and Erd\Ho s, we show that, for infinitely many values of $n$, the number of subsets of $\{1,2,\ldots, n\}$ that do not contain a $k$-term arithmetic progression is at most $2^{O(r_k(n))}$, where $r_k(n)$ is…

Combinatorics · Mathematics 2016-05-11 József Balogh , Hong Liu , Maryam Sharifzadeh

Suppose $A$ is a subset of $\{1, \dotsc, N\}$ which does not contain any configurations of the form $x,x+\lfloor n^c \rfloor$ where $n \neq 0$ and $1<c<\frac{6}{5}$. We show that the density of $A$ relative to the first $N$ integers is…

Number Theory · Mathematics 2024-11-19 Maximilian O'Keeffe

Let A be a finite set of integers. We prove that if |A| is at least 2 and |A+A| is 3|A|-3, then one of the following is true: 1. A is a bi-arithmetic progression; 2. A+A contains an arithmetic progression of length 2|A|-1; 3. |A| is 6 and A…

Number Theory · Mathematics 2013-08-06 Renling Jin