Related papers: Combinatorics of generalized Dyck and Motzkin path…
We calculate the total number of humps in Dyck and in Motzkin paths, and we give Standard-Young-Tableaux-interpretations of the numbers involved. One then observes the intriguing phenomena that the humps-calculations change the partitions…
We derive the length and area generating function of planar height-restricted forward-moving discrete paths of increments +1, 0, or -1 with arbitrary starting and ending points, the so-called Motzkin meanders, and the more general…
This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. At each step, a nondeterministic walk draws a random set of steps from a predefined set of sets and explores all possible extensions in parallel.…
Motzkin paths with air pockets (MAP) are defined as a generalization of Dyck paths with air pockets by adding some horizontal steps with certain conditions. In this paper, we introduce two generalizations. The first one consists of lattice…
Dyck paths where peaks are only allowed on level 1 and on even-indexed levels, were introduced by Retakh and analysed by Zeilberger, with assistance from Ekhad. We add some combinatorial comments to the enumeration, which involves Motzkin…
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, we establish bijections between sets of such paths and other combinatorial structures, such as non-crossing trees, dissections of a convex polygon,…
Motzkin excursions and meanders are revisited. This is considered in the context of forbidden patterns. Previous work by Asinowski, Banderier, Gittenberger, and Roitner is continued. Motzkin paths of bounded height are considered, leading…
Orthogonal polynomials on the unit circle (OPUC for short) are a family of polynomials whose orthogonality is given by integration over the unit circle in the complex plane. There are combinatorial studies on the moments of various types of…
We give some interpretations to certain integer sequences in terms of parameters on Grand-Dyck paths and coloured noncrossing partitions, and we find some new bijections relating Grand-Dyck paths and signed pattern avoiding permutations.…
The Goulden-Jackson cluster method is a powerful tool for obtaining generating functions for counting words in a free monoid by occurrences of a set of subwords. We introduce a generalization of the cluster method for monoid networks, which…
This paper concentrates on the set $\mathcal{V}_n$ of weighted Dyck paths of length $2n$ with special restrictions on the level of valleys. We first give its explicit formula of the counting generating function in terms of certain weight…
In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some…
We classify all solutions (p,q) to the equation p(u)q(u)=p(u+b)q(u+a) where p and q are complex polynomials in one indeterminate u, and a and b are fixed but arbitrary complex numbers. This equation is a special case of a system of…
The propagator and corresponding path integral for a system of identical particles obeying parastatistics are derived. It is found that the statistical weights of topological sectors of the path integral for parafermions and parabosons are…
In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the…
A {\em k-generalized Dyck path} of length $n$ is a lattice path from $(0,0)$ to $(n,0)$ in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of horizontal-steps $(k, 0)$ for a given integer $k\geq 0$, up-steps $(1,1)$, and…
In queuing theory, it is usual to have some models with a "reset" of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero. These objects have the interesting feature that they do not…
We show that the distribution of the number of peaks at height $i$ modulo $k$ in $k$-Dyck paths of a given length is independent of $i\in[0,k-1]$ and is the reversal of the distribution of the total number of peaks. Moreover, these…
We initiate the study of the enumerative combinatorics of the intervals in the Dyck pattern poset. More specifically, we find some closed formulas to express the size of some specific intervals, as well as the number of their covering…
We study some distributive lattices arising in the combinatorics of lattice paths. In particular, for the Dyck, Motzkin and Schroder lattices we describe the spectrum and we determine explicitly the Euler characteristic in terms of natural…