Asymptotics for coefficients of algebraic functions
Many enumeration problems can be studied using generating functions. In some such problems it is possible to develop a collection of n related generating functions that satisfy a system of n polynomial equations. This paper explores some properties of functional equations that can be used to handle such situations. We first present a method to derive a polynomial equation in \(x_ 1\) alone from a system of n polynomial equations in \(x_ 1,...,x_ n\). We confine our attention to polynomials with coefficients from the ring Z[x], but the method applies to a more general situation. (Z[x] represents the set of polynomials in x with integer coefficients.) The second concern is to find or estimate the radius of convergence of an algebraic function given a polynomial equation it satisfies.
- Some asymptotic results useful in enumeration problems
- Analytic combinatorics of non-crossing configurations
- On an asymptotic method in enumeration
- Polynomial equations with one catalytic variable, algebraic series and map enumeration
- scientific article; zbMATH DE number 986989 (Why is no real title available?)
- scientific article; zbMATH DE number 4202667 (Why is no real title available?)
- Algebraic systems of generating functions and return probabilities for random walks
- The monomial method and asymptotic properties of algebraic systems
- Formulae and asymptotics for coefficients of algebraic functions
- The cogrowth series for BS(N, N) is D-finite
- Coefficients of algebraic functions: formulae and asymptotics
- Asymptotics of Keiper-Li coefficients
- Asymptotic expansions for the coefficients of analytic generating functions
- Remarks on an asymptotic method in combinatorics
This page was built for publication: Asymptotics for coefficients of algebraic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762487)
