arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1006.0205math.NTmath.DS
收藏

Gowers U^{s+1}[N]-范数的一个逆定理(公告)

An inverse theorem for the Gowers U^{s+1}[N]-norm (announcement)

Ben Green, Terence Tao, Tamar Ziegler

摘要:

在这篇注记中,我们宣布对所有s => 3的Gowers U^{s+1}[N]-范数的逆猜想的证明;这对于s => 4是新的,s = 1,2,3的情况以前已经建立。更确切地说,我们概述了一个证明(细节将出现在即将出版的论文),如果f:[N] -> [-1,1]是一个函数,||F||_{U^{s+1}[N]} => δ则存在一个与f相关的有界复杂度s-步零序列F(g(n)Γ),其中复杂度和相关度的界仅依赖于s和δ.从以前的结果来看,这个猜想对任何有限复杂度的线性系都是Hardy-Littlewood素元组猜想。特别地,我们得到了k项等差数列p_1 < p_2 <.的渐近公式。< p_k <= N个素数,对于每个k => 3。

英文摘要:

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 will appear in a forthcoming paper) that if f : [N] -> [-1,1] is a function with || f ||_{U^{s+1}[N]} => δthen there is a bounded-complexity s-step nilsequence F(g(n)Γ) which correlates with f, where the bounds on the complexity and correlation depend only on s and δ. From previous results, this conjecture implies the Hardy-Littlewood prime tuples conjecture for any linear system of finite complexity. In particular, one obtains an asymptotic formula for the number of k-term arithmetic progressions p_1 < p_2 < ... < p_k <= N of primes, for every k => 3.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑