English
Related papers

Related papers: A Multidimensional Szemer\'edi Theorem in the prim…

200 papers

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

Recently Conlon, Fox, and the author gave a new proof of a relative Szemer\'edi theorem, which was the main novel ingredient in the proof of the celebrated Green-Tao theorem that the primes contain arbitrarily long arithmetic progressions.…

Number Theory · Mathematics 2019-02-20 Yufei Zhao

Tao conjectured that every dense subset of $\mathcal{P}^d$, the $d$-tuples of primes, contains constellations of any given shape. This was very recently proved by Cook, Magyar, and Titichetrakun and independently by Tao and Ziegler. Here we…

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

Green and Tao famously proved in 2005 that any subset of the primes of fixed positive density contains arbitrarily long arithmetic progressions. Green had previously shown that in fact any subset of the primes of relative density tending to…

Number Theory · Mathematics 2019-06-14 Luka Rimanic , Julia Wolf

The transference principle of Green and Tao enabled various authors to transfer Szemer\'edi's theorem on long arithmetic progressions in dense sets to various sparse sets of integers, mostly sparse sets of primes. In this paper, we provide…

Number Theory · Mathematics 2023-03-29 Pierre-Yves Bienvenu , Xuancheng Shao , Joni Teräväinen

A famous theorem of Szemer\'edi asserts that all subsets of the integers with positive upper density will contain arbitrarily long arithmetic progressions. There are many different proofs of this deep theorem, but they are all based on a…

Number Theory · Mathematics 2007-05-23 Terence Tao

We establish a version of the Furstenberg-Katznelson multi-dimensional Szemer\'edi in the primes ${\mathcal P} := \{2,3,5,\ldots\}$, which roughly speaking asserts that any dense subset of ${\mathcal P}^d$ contains constellations of any…

Number Theory · Mathematics 2013-12-03 Terence Tao , Tamar Ziegler

Szemer\'edi's Theorem states that a set of integers with positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman generalized this, showing that sets of integers with positive upper density contain…

Dynamical Systems · Mathematics 2007-05-23 Nikos Frantzikinakis , Bryna Kra

Green, Tao and Ziegler prove ``Dense Model Theorems'' of the following form: if R is a (possibly very sparse) pseudorandom subset of set X, and D is a dense subset of R, then D may be modeled by a set M whose density inside X is…

Combinatorics · Mathematics 2008-06-04 Omer Reingold , Luca Trevisan , Madhur Tulsiani , Salil Vadhan

We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of…

Number Theory · Mathematics 2007-09-23 Ben Green , Terence Tao

A famous theorem of Szemer\'edi asserts that any set of integers of positive upper density will contain arbitrarily long arithmetic progressions. In its full generality, we know of four types of arguments that can prove this theorem: the…

Combinatorics · Mathematics 2007-05-23 Terence Tao

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

B. Green and T. Tao have recently proved that 'the set of primes contains arbitrary long arithmetic progressions', answering to an old question with a remarkably simple formulation. The proof does not use any "transcendental" method and any…

Dynamical Systems · Mathematics 2007-05-23 Bernard Host

The Green-Tao-Ziegler theorem provides asymptotics for the number of prime tuples of the form $(\psi_1(n),\ldots,\psi_t(n))$ when $n$ ranges among the integer vectors of a convex body $K\subset [-N,N]^d$ and $\Psi=(\psi_1,\ldots,\psi_t)$ is…

Number Theory · Mathematics 2016-07-25 Pierre-Yves Bienvenu

For any integer $n \geq 2$, let $(m_{1},\ldots,m_{n})$ be a strictly increasing $n$-tuple of positive integers. We show that any subset $A\subset [N]^n$ of density at least $(\log N)^{-c}$ contains a nontrivial configuration of the form…

Number Theory · Mathematics 2026-05-08 Jingwei Guo , Changxing Miao , Guoqing Zhan

We offer a new proof of the Furstenberg-Katznelson multiple recurrence theorem for several commuting probability-preserving transformations T_1, T_2, >..., T_d: \bbZ\curvearrowright (X,\S,\mu), and so, via the Furstenberg correspondence…

Dynamical Systems · Mathematics 2009-03-09 Tim Austin

Furstenberg-Weiss have extended Szemer\'edi's theorem on arithmetic progressions to trees by showing that a large subset of the tree contains arbitrarily long arithmetic subtrees. We study higher dimensional versions that analogously extend…

Combinatorics · Mathematics 2021-11-03 Kamil Bulinski , Alexander Fish

Let $\PP^d$ be the $d$-fold direct product of the set of primes. We prove that if $A$ is a subset of $\PP^d$ of positive relative upper density then $A$ contains infinitely many "corners", that is sets of the form $\{x,x+te_1,...,x+te_d\}$…

Number Theory · Mathematics 2013-06-14 Ákos Magyar , Tatchai Titichetrakun

We prove a variant of the multidimensional polynomial Szemer\'edi theorem of Bergelson and Leibman where one replaces polynomial sequences with other sparse sequences defined by functions that belong to some Hardy field and satisfy certain…

Dynamical Systems · Mathematics 2012-02-23 Nikos Frantzikinakis

We present a short proof of Szemer\'edi's Theorem using a dynamical system enriched by ideas from model theory. The resulting proof contains features reminiscent of proofs based on both ergodic theory and on hypergraph regularity.

Logic · Mathematics 2011-01-27 Henry Towsner
‹ Prev 1 2 3 10 Next ›