Counting Lattice Paths by Gessel Pairs
نویسنده
چکیده
We count a large class of lattice paths by using factorizations of free monoids. Besides the classical lattice paths counting problems related to Catalan numbers, we give a new approach to the problem of counting walks on the slit plane (walks avoid a half line) that was first solved by Bousquet-Mélou and Schaeffer. We also solve a problem about walks in the half plane avoiding a half line by subsequently applying the factorizations of two different Gessel pairs, giving a generalization of a result of Bousquet-Mélou.
منابع مشابه
A Short Conceptual Proof of Narayana's Path-Counting Formula
We deduce Narayana’s formula for the number of lattice paths that fit in a Young diagram as a direct consequence of the Gessel-Viennot theorem on non-intersecting lattice paths.
متن کاملCounting Paths in Young’s Lattice
Young’s lattice is the lattice of partitions of integers, ordered by inclusion of diagrams. Standard Young tableaux can be represented as paths in Young’s lattice that go up by one square at each step, and more general paths in Young’s lattice correspond to more general kinds of tableaux. Using the theory of symmetric functions, in particular Pieri’s rule for multiplying a Schur function by a c...
متن کاملCounting Pairs of Lattice Paths by Intersections
Consider an r × (n − r) plane lattice rectangle, and walks that begin at the origin (south-west corner), proceed with unit steps in either of the directions east or north, and terminate at the north-east corner of the rectangle. For each integer k we ask for N k , the number of ordered pairs of these walks that intersect in exactly k points. The number of points in the intersection of two such ...
متن کاملEven and Odd Pairs of Lattice Paths with Multiple Intersections
Let be the number of ordered pairs of paths in the plane, with unit steps E or N, that intersect k times in which the first path ends at the point (r,n-r) and the second path ends at the point (s,n-s). Let and We study the numbers , , , and , prove several simple relations among them, and derive a simpler formula for than appears in [1].
متن کاملCounting intersecting weighted pairs of lattice paths using transforms of operators
Transforms of linear operators on bivariate generating functions can be used for constructing explicte solutions to certain generalized q di¤erence equations. The method is applied to counting intersecting pairs of lattice paths with weighted turns, a re nement of the q-Narayana numbers.
متن کامل