Remarks on an asymptotic method in combinatorics (Q801061): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Asymptotic Methods in Enumeration / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3285751 / rank | |||
Normal rank | |||
Latest revision as of 14:57, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Remarks on an asymptotic method in combinatorics |
scientific article |
Statements
Remarks on an asymptotic method in combinatorics (English)
0 references
1984
0 references
A generating function \(w(z)=\sum a_ nz^ n\) of a sequence of nonnegative numbers \(a_ n\) satisfies a functional equation \(F(z,w)=0\) for an analytic function F. The problem is considered to estimate \(a_ n\) for large n. In particular, algebraic functions F are discussed.
0 references
asymptotic formula
0 references
generating function
0 references
