Algorithms for Bivariate Singularity Analysis

An algorithm for bivariate singularity analysis is developed. For a wide class of bivariate, rational functions F = P/Q, this algorithm produces rigorous numerics for the asymptotic analysis of the Taylor coefficients of F at the origin. The paper begins with a self-contained treatment of multivariate singularity analysis. The analysis itself relies heavily on the geometry of the pole set VQ of F with respect to a height function h. This analysis is then applied to obtain asymptotics for the number of bicolored supertrees, computed in a purely multivariate way. This example is interesting in that the asymptotics can not be computed directly from the standard formulas of multivariate singularity analysis. Motivated by the topological study required by this example, we present characterization theorems in the bivariate case that classify the geometric features salient to the analysis. These characterization theorems are then used to produce an algorithm for this analysis in the bivariate case. A full implementation of the algorithm follows.

Author dc:creator

• DeVries, Timothy

Advisor dc:contributor.advisor

• Robin Pemantle

Repository record dc:identifier.uri

https://repository.upenn.edu/handle/20.500.14332/30264

OAI identifier oai:identifier

oai:repository.upenn.edu:20.500.14332/30264