The DOI matches its Crossref record.
Enumerative Combinatorics
Abstract
This book is the first of a two-volume basic introduction to enumerative combinatorics at a level suitable for graduate students and research mathematicians. It concentrates on the theory and application of generating functions, a fundamental tool in enumerative combinatorics. The book covers those parts of enumerative combinatorics of greatest applicability to other areas of mathematics. The four chapters are devoted to an introduction to enumeration (suitable for advanced undergraduates), sieve methods (including the Principle of Inclusion-Exclusion), partially ordered sets, and rational generating functions. There are a large number of exercises, almost all with solutions, which greatly augment the text and provide entry into many areas not covered directly. Graduate students and research mathematicians who wish to apply combinatorics to their work will find this an authoritative reference.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Group representations in probability and statistics
Diaconis, P. (1988) · doi:10.1214/lnms/1215467407 · Cited by 1,381
Lectures on Algebraic Statistics
Drton, M., Sturmfels, B., & Sullivant, S. (2009) · Birkhäuser Basel eBooks · doi:10.1007/978-3-7643-8905-5 · Cited by 365
Qualia: The Geometry of Integrated Information
Balduzzi, D., & Tononi, G. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000462 · Cited by 269
(2006) · doi:10.1088/0264-9381/23/14/011 · Cited by 39
Metadata
- Authors
- Stanley, R. P., & Rota, G.-C.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 1997-04-13
- OpenAlex
- W2914659449
- Cited by
- 6,025
- References
- 0
- FWCI
- 33.19
- Type
- book
- Language
- en
- Open access
- closed
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: Enumerative Combinatorics. https://app.cochat.ai/papers/10.1017/cbo9780511805967
- The paper
- Stanley, R. P., & Rota, G.-C. (1997). Enumerative Combinatorics. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9780511805967
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.
