Generating functions with high-order poles are nearly polynomial
From MaRDI portal
(Redirected from Generating functions with high-order poles are nearly polynomial)
asymptotic seriesautomatic coefficient extractionCauchy integral formulaconvolutiongenerating functionmeromorphicmultiple point
Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Meromorphic functions of several complex variables (32A20)
Recommendations
- Asymptotics of multivariate sequences. I: Smooth points of the singular variety
- Twenty Combinatorial Examples of Asymptotics Derived from Multivariate Generating Functions
- Asymptotics of Multivariate Sequences II: Multiple Points of the Singular Variety
- Remarks on an asymptotic method in combinatorics
- Asymptotics of coefficients of multivariate generating functions: improvements for multiple points
Cited in
(6)- Asymptotics of subtracted singularities for generating functions with small singularities
- Limit theorems for patterns in phylogenetic trees
- D E K=(100)_8
- Random maps, coalescing saddles, singularity analysis, and Airy phenomena
- Extensions of Asymptotic Fields Via Meromorphic Functions
- Asymptotics of multivariate sequences. IV: Generating functions with poles on a hyperplane arrangement
This page was built for publication: Generating functions with high-order poles are nearly polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4524591)
