Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record.

Additive Combinatorics

Tao, Terence, Vu, Van H. · 2006 · Cambridge University Press eBooks

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

Crossref · 10.1017/cbo9780511755149

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Still being checked.

Cited by

See all 897

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
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.