AbstractIn this paper we prove a strengthening of the classical Chung–Feller theorem and a weighted version for Schröder paths. Both results are proved by refined bijections which are developed from the study of Taylor expansions of generating functions. By the same technique, we establish variants of the bijections for Catalan paths of order d and certain families of Motzkin paths. Moreover, we obtain a neat formula for enumerating Schröder paths with flaws
In this bachelor thesis, we introduce the Catalan, Schröder, Motzkin, Narayana and Delannoy numbers....
A simple bijection is established between Morgan trees and Dyck paths. As a consequence, exact enume...
A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg, i...
AbstractIn this paper we prove a strengthening of the classical Chung–Feller theorem and a weighted ...
AbstractIn this paper we introduce two new expansions for the generating functions of Catalan number...
AbstractWe deal with non-decreasing paths on the non-negative quadrant of the integral square lattic...
AbstractThis paper deals with a study of the class P of lattice paths, made of north, east, south, a...
AbstractWe consider sequences of polynomials which count lattice paths by area. In some cases the re...
AbstractThis note generalizes André's reflection principle to give a new combinatorial proof of a fo...
AbstractIn the existing literature there are many combinatorial interpretations for the sequence (ai...
AbstractIn 1996, Garsia and Haiman introduced a bivariate analogue of the Catalan numbers that count...
AbstractThis paper develops a unified enumerative and asymptotic theory of directed two-dimensional ...
International audienceWe analyze some enumerative and asymptotic properties of Dyck paths under a li...
AbstractWe use some combinatorial methods to study underdiagonal paths (on the Z2 lattice) made up o...
AbstractA lattice path is a path on lattice points (points with integer coordinates) in the plane in...
In this bachelor thesis, we introduce the Catalan, Schröder, Motzkin, Narayana and Delannoy numbers....
A simple bijection is established between Morgan trees and Dyck paths. As a consequence, exact enume...
A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg, i...
AbstractIn this paper we prove a strengthening of the classical Chung–Feller theorem and a weighted ...
AbstractIn this paper we introduce two new expansions for the generating functions of Catalan number...
AbstractWe deal with non-decreasing paths on the non-negative quadrant of the integral square lattic...
AbstractThis paper deals with a study of the class P of lattice paths, made of north, east, south, a...
AbstractWe consider sequences of polynomials which count lattice paths by area. In some cases the re...
AbstractThis note generalizes André's reflection principle to give a new combinatorial proof of a fo...
AbstractIn the existing literature there are many combinatorial interpretations for the sequence (ai...
AbstractIn 1996, Garsia and Haiman introduced a bivariate analogue of the Catalan numbers that count...
AbstractThis paper develops a unified enumerative and asymptotic theory of directed two-dimensional ...
International audienceWe analyze some enumerative and asymptotic properties of Dyck paths under a li...
AbstractWe use some combinatorial methods to study underdiagonal paths (on the Z2 lattice) made up o...
AbstractA lattice path is a path on lattice points (points with integer coordinates) in the plane in...
In this bachelor thesis, we introduce the Catalan, Schröder, Motzkin, Narayana and Delannoy numbers....
A simple bijection is established between Morgan trees and Dyck paths. As a consequence, exact enume...
A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg, i...