5 citations · 5 across the 2 of their papers we have counts for
6 papers · 1 filter
Higher Dimensional Lattice Walks: Connecting Combinatorial and Analytic Behavior
Stephen Melczer, Mark C. Wilson
We consider the enumeration of walks on the non-negative lattice , with steps defined by a set . Previous…
A fast algorithm for solving linearly recurrent sequences
Seung Gyu Hyun, Stephen Melczer, Catherine St-Pierre
We present an algorithm which computes the term of a sequence satisfying a linear recurrence relation of order over a field in $O( \mathsf{M}(\bar d)\log(D) + \mat…
Counting walks with large steps in an orthant
Alin Bostan, Mireille Bousquet-Mélou, Stephen Melczer
In the past fifteen years, the enumeration of lattice walks with steps takenin a prescribed set S and confined to a given cone, especially the firstquadrant of the plane, has been…
Counting partitions inside a rectangle
Stephen Melczer, Greta Panova, Robin Pemantle
We consider the number of partitions of whose Young diagrams fit inside an rectangle; equivalently, we study the coefficients of the -binomial coefficient $\…
Diagonal asymptotics for symmetric rational functions via ACSV
Yuliy Baryshnikov, Stephen Melczer, Robin Pemantle +1
We consider asymptotics of power series coefficients of rational functions of the form where is a symmetric multilinear polynomial. We review a number of such cases from…
Vertically constrained Motzkin-like paths inspired by bobbin lace
Veronika Irvine, Stephen Melczer, Frank Ruskey
Inspired by a new mathematical model for bobbin lace, this paper considers finite lattice paths formed from the set of step vectors $\se…