In this paper configurations of n non-intersecting lattice paths which begin and end on the line y = 0 and are excluded from the region below this line are considered. Such configurations are called Hankel n-paths which make c intersections with the line y = 0 the lowest of which has length 2r. These configurations may also be described as parallel Dyck paths. It is found that replacing by the length generating function for Dyck paths, (!) P1 r=0 Cr!r, where C_r is the rth Catalan number, results in a remarkable simplification of the coefficients of the contact polynomial. In particular it is shown that the polynomial for configurations of a single Dyck path has the expansion ^ ZH 2r(1; (!)) = P1 b=0 Cr+b!b. This result is derived using a...
AbstractAn elementary technique is used for the enumeration of Dyck paths according to various param...
22 pages, 3 figures, 2 tablesWe introduce and study the new combinatorial class of Dyck paths with a...
In this note we examine the number of integer lattice paths consisting of up-steps (1, 1) and down-s...
In this paper configurations of n non-intersecting lattice paths which begin and end on the line y =...
Abstract We define a bijection between permutations and valued Dyck paths, namely, Dyck paths whos...
AbstractIt is well known (see [3, 6, 9, 10, 11]) that Dyck paths are in bijection with “Dyck words”,...
of steps (1; 1) and (1; 1), which never passes below the x-axis. A peak at height k on a Dyck path i...
AbstractA k-generalized Dyck path of length n is a lattice path from (0,0) to (n,0) in the plane int...
A bicoloured Dyck path is a Dyck path in which each up-step is assigned one of two colours, say, red...
AbstractWe introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, wh...
AbstractWe deal with non-decreasing paths on the non-negative quadrant of the integral square lattic...
The combinatorial q, t-Catalan numbers are weighted sums of Dyck paths introduced by J. Haglund and ...
AbstractIn this paper, we introduce a subclass of the Dyck paths (Delest and Viennot, 1984) called n...
We introduce a new poset structure on Dyck paths where the covering relation is a particular case of...
A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg in...
AbstractAn elementary technique is used for the enumeration of Dyck paths according to various param...
22 pages, 3 figures, 2 tablesWe introduce and study the new combinatorial class of Dyck paths with a...
In this note we examine the number of integer lattice paths consisting of up-steps (1, 1) and down-s...
In this paper configurations of n non-intersecting lattice paths which begin and end on the line y =...
Abstract We define a bijection between permutations and valued Dyck paths, namely, Dyck paths whos...
AbstractIt is well known (see [3, 6, 9, 10, 11]) that Dyck paths are in bijection with “Dyck words”,...
of steps (1; 1) and (1; 1), which never passes below the x-axis. A peak at height k on a Dyck path i...
AbstractA k-generalized Dyck path of length n is a lattice path from (0,0) to (n,0) in the plane int...
A bicoloured Dyck path is a Dyck path in which each up-step is assigned one of two colours, say, red...
AbstractWe introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, wh...
AbstractWe deal with non-decreasing paths on the non-negative quadrant of the integral square lattic...
The combinatorial q, t-Catalan numbers are weighted sums of Dyck paths introduced by J. Haglund and ...
AbstractIn this paper, we introduce a subclass of the Dyck paths (Delest and Viennot, 1984) called n...
We introduce a new poset structure on Dyck paths where the covering relation is a particular case of...
A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg in...
AbstractAn elementary technique is used for the enumeration of Dyck paths according to various param...
22 pages, 3 figures, 2 tablesWe introduce and study the new combinatorial class of Dyck paths with a...
In this note we examine the number of integer lattice paths consisting of up-steps (1, 1) and down-s...