The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Singularity Analysis of Generating Functions
Open accessAbstract
This work presents a class of methods by which one can translate, on a term-by-term basis, an asymptotic expansion of a function around a dominant singularity into a corresponding asymptotic expansion for the Taylor coefficients of the function. This approach is based on contour integration using Cauchy’s formula and Hankel-like contours. It constitutes an alternative to either Darboux’s method or Tauberian theorems that appears to be well suited to combinatorial enumerations, and a few applications in this area are outlined.
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
Cites
(1916) · Nature · doi:10.1038/097298a0 · Cited by 2,636
Applied and Computational Complex Analysis
Thacher, H. C., & Henrici, P. (1977) · Mathematics of Computation · doi:10.2307/2005805 · Cited by 2,022
Stanley, R. P. (1986) · Springer eBooks · doi:10.1007/978-1-4615-9763-6 · Cited by 1,796
Asymptotic methods in analysis
de Bruijn, N. G. (1958) · International Linear Collider · Cited by 1,332
Pemantle, R., Wilson, M. C., & Melczer, S. (2024) · Cambridge University Press eBooks · doi:10.1017/9781108874144.003 · Cited by 939
The Art of Computer Programming, Vol. 2
Knuth, D. E. (1981) · Medical Entomology and Zoology · Cited by 886
Advanced Combinatorics: The Art of Finite and Infinite Expansions
Comtet, L. (1974) · CERN Document Server (European Organization for Nuclear Research) · doi:10.1007/978-94-010-2196-8 · Cited by 884
The art of computer programming. Vol.1: Fundamental algorithms
Knuth, D. E. (1978) · Virtual Defense Library (Ministerio de Defensa) · Cited by 801
Asymptotic Methods in Analysis
Fedoryuk, M. V. (1989) · Encyclopaedia of Mathematical Sciences · doi:10.1007/978-3-642-61310-4_2 · Cited by 508
Asymptotic Methods in Enumeration
Bender, E. A. (1974) · SIAM Review · doi:10.1137/1016082 · Cited by 440
Cited by
Durrett, R. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546594 · Cited by 780
Knuth, D. E. (1992) · American Mathematical Monthly · doi:10.2307/2325085 · Cited by 367
Flajolet, P., & Odlyzko, A. M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46885-4_34 · Cited by 274
Self-citationStatistical and algorithmic methods for fluctuation analysis with SALVADOR as an implementation
Zheng, Q. (2002) · Mathematical Biosciences · doi:10.1016/s0025-5564(02)00087-1 · Cited by 70
On Bartlett’s formulation of the Luria–Delbrück mutation model
Zheng, Q. (2008) · Mathematical Biosciences · doi:10.1016/j.mbs.2008.05.005 · Cited by 16
Metadata
- Authors
- Flajolet, P., & Odlyzko, A.
- Venue
- SIAM Journal on Discrete Mathematics
- Published
- 1990-05
- Volume
- 3
- Issue
- 2
- Pages
- 216-240
- ISSN
- 0895-4801 (ISSN-L)
- 1095-7146
- OpenAlex
- W2018919817
- Cited by
- 821
- References
- 17
- FWCI
- 31.15
- Type
- journal article
- Language
- en
- Open access
- green
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: Singularity Analysis of Generating Functions. https://app.cochat.ai/papers/10.1137/0403019
- The paper
- Flajolet, P., & Odlyzko, A. (1990). Singularity Analysis of Generating Functions. SIAM Journal on Discrete Mathematics. https://doi.org/10.1137/0403019
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.