中文
相关论文

相关论文: A transference principle for systems of linear equ…

200 篇论文

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.…

数论 · 数学 2019-02-20 Yufei Zhao

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…

数论 · 数学 2015-10-26 David Conlon , 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…

数论 · 数学 2019-06-14 Luka Rimanic , Julia Wolf

We survey four instances of the Fourier analytic 'transference principle' or 'dense model lemma', which allows one to approximate an unbounded function on the integers by a bounded function with similar Fourier transform. Such a result…

数论 · 数学 2015-10-01 Sean Prendiville

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…

数论 · 数学 2021-10-12 Sam Chow

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…

数论 · 数学 2015-10-26 Jacob Fox , Yufei Zhao

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…

组合数学 · 数学 2008-06-04 Omer Reingold , Luca Trevisan , Madhur Tulsiani , Salil Vadhan

Following an approach presented by N. Frantzikinakis, B. Host and B. Kra, we show that the parameters in the multidimensional Szemer\'edi theorem for closest integer polynomials have non-empty intersection with the set of shifted primes…

动力系统 · 数学 2016-09-28 Andreas Koutsogiannis

Green and Tao famously proved in a 2008 paper that there are arithmetic progressions of prime numbers of arbitrary lengths. Soon after, analogous statements were proved by Tao for the ring of Gaussian integers and by L\^e for the polynomial…

数论 · 数学 2022-04-12 Wataru Kai

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…

数论 · 数学 2007-09-23 Ben Green , Terence Tao

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…

数论 · 数学 2014-07-07 Keenan Monks , Sarah Peluse , Lynnelle Ye

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…

数论 · 数学 2013-12-03 Terence Tao , Tamar Ziegler

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…

动力系统 · 数学 2007-05-23 Bernard Host

In the present work the existence of some patterns of primes is shown which generalize the celebrated result of Green and Tao according to which there are arbitrarily long arithmetic progressions in the sequence of primes

数论 · 数学 2010-04-08 Janos Pintz

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…

数论 · 数学 2007-05-23 Terence Tao

Let $\Psi$ be a system of linear forms with finite complexity. In their seminal paper, Green and Tao showed the following prime number theorem for values of the system $\Psi$: $$\sum_{x\in [-N,N]^d} \prod_{i=1}^t…

数论 · 数学 2023-06-21 Mayank Pandey , Katharine Woo

Let $m\geq 3$. Suppose that $$ 1-2^{-2^{m^24^m}}<\gamma<1. $$ Then the set $$ \{p\text{ prime}:\, p=[n^{\frac1\gamma}]\text{ for some }n\in{\mathbb N}\} $$ contains infinitely many non-trivial $m$-term arithmetic progressions.

数论 · 数学 2019-01-29 Hongze Li , Hao Pan

In this paper we establish a general form of the Mass Transference Principle for systems of linear forms conjectured in [1]. We also present a number of applications of this result to problems in Diophantine approximation. These include a…

数论 · 数学 2019-02-20 Demi Allen , Victor Beresnevich

We establish the following quantitative form of the Green--Tao theorem: if a set $\mathcal{A}$ of relative density $\delta$ within the primes up to $N$ contains no nontrivial arithmetic progressions of length $k\geq 4$, then $\delta\ll…

数论 · 数学 2026-03-11 Joni Teräväinen , Mengdi Wang

We study the prime numbers that lie in Beatty sequences of the form $\lfloor \alpha n + \beta \rfloor$ and have prescribed algebraic splitting conditions. We prove that the density of primes in both a fixed Beatty sequence and a Chebotarev…

数论 · 数学 2019-09-04 Caleb Ji , Joshua Kazdan , Vaughan McDonald
‹ 上一页 1 2 3 10 下一页 ›