The DOI matches its Crossref record.
Additive Combinatorics
Abstract
Additive combinatorics is the theory of counting additive structures in sets. This theory has seen exciting developments and dramatic changes in direction in recent years thanks to its connections with areas such as number theory, ergodic theory and graph theory. This graduate-level 2006 text will allow students and researchers easy entry into this fascinating field. Here, the authors bring together in a self-contained and systematic manner the many different tools and ideas that are used in the modern theory, presenting them in an accessible, coherent, and intuitively clear manner, and providing immediate applications to problems in additive combinatorics. The power of these tools is well demonstrated in the presentation of recent advances such as Szemerédi's theorem on arithmetic progressions, the Kakeya conjecture and Erdos distance problems, and the developing field of sum-product estimates. The text is supplemented by a large number of exercises and new results.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Still being checked.
Cited by
Recovering Low-Rank Matrices From Few Coefficients in Any Basis
Gross, D. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2104999 · Cited by 602
Recovering low-rank matrices from few coefficients in any basisPreprint
Gross, D. (2010) · Cited by 576
Mathematical discoveries from program search with large language models
Romera-Paredes, B., Barekatain, M., Novikov, A., Balog, M., Kumar, M. P., Dupont, E., Ruiz, F. J. R., Ellenberg, J. S., Wang, P., Fawzi, O., et al. (2024) · Nature · doi:10.1038/s41586-023-06924-6 · Cited by 544
Random matrices: Universality of ESDs and the circular law
Tao, T., Vu, V., & Krishnapur, M. (2010) · The Annals of Probability · doi:10.1214/10-aop534 · Cited by 415
Self-citationGreen, B., & Tao, T. (2010) · Annals of Mathematics · doi:10.4007/annals.2010.171.1753 · Cited by 389
Self-citation
Metadata
- Authors
- Tao, T., & Vu, V. H.
- Affiliations
- University of California, Los Angeles (US)
- Rutgers, The State University of New Jersey (US)
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2006-09-14
- OpenAlex
- W2912209775
- Cited by
- 816
- References
- 0
- Citations by year
- 2026: 28 · 2025: 40 · 2024: 39 · 2023: 41 · 2022: 29 · 2021: 44 · 2020: 48 · 2019: 66 · 2018: 50 · 2017: 33 · 2016: 48 · 2015: 34 · 2014: 46 · 2013: 45 · 2012: 45
- FWCI
- 8.42
- Type
- book
- Language
- en
- Open access
- closed
- Locations
- Cambridge University Press eBooks (publishedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Topics
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Limits and Structures in Graph Theory
- Physical Sciences › Mathematics › Algebra and Number Theory › Analytic Number Theory Research
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
- Keywords
- additive combinatorics, Szemerédi's theorem, arithmetic progressions, Kakeya conjecture, sum-product estimates, number theory, ergodic theory, graph theory
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Additive Combinatorics. https://app.cochat.ai/papers/10.1017/cbo9780511755149
- The paper
- Tao, T., & Vu, V. H. (2006). Additive Combinatorics. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9780511755149
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.