Asymptotics of lattice walks via analytic combinatorics in several variables
We consider the enumeration of walks on the two-dimensional non-negative integer lattice with steps defined by a finite set S ⊆ {±1, 0}2 . Up to isomorphism there are 79 unique two-dimensional models to consider, and previous work in this area has used the kernel method, along with a rigorous comput...
Main Authors: | Stephen Melczer, Mark C. Wilson |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2020-04-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/6390/pdf |
Similar Items
-
Asymptotics of Bivariate Analytic Functions with Algebraic Singularities
by: Torin Greenwood
Published: (2020-04-01) -
Quasi-isomorphisms of cluster algebras and the combinatorics of webs (extended abstract)
by: Chris Fraser
Published: (2020-04-01) -
Plane partitions and the combinatorics of some families of reduced Kronecker coefficients.
by: Laura Colmenarejo
Published: (2020-04-01) -
Brick polytopes, lattices and Hopf algebras
by: Vincent Pilaud
Published: (2020-04-01) -
Symmetric Chain Decompositions and the Strong Sperner Property for Noncrossing Partition Lattices
by: Henri Mühle
Published: (2020-04-01)