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

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

2010-09-21

arxiv.org/abs/1009.3998v3

Mathematics

Combinatorics

116 pages. Submitted

Scientific paper

We prove the inverse conjecture for the Gowers U^{s+1}[N]-norm for all s >= 3; this is new for s > 3, and the cases s<3 have also been previously established. More precisely, we establish that if f : [N] -> [-1,1] is a function with || f ||_{U^{s+1}[N]} > \delta then there is a bounded-complexity s-step nilsequence F(g(n)\Gamma) which correlates with f, where the bounds on the complexity and correlation depend only on s and \delta. From previous results, this conjecture implies the Hardy-Littlewood prime tuples conjecture for any linear system of finite complexity.

Affiliated with

Also associated with

No associations

Rating

An inverse theorem for the Gowers U^{s+1}[N]-norm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An inverse theorem for the Gowers U^{s+1}[N]-norm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An inverse theorem for the Gowers U^{s+1}[N]-norm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-697171