AN INVERSE THEOREM FOR THE GOWERS U4-NORM
Glasgow mathematical journal, Tome 53 (2011) no. 1, pp. 1-50
Voir la notice de l'article provenant de la source Cambridge
We prove the so-called inverse conjecture for the Gowers Us+1-norm in the case s = 3 (the cases s < 3 being established in previous literature). That is, we show that if f : [N] → C is a function with |f(n)| ≤ 1 for all n and ‖f‖U4 ≥ δ then there is a bounded complexity 3-step nilsequence F(g(n)Γ) which correlates with f. The approach seems to generalise so as to prove the inverse conjecture for s ≥ 4 as well, and a longer paper will follow concerning this.By combining the main result of the present paper with several previous results of the first two authors one obtains the generalised Hardy–Littlewood prime-tuples conjecture for any linear system of complexity at most 3. In particular, we have an asymptotic for the number of 5-term arithmetic progressions p1 < p2 < p3 < p4 < p5 ≤ N of primes.
GREEN, BEN; TAO, TERENCE; ZIEGLER, TAMAR. AN INVERSE THEOREM FOR THE GOWERS U4-NORM. Glasgow mathematical journal, Tome 53 (2011) no. 1, pp. 1-50. doi: 10.1017/S0017089510000546
@article{10_1017_S0017089510000546,
author = {GREEN, BEN and TAO, TERENCE and ZIEGLER, TAMAR},
title = {AN {INVERSE} {THEOREM} {FOR} {THE} {GOWERS} {U4-NORM}},
journal = {Glasgow mathematical journal},
pages = {1--50},
year = {2011},
volume = {53},
number = {1},
doi = {10.1017/S0017089510000546},
url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089510000546/}
}
TY - JOUR AU - GREEN, BEN AU - TAO, TERENCE AU - ZIEGLER, TAMAR TI - AN INVERSE THEOREM FOR THE GOWERS U4-NORM JO - Glasgow mathematical journal PY - 2011 SP - 1 EP - 50 VL - 53 IS - 1 UR - http://geodesic.mathdoc.fr/articles/10.1017/S0017089510000546/ DO - 10.1017/S0017089510000546 ID - 10_1017_S0017089510000546 ER -
Cité par Sources :