• Aucun résultat trouvé

Erratum to “The primes contain arbitrarily long polynomial progressions”

N/A
N/A
Protected

Academic year: 2022

Partager "Erratum to “The primes contain arbitrarily long polynomial progressions”"

Copied!
2
0
0

Texte intégral

(1)

Acta Math., 210 (2013), 403–404 DOI: 10.1007/s11511-013-0097-7

c 2013 by Institut Mittag-Leffler. All rights reserved

Erratum to “The primes contain arbitrarily long polynomial progressions”

by

Terence Tao

University of California, Los Angeles Los Angeles, CA, U.S.A.

Tamar Ziegler

University of Michigan Ann Arbor, MI, U.S.A.

The original article appeared in Acta Math., 201 (2008), 213–305 DOI: 10.1007/s11511-008-0032-5

Erratum

We wish to issue an erratum for the paper [1]. As the paper is currently written, there is an error just before equation (73) of page 269, in which it is claimed thatO(MO(1/η1)) is negligible compared to

N, which is not the case due to the wayM and η1 are con- structed. However, this can be fixed by a careful tracking of the degrees of all the polyno- mials involved (and a corresponding modification of the polynomial forms and polynomial correlation conditions defined in Definition 3.6, page 231, and in Definition 3.9, page 232, respectively), which ends up replacingO(MO(1/η1)) byO(MdWO(1/η1)), wheredis the largest degree of the original polynomialsP1, ..., Pk.

More specifically, the following corrections need to be made:

After the sentence following (5) on page 221, the following paragraph should be added: “Throughout this paper, we set d to be the largest degree of the polynomials P1, ..., Pk.”. On the same page, in the bullet point definingη0, replace “1/2d, wheredis the largest degree of the polynomialsP1, ..., Pk” by “1/2d”. In the third bullet point, replace “1/d” by “1/d”.

In Definition 3.6 on page 231, replace “total degree at most 11” by “total degree at mostd”. In Remark 3.8, delete “degree” from “degree, dimension, number and size”, and replace “four parameters” by “three parameters”.

In Definition 3.9, page 232, replace “degree at most 11” by “degree at mostd”.

(2)

404 t. tao and t. ziegler

In Theorem 4.5 on page 238, replace “of degreeO(1)” by “of degree at mostd”.

In Theorem 4.7 on page 239, replace “of degreeO(1)” by “of degree at mostd”.

In Definition 5.1 on page 242, add the restriction that each of the polynomialsRα

has degree at mostd.

In Proposition 5.9 on page 244, add the conclusion thatQhas degree at mostd.

After Definition 5.11 on page 245, add the remark that in this paper, one only needs to consider weight vectors withwi=0 for alli>d.

Before the equation (73) on page 269, replace MO(1/η1) by MdWO(1/η1) (two occurrences).

Thanks to Le Thai Hoang and Julia Wolf for reporting this issue with the paper.

References

[1] Tao, T. & Ziegler, T., The primes contain arbitrarily long polynomial progressions.Acta Math., 201 (2008), 213–305.

Terence Tao

Department of Mathematics

University of California, Los Angeles Los Angeles, CA 90095-1555 U.S.A.

[email protected]

Tamar Ziegler

Department of Mathematics University of Michigan Ann Arbor, MI 48109 U.S.A.

[email protected] Received February 28, 2013

Références

Documents relatifs

As shown in Figure 3(A), the sphingolipid profile of 4.Lass5 lip1 was similar to the one of 4.Lass5 (Figure 3A, lanes 3 and 5), and quantitation by radioscanning of TLC plates in

glycerophospholipids and IPCs were extracted using CHCl 3 -CH 3 OH (1:1), and the desalted lipid extract was analyzed by ESI-MS on a Bruker 4.7 T BioAPEX II FT/ICR mass..

An appendix by Oriol Serra furthermore provides the reader with a simple proof of the special case of Kneser’s Theorem that we need, namely with equal summands.. We recall

Now, let G be a connected graph consisting of two or more vertices, and let v be some vertex of G. For any simplicial graph G and any simplicial clique K 6 G, the line graph of

Buchstab: On an asymptotic estimate of the number of numbers of an arithmetic progression which are not divisible by relatively small prime numbers, Mat. Granville:

Selberg, An elementary proof of the prime number theorem for arithmetic progressions. Selberg, The general sieve-method and its place in prime

We give a new proof that there are infinitely many primes, relying on van der Waer- den’s theorem for coloring the integers, and Fermat’s theorem that there cannot be four squares in

In [7, Section 1], Djament and Vespa construct a framework to define strong polynomial functors in the category Fct(M, A), where M is a sym- metric monoidal category, the unit is