Dense Model Theorems and Their Applications

  • Luca Trevisan
Conference paper

DOI: 10.1007/978-3-642-19571-6_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6597)
Cite this paper as:
Trevisan L. (2011) Dense Model Theorems and Their Applications. In: Ishai Y. (eds) Theory of Cryptography. TCC 2011. Lecture Notes in Computer Science, vol 6597. Springer, Berlin, Heidelberg


In 2004, Ben Green and Terry Tao [6] proved that, for every k, there are infinitely many length-k arithmetic progressions made entirely of prime numbers. This settled a very long-standing open question in number theory that had been open even for the k = 4 case.

Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Luca Trevisan
    • 1
  1. 1.Department of Computer ScienceStanford UniversityStanfordUSA

Personalised recommendations