English
Related papers

Related papers: Tower-type bounds for Roth's theorem with popular …

200 papers

We prove a quantitative local limit theorem for the number of descents in a random permutation. Our proof uses a conditioning argument and is based on bounding the characteristic function $\phi(t)$ of the number of descents. We also…

Probability · Mathematics 2019-01-23 Bryce Cai , Annie Chen , Ben Heller , Eyob Tsegaye

We prove a structural result for sets of integers with doubling at most $4 + \delta$, with $\delta>0$ sufficiently small. This generalises earlier work of Eberhard--Green--Manners which dealt with sets of integers with doubling strictly…

Number Theory · Mathematics 2026-04-29 Yifan Jing , Akshat Mudgal

We show that for some constant $\beta > 0$, any subset $A$ of integers $\{1,\ldots,N\}$ of size at least $2^{-O((\log N)^\beta)} \cdot N$ contains a non-trivial three-term arithmetic progression. Previously, three-term arithmetic…

Number Theory · Mathematics 2024-10-30 Zander Kelley , Raghu Meka

We prove that every set $A\subset\mathbb{Z}/p\mathbb{Z}$ with $\mathbb{E}_x\min(1_A*1_A(x),t)\le(2+\delta)t\mathbb{E}_x 1_A(a)$ is very close to an arithmetic progression. Here $p$ stands for a large prime and $\delta,t$ are small real…

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

We prove that if $A\subseteq \{1,\dots,N\}$ does not contain any non-trivial three-term arithmetic progression, then $$|A|\ll \frac{(\log\log N)^{3+o(1)}}{\log N}N\,.$$

Number Theory · Mathematics 2020-05-05 Tomasz Schoen

A recent upper bound by Le and Solomon [STOC '23] has established that every $n$-node graph has a $(1+\varepsilon)(2k-1)$-spanner with lightness $O(\varepsilon^{-1} n^{1/k})$. This bound is optimal up to its dependence on $\varepsilon$; the…

Data Structures and Algorithms · Computer Science 2024-09-09 Greg Bodwin , Jeremy Flics

We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius norms of a (partially) symmetric tensor. In the particular case of general tensors our result recovers a known upper bound. For symmetric…

Functional Analysis · Mathematics 2024-03-05 Khazhgali Kozhasov , Josué Tonelli-Cueto

We use Green's transference principle to show that any subset of the $d$th powers of primes with positive relative density contains nontrivial solutions to a translation-invariant linear equation in $d^2+1$ or more variables, with explicit…

Number Theory · Mathematics 2021-10-12 Sam Chow

In this paper, a new proof of the Positive Mass Theorem is established through a newly discovered monotonicity formula, holding along the level sets of the Green's function of an asymptotically flat $3$-manifold. In the same context and for…

Differential Geometry · Mathematics 2023-06-07 V. Agostiniani , L. Mazzieri , F. Oronzio

We prove new lower bounds on the maximum size of sets $A\subseteq \mathbb{F}_p^n$ or $A\subseteq \mathbb{Z}_m^n$ not containing three-term arithmetic progressions (consisting of three distinct points). More specifically, we prove that for…

Combinatorics · Mathematics 2024-01-24 Christian Elsholtz , Laura Proske , Lisa Sauermann

A well-known theorem in plane geometry states that any set of $n$ non-collinear points in the plane determines at least $n$ lines. Chen and Chv\'{a}tal asked whether an analogous statement holds within the framework of finite metric spaces,…

Combinatorics · Mathematics 2021-07-15 Ida Kantor

Let $d_n = p_{n+1} - p_n$, where $p_n$ denotes the $n$th smallest prime, and let $R(T) = \log T \log_2 T\log_4 T/(\log_3 T)^2$ (the "Erd{\H o}s--Rankin" function). We consider the sequence $(d_n/R(p_n))$ of normalized prime gaps, and show…

Number Theory · Mathematics 2015-10-29 Roger Baker , Tristan Freiberg

Let $X$ be a $n$ dimensional compact local Hermitian symmetric space of non-compact type and $L=\shO(K_X)\tens\shO(qM)$ be an adjoint line bundle. Let $c>0$ be a constant. Assume the curvature of $M$ is $\ge c\omega$, where $\omega$ is the…

Differential Geometry · Mathematics 2019-01-31 Yih Sung

The Green-Tao Theorem, one of the most celebrated theorems in modern number theory, states that there exist arbitrarily long arithmetic progressions of prime numbers. In a related but different direction, a recent theorem of Shiu proves…

Number Theory · Mathematics 2014-07-07 Keenan Monks , Sarah Peluse , Lynnelle Ye

The celebrated Green-Tao theorem states that there are arbitrarily long arithmetic progressions in the primes. One of the main ingredients in their proof is a relative Szemer\'edi theorem which says that any subset of a pseudorandom set of…

Number Theory · Mathematics 2015-10-26 David Conlon , Jacob Fox , Yufei Zhao

We consider a semilinear Neumann problem with exponential nonlinearity in a smooth bounded domain $\Omega \subset \mathbb{R}^2$. We prove that there exists a threshold $\bar{\varepsilon}>0$ such that for all $\varepsilon>\bar{\varepsilon}$,…

Analysis of PDEs · Mathematics 2026-04-07 Juneyoung Seo

In this note we announce the proof of the inverse conjecture for the Gowers U^{s+1}[N]-norm for all s => 3; this is new for s => 4, the cases s = 1,2,3 having been previously established. More precisely we outline a proof (details of which…

Number Theory · Mathematics 2011-05-31 Ben Green , Terence Tao , Tamar Ziegler

We show that any set containing a positive proportion of the primes contains a 3-term arithmetic progression. An important ingredient is a proof that the primes enjoy the so-called Hardy-Littlewood majorant property. We derive this by…

Number Theory · Mathematics 2007-05-23 Ben Green

We show that doubling at some large scale in a Cayley graph implies uniform doubling at all subsequent scales. The proof is based on the structure theorem for approximate subgroups proved by Green, Tao and the first author. We also give a…

Group Theory · Mathematics 2016-08-16 Emmanuel Breuillard , Matthew Tointon

Green and Tao's arithmetic regularity lemma and counting lemma together apply to systems of linear forms which satisfy a particular algebraic criterion known as the `flag condition'. We give an arithmetic regularity lemma and counting lemma…

Combinatorics · Mathematics 2025-07-09 Daniel Altman
‹ Prev 1 4 5 6 7 8 10 Next ›