English
Related papers

Related papers: A quantitative improvement for Roth's theorem on a…

200 papers

Let $E\subset\rr$ be a closed set of Hausdorff dimension $\alpha$. We prove that if $\alpha$ is sufficiently close to 1, and if $E$ supports a probabilistic measure obeying appropriate dimensionality and Fourier decay conditions, then $E$…

Classical Analysis and ODEs · Mathematics 2013-06-11 Izabella Laba , Malabika Pramanik

Let $A, B\subseteq \mathbb{Z}$ be finite, nonempty subsets with $\min A=\min B=0$, and let $$\delta(A,B)={\begin{array}{ll} 1 & \hbox{if} A\subseteq B, 0 & \hbox{otherwise.} If $\max B\leq \max A\leq |A|+|B|-3$ and \label{one}|A+B|\leq…

Number Theory · Mathematics 2009-04-23 Itziar Bardaji , David J. Grynkiewicz

Let $1 < p < \infty$, $p\neq 2$. We prove that if $d\geq d_p$ is sufficiently large, and $A\subs\R^d$ is a measurable set of positive upper density then there exists $\la_0=\la_0(A)$ such for all $\la\geq\la_0$ there are $x,y\in\R^d$ such…

Combinatorics · Mathematics 2017-06-07 Brian Cook , Ákos Magyar , Malabika Pramanik

We prove the following conjecture of Shkredov and Solymosi: every subset $A \subset \mathbf{Z}^2$ such that $\sum_{a\in A\setminus\{0\}} 1/\left\|a\right\|^{2} = +\infty$ contains the three vertices of an isosceles right triangle. To do…

Combinatorics · Mathematics 2022-12-02 Cédric Pilatte

We show two results. First, a refinement of Freiman's theorem: if A is a finite set of integers and |A+A| < K|A|, then A is contained in a multidimensional progression of dimension at most O(K^{7/4} log^3K) and size at most exp(O(K^{7/4}…

Classical Analysis and ODEs · Mathematics 2010-11-02 Tom Sanders

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

Let $S$ be a subset of $\{1,\ldots,N\}$ avoiding the nontrivial progressions $x, x+y^2-1, x+ 2(y^2-1)$. We prove that $|S|\ll N/\log_m{N}$, where $\log_m $ is the $m$-fold iterated logarithm and $m\in\mathbf{N}$ is an absolute constant.…

Number Theory · Mathematics 2023-09-18 Sarah Peluse , Ashwin Sah , Mehtaab Sawhney

We improve the lower bound on the number of permutations of {1,2,...,n} in which no 3-term arithmetic progression occurs as a subsequence, and derive lower bounds on the upper and lower densities of subsets of the positive integers that can…

Combinatorics · Mathematics 2010-04-13 Timothy D. LeSaulnier , Sujith Vijay

Let H stand for the set of homeomorphisms on [0,1]. We prove the following dichotomy for Borel subsets A of [0,1]: either there exists a homeomorphism f in H such that the image f(A) contains no 3-term arithmetic progressions; or, for every…

Dynamical Systems · Mathematics 2013-03-20 Michael Boshernitzan , Jon Chaika

We introduce a wide class of deterministic subsets of primes of zero relative density and we prove Roth's Theorem in these sets, namely, we show that any subset of them with positive relative upper density contains infinitely many…

Classical Analysis and ODEs · Mathematics 2023-01-02 Leonidas Daskalakis

In this note, we show that the method of Croot, Lev, and Pach can be used to bound the size of a subset of $F_q^n$ with no three terms in arithmetic progression by $c^n$ with $c < q$. For $q=3$, the problem of finding the largest subset…

Combinatorics · Mathematics 2016-05-31 Jordan S. Ellenberg , Dion Gijswijt

A strictly increasing sequence of positive integers is called a slightly curved sequence with small error if the sequence can be well-approximated by a function whose second derivative goes to zero faster than or equal to $1/x^\alpha$ for…

Number Theory · Mathematics 2019-03-05 Kota Saito , Yuuya Yoshida

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

In this paper we give a very elementary proof that if A and B are subsets of {1,2,...,N}, each having at least 5N^{1 - (4(k-1))^{-1}} elements, then the sumset A+B has a k-term arithmetic progression.

Number Theory · Mathematics 2007-05-23 Ernie Croot

We investigate exponential sums over those numbers $\leq x$ all of whose prime factors are $\leq y$. We prove fairly good minor arc estimates, valid whenever $\log^{3}x \leq y \leq x^{1/3}$. Then we prove sharp upper bounds for the $p$-th…

Number Theory · Mathematics 2019-02-20 Adam J. Harper

We prove, in particular, that if a subset A of {1, 2,..., N} has no nontrivial solution to the equation x_1+x_2+x_3+x_4+x_5=5y then the cardinality of A is at most N e^{-c(log N)^{1/7-eps}}, where eps>0 is an arbitrary number, and c>0 is an…

Number Theory · Mathematics 2011-06-09 Tomasz Schoen , Ilya D. Shkredov

Let $G$ be a finite Abelian group. For a subset $S \subseteq G$, let $T_3(S)$ denote the number of length three arithemtic progressions in $S$ and Prob[$S$] $= \frac{1}{|S|^2}\sum_{x,y \in S} 1_S(x+y)$. For any $q \ge 1$ and $\alpha \in…

Combinatorics · Mathematics 2018-09-12 Zachary Chase

Green and Sisask showed that the maximal number of $3$-term arithmetic progressions in $n$-element sets of integers is $\lceil n^2/2\rceil$; it is easy to see that the same holds if the set of integers is replaced by the real line or by any…

Combinatorics · Mathematics 2023-02-08 Itai Benjamini , Shoni Gilboa

In this paper, we study $k$-term arithmetic progressions $N, N+d, ..., N+(k-1)d$ of powerful numbers. Under the $abc$-conjecture, we obtain $d \gg_\epsilon N^{1/2 - \epsilon}$. On the other hand, there exist infinitely many $3$-term…

Number Theory · Mathematics 2022-10-04 Tsz Ho Chan

Let U(N) denote the maximal length of arithmetic progressions in a random uniform subset of {0,1}^N. By an application of the Chen-Stein method, we show that U(N)- 2 log(N)/log(2) converges in law to an extreme type (asymmetric)…

Probability · Mathematics 2012-05-22 Itai Benjamini , Ariel Yadin , Ofer Zeitouni