The following pages link to Stephen Melczer (Q308952):
Displaying 18 items.
- Asymptotic lattice path enumeration using diagonals (Q308954) (← links)
- On 3-dimensional lattice walks confined to the positive octant (Q505688) (← links)
- Tableau sequences, open diagrams, and Baxter families (Q739059) (← links)
- Counting walks with large steps in an orthant (Q2039575) (← links)
- Stationary points at infinity for analytic combinatorics (Q2088140) (← links)
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems (Q2211202) (← links)
- Asymptotic enumeration of lonesum matrices (Q2221782) (← links)
- Counting partitions inside a rectangle (Q2306532) (← links)
- Weighted lattice walks and universality classes (Q2401984) (← links)
- Vertically constrained Motzkin-like paths inspired by bobbin lace (Q2415078) (← links)
- A Baxter class of a different kind, and other bijective results using tableau sequences ending with a row shape (Q2803307) (← links)
- Symbolic-Numeric Tools for Analytic Combinatorics in Several Variables (Q2985845) (← links)
- Singularity Analysis Via the Iterated Kernel Method (Q3191205) (← links)
- Diagonal asymptotics for symmetric rational functions via ACSV (Q4993534) (← links)
- Asymptotic Bounds on Graphical Partitions and Partition Comparability (Q5006211) (← links)
- Combinatorial Adventures in Analysis, Algebra, and Topology (Q5149396) (← links)
- Computing error bounds for asymptotic expansions of regular P-recursive sequences (Q6181106) (← links)
- Asymptotics of multivariate sequences. IV: Generating functions with poles on a hyperplane arrangement (Q6192072) (← links)
