Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T16:45:30.375Z Has data issue: false hasContentIssue false

Some asymptotic methods in combinatorics

Published online by Cambridge University Press:  09 April 2009

J. M. Plotkin
Affiliation:
Michigan State UniversityEast Lansing 48824, USA
John Rosenthal
Affiliation:
Ithaca CollegeIthaca 14850, USA
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let 〈fn≧0 be nonnegative real numbers with generating function f(x) = Σfnxn. Assume f(x) has the following properties: it has a finite nonzero radius of convergence x0 with its only singularity on the circle of convergence at x = x0 and f(x0) converges to y0; y = f(x) satisfies an analytic identity F(x, y) = 0 near (x0, y0); Fy(l) (x0, y0)= 0, 0 ≦ i < k and Fy(k) (x0, y0) ≠ 0. There are constants γ, a positive rational, and c such that fn~cx0−n n−(1 +ggr;). Furthermore, we show (i) in all cases how to determine γ and c from f(x) and (ii) in certain cases how to determine them from F(x, y).

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1979