5 citations · 5 across the 2 of their papers we have counts for
4 papers · 1 filter
Asymptotic enumeration of lonesum matrices
Jessica Khera, Erik Lundberg, Stephen Melczer
We provide bivariate asymptotics for the poly-Bernoulli numbers, a combinatorial array that enumerates lonesum matrices, using the methods of Analytic Combinatorics in Several Vari…
Change of basis for m-primary ideals in one and two variables
Seung Gyu Hyun, Stephen Melczer, Éric Schost +1
Following recent work by van der Hoeven and Lecerf (ISSAC 2017), we discuss the complexity of linear mappings, called untangling and tangling by those authors, that arise in the co…
Stationary points at infinity for analytic combinatorics
Yuliy Baryshnikov, Stephen Melczer, Robin Pemantle
On complex algebraic varieties, height functions arising in combinatorial applications fail to be proper. This complicates the description and computation via Morse theory of key t…
Effective Coefficient Asymptotics of Multivariate Rational Functions via Semi-Numerical Algorithms for Polynomial Systems
Stephen Melczer, Bruno Salvy
The coefficient sequences of multivariate rational functions appear in many areas of combinatorics. Their diagonal coefficient sequences enjoy nice arithmetic and asymptotic proper…