中文
相关论文

相关论文: The Gaussian primes contain arbitrarily shaped con…

200 篇论文

Given any number field, we prove that there exist arbitrarily shaped constellations consisting of pairwise non-associate prime elements of the ring of integers. This result extends the celebrated Green-Tao theorem on arithmetic progressions…

We establish the existence of infinitely many \emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $P_1, >..., P_k \in \Z[\m]$ in one unknown $\m$ with $P_1(0) = ... = P_k(0) = 0$ and any $\eps…

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

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

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

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

We show that there exists some $\delta > 0$ such that, for any set of integers $B$ with $B\cap[1,Y]\gg Y^{1-\delta}$ for all $Y \gg 1$, there are infinitely many primes of the form $a^2+b^2$ with $b\in B$. We prove a quasi-explicit formula…

数论 · 数学 2025-06-18 Jori Merikoski

For any measure preserving system $(X,\mathcal{X},\mu,T)$ and $A\in\mathcal{X}$ with $\mu(A)>0$, we show that there exist infinitely many primes $p$ such that $\mu\bigl(A\cap T^{-(p-1)}A\cap T^{-2(p-1)}A\bigr) > 0$ (the same holds with…

动力系统 · 数学 2007-05-23 Nikos Frantzikinakis , Bernard Host , Bryna Kra

We consider the problem of finding small prime gaps in various sets of integers $\mathcal{C}$. Following the work of Goldston-Pintz-Yildirim, we will consider collections of natural numbers that are well-controlled in arithmetic…

数论 · 数学 2014-05-15 Jacques Benatar

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

Let $A$ be a subset of positive relative upper density of $\PP^d$, the $d$-tuples of primes. We prove that $A$ contains an affine copy of any finite set $F\subs\Z^d$, which provides a natural multi-dimensional extension of the theorem of…

数论 · 数学 2023-09-12 Brian Cook , Ákos Magyar , Tatchai Titichetrakun

We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic…

数论 · 数学 2015-09-08 Janos Pintz

Suppose that $n$ is $0$ or $4$ modulo $6$. We show that there are infinitely many primes of the form $p^2 + nq^2$ with both $p$ and $q$ prime, and obtain an asymptotic for their number. In particular, when $n = 4$ we verify the `Gaussian…

数论 · 数学 2024-10-15 Ben Green , Mehtaab Sawhney

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

In a recent advance towards the Prime $k$-tuple Conjecture, Maynard and Tao have shown that if $k$ is sufficiently large in terms of $m$, then for an admissible $k$-tuple $\mathcal{H}(x) = \{gx + h_j\}_{j=1}^k$ of linear forms in…

A celebrated and deep result of Green and Tao states that the primes contain arbitrarily long arithmetic progressions. In this note I provide a straightforward argument demonstrating that the primes get arbitrarily close to arbitrarily long…

经典分析与常微分方程 · 数学 2019-09-20 Jonathan M. Fraser

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

We study Gaussian primes lying in narrow sectors, and show that almost all such sectors contain the expected number of primes, if the sectors are not too narrow.

数论 · 数学 2019-03-12 Bingrong Huang , Jianya Liu , Zeév Rudnick

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

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

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

数论 · 数学 2007-05-23 D. A. Goldston , J. Pintz , C. Y. Yildirim
‹ 上一页 1 2 3 10 下一页 ›