Add to ORKGInternational audienceWe present enumerative results on prefixes of skew Dyck paths by giving recursive relations, Riordan arrays, and generating functions, as well as closed formulas to count the total number of these paths with respect to the length, the height of its endpoint and the number of left steps
AbstractIn this paper we study the number of humps (peaks) in Dyck, Motzkin and Schröder paths. Rece...
AbstractThe statistics concerning the number of appearances of a string τ in Dyck paths as well as i...
In this paper we study the class S of skew Dyck paths, i.e. of those lattice paths that are in the f...
International audienceWe present enumerative results on prefixes of skew Dyck paths by giving recurs...
AbstractThis paper deals with the enumeration of Dyck paths according to the statistic “number of oc...
International audienceLukasiewicz paths are lattice paths in N 2 starting at the origin, ending on t...
International audienceLukasiewicz paths are lattice paths in N 2 starting at the origin, ending on t...
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...
ABSTRACT: In the present paper we consider the statistic \number of udu's " in Dyck paths....
of steps (1; 1) and (1; 1), which never passes below the x-axis. A peak at height k on a Dyck path i...
A bicoloured Dyck path is a Dyck path in which each up-step is assigned one of two colours, say, red...
We construct a formal power series on several variables that encodes many statis-tics on non-decreas...
AbstractAn elementary technique is used for the enumeration of Dyck paths according to various param...
AbstractRiordan paths are Motzkin paths without horizontal steps on the x-axis. We establish a corre...
AbstractIn this paper we study the number of humps (peaks) in Dyck, Motzkin and Schröder paths. Rece...
AbstractThe statistics concerning the number of appearances of a string τ in Dyck paths as well as i...
In this paper we study the class S of skew Dyck paths, i.e. of those lattice paths that are in the f...
International audienceWe present enumerative results on prefixes of skew Dyck paths by giving recurs...
AbstractThis paper deals with the enumeration of Dyck paths according to the statistic “number of oc...
International audienceLukasiewicz paths are lattice paths in N 2 starting at the origin, ending on t...
International audienceLukasiewicz paths are lattice paths in N 2 starting at the origin, ending on t...
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...
ABSTRACT: In the present paper we consider the statistic \number of udu's " in Dyck paths....
of steps (1; 1) and (1; 1), which never passes below the x-axis. A peak at height k on a Dyck path i...
A bicoloured Dyck path is a Dyck path in which each up-step is assigned one of two colours, say, red...
We construct a formal power series on several variables that encodes many statis-tics on non-decreas...
AbstractAn elementary technique is used for the enumeration of Dyck paths according to various param...
AbstractRiordan paths are Motzkin paths without horizontal steps on the x-axis. We establish a corre...
AbstractIn this paper we study the number of humps (peaks) in Dyck, Motzkin and Schröder paths. Rece...
AbstractThe statistics concerning the number of appearances of a string τ in Dyck paths as well as i...
In this paper we study the class S of skew Dyck paths, i.e. of those lattice paths that are in the f...