Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Barak, B., Shaltiel, R., Wigderson, A.: Computational analogues of entropy. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 200–215. Springer, Heidelberg (2003)
Dziembowski, S., Pietrzak, K.: Leakage-resilient cryptography. In: Proceedings of the 49th IEEE Symposium on Foundations of Computer Science, pp. 293–302 (2008)
Gowers, T.: Decompositions, approximate structure, transference, and the Hahn-Banach theorem, arXiv:0811.3103 (2008)
Gowers, T., Wolf, J.: Linear forms and higher-degree uniformity for functions on \(\mathbb{F}_p^n\), arXiv:1002.2208 (2010)
Gowers, T., Wolf, J.: Linear forms and quadratic uniformity for functions on \(\mathbb{F}_p^n\), arXiv:1002.2209 (2010)
Green, B., Tao, T.: The primes contain arbitrarily long arithmetic progressions. Annals of Mathematics 167, 481–547 (2008)
Impagliazzo, R.: Hard-core distributions for somewhat hard problems. In: Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, pp. 538–545 (1995)
Impagliazzo, R.: Personal Communication (2008)
Mironov, I., Pandey, O., Reingold, O., Vadhan, S.P.: Computational differential privacy. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 126–142. Springer, Heidelberg (2009)
Reingold, O., Trevisan, L., Tulsiani, M., Vadhan, S.: Dense subsets of pseudorandom sets. In: Proceedings of the 49th IEEE Symposium on Foundations of Computer Science, pp. 76–85 (2008)
Szemerédi, E.: On sets of integers containing no four elements in arithmetic progression. Acta Math. Acad. Sci. Hung. 20, 89–104 (1969)
Szemerédi, E.: On sets of integers containing no k elements in arithmetic progression. Acta Arithmetica 27, 199–245 (1975)
Tao, T., Ziegler, T.: The primes contain arbitrarily long polynomial progressions. Acta Mathematica 201, 213–305 (2008)
Trevisan, L., Tulsiani, M., Vadhan, S.: Regularity, boosting, and efficiently simulating every high-entropy distribution. In: Proceedings of the 24th IEEE Conference on Computational Complexity (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 International Association for Cryptologic Research
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-642-19571-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-19571-6_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19570-9
Online ISBN: 978-3-642-19571-6
eBook Packages: Computer ScienceComputer Science (R0)