2015
DOI: 10.1007/s00453-015-0063-1
|View full text |Cite
|
Sign up to set email alerts
|

Asymptotic Lattice Path Enumeration Using Diagonals

Abstract: Abstract. This work presents new asymptotic formulas for family of walks in Weyl chambers. The models studied here are defined by step sets which exhibit many symmetries and are restricted to the first orthant. The resulting formulas are very straightforward: the exponential growth of each model is given by the number of steps, while the sub-exponential growth depends only on the dimension of the underlying lattice and the number of steps moving forward in each coordinate. These expressions are derived by anal… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
32
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 20 publications
(32 citation statements)
references
References 32 publications
0
32
0
Order By: Relevance
“…Note that the power series expansion of 1/H(z, t) has all non-negative coefficients, which will allow us to simplify necessary characterizations of the singularities of G(z, t)/H(z, t) below. In the special case where S is symmetric over all axes, we obtain an expression different from that in [38]; by forcing positivity on our series coefficients we have lost some symmetry and less cancellation occurs. For example, the generating function of the model with all possible steps in 2 dimensions is the diagonal of…”
Section: A Diagonal Representationmentioning
confidence: 85%
See 3 more Smart Citations
“…Note that the power series expansion of 1/H(z, t) has all non-negative coefficients, which will allow us to simplify necessary characterizations of the singularities of G(z, t)/H(z, t) below. In the special case where S is symmetric over all axes, we obtain an expression different from that in [38]; by forcing positivity on our series coefficients we have lost some symmetry and less cancellation occurs. For example, the generating function of the model with all possible steps in 2 dimensions is the diagonal of…”
Section: A Diagonal Representationmentioning
confidence: 85%
“…where a i,n counts the number of weighted walks of length n using the steps in S, beginning at the origin, ending at i ∈ N d , and never leaving the non-negative orthant in Z d . Describing a walk of length n ending at i ∈ N d recursively as a walk of length n − 1 followed by a single step, one can show (see Melczer and Mishna [38]) that the generating function satisfies a functional equation of the form…”
Section: A Generating Function Expression Via the Kernel Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Singularity analysis of generating function expressions has led to new results [18,35], in addition to advances on the work of Denisov and Wachtel [13,16,23]. The techniques of Pemantle and Wilson [43] on analytic combinatorics in several variables, combined with expressions for walk generating functions as rational diagonals, have yielded explicit asymptotics for a large collection of models [36,37], and we take a similar approach to weighted models in this work.…”
Section: Enumeration Of Walks In Conesmentioning
confidence: 99%