Counting quadrant walks via Tutte's invariant method
نویسندگان
چکیده
In the 1970s, William Tutte developed a clever algebraic approach, based on certain "invariants", to solve functional equation that arises in enumeration of properly colored triangulations. The plane lattice walks confined first quadrant is governed by similar equations, and has led past 20 years rich collection attractive results dealing with nature (algebraic, D-finite or not) associated generating function, depending set allowed steps, taken \(\{-1, 0,1\}^2\).We adapt Tutte's approach prove (or reprove) algebraicity all models known conjectured be algebraic. This includes Gessel's famous model, proof ever found for one model weighted steps. To applicable, method requires existence two rational functions called invariant decoupling function respectively. When they exist, follows almost automatically.Then, we move complex analytic viewpoint already proved very powerful, leading particular integral expressions non-D-finite cases, as well proofs non-D-finiteness. We develop this context weaker notion invariant. Now have invariants, those addition obtain integral-free series D-algebraic (that is, satisfies polynomial differential equations).Keywords: Lattice walks, enumeration, differentially series, conformal mappings.Mathematics Subject Classifications: 05A15, 34K06, 39A06, 30C20, 30D05
منابع مشابه
Counting quadrant walks via Tutte’s invariant method
In the 1970s, Tutte developed a clever algebraic approach, based on certain “invariants”, to solve a functional equation that arises in the enumeration of properly colored triangulations. The enumeration of plane lattice walks confined to the first quadrant is governed by similar equations, and has led in the past decade to a rich collection of attractive results dealing with the nature (algebr...
متن کاملCounting walks in a quadrant: a unified approach via boundary value problems
The aim of this article is to introduce a unified method to obtain explicit integral representations of the trivariate generating function counting the walks with small steps which are confined to a quarter plane. For many models, this yields for the first time an explicit expression of the counting generating function. Moreover, the nature of the integrand of the integral formulations is shown...
متن کاملSquare lattice walks avoiding a quadrant
In the past decade, a lot of attention has been devoted to the enumeration of walks with prescribed steps confined to a convex cone. In two dimensions, this means counting walks in the first quadrant of the plane (possibly after a linear transformation). But what about walks in non-convex cones? We investigate the two most natural cases: first, square lattice walks avoiding the negative quadran...
متن کاملCounting Closed Walks and Spanning Trees in Graphs via Linear Algebra and Matrices 1 Adjacency Matrices and Counting Closed Walks
The material of this section is based on Chapter 1 of Richard Stanley’s notes “Topics in Algebraic Combinatorics”, which can be found at http://math.mit.edu/∼rstan/algcomb.pdf. Recall that an m-by-n matrix is an array of numbers (m rows and n columns), and we can multiply an mby-n matrix and an n-by-p matrix together to get an m-by-p matrix. The resulting matrix has entries obtained by taking e...
متن کاملCounting Self-avoiding Walks
The connective constant μ(G) of a graph G is the asymptotic growth rate of the number of self-avoiding walks on G from a given starting vertex. We survey three aspects of the dependence of the connective constant on the underlying graph G. Firstly, when G is cubic, we study the effect on μ(G) of the Fisher transformation (that is, the replacement of vertices by triangles). Secondly, we discuss ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorial theory
سال: 2021
ISSN: ['2766-1334']
DOI: https://doi.org/10.5070/c61055360