The CAGE (Combinatorics, Algebra, and Geometry) Seminar: Tristan Larson, 14 November 2024


Asymptotics of bivariate generating functions with logarithms

Tristan Larson | 2024-11-14 at 3:30 PM, at David Rittenhouse Laboratory (UPenn), room 2C4

Abstract: We derive asymptotic formulae for the coefficients of bivariate generating functions with algebraic and logarithmic factors. Logarithms appear when encoding cycles of combinatorial objects, implicitly when objects can be broken into indecomposable parts, and in PĆ³lya enumeration. Asymptotics are quickly computable and can verify combinatorial properties of sequences and assist in randomly generating objects. While multiple approaches for algebraic asymptotics have recently emerged, we find that the contour manipulation approach can be extended to generating functions of this type. As an example, we apply the result to the generating function for cyclic partitions of an n-set.


Back to the seminar homepage.