Related papers: Generating functions for plateaus in Motzkin paths
A recursive method is given for finding generating functions which enumerate rooted hypermaps by number of vertices, edges and faces for any given number of darts. It makes use of matrix-integral expressions arising from the study of…
After collecting data from observations or experiments, the next step is to build an appropriate mathematical or stochastic model to describe the data so that further studies can be done with the help of the models. In this article, the…
We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.
In this work, we present a method to generate probability distributions and classes of probability distributions, which broadens a process of probability distribution construction. In this method, distribution classes are built from…
\L{}ukasiewicz paths are lattice paths in $\Bbb{N}^2$ starting at the origin, ending on the $x$-axis, and consisting of steps in the set $\{(1,k), k\geq -1\}$. We give generating function and exact value for the number of $n$-length…
Two methods of constructing 2D Toda $\tau$-functions that are generating functions for certain geometrical invariants of a combinatorial nature are related. The first involves generation of paths in the Cayley graph of the symmetric group…
Let $Y$ be a topological Markov chain with finite leading and follower sets. Special flow over $Y$ whose height function depends on the time zero of elements of $Y$ is constructed. Then a formula for computing the entropy of this flow will…
We consider planar lattice walks that start from a prescribed position, take their steps in a given finite subset of Z^2, and always stay in the quadrant x >= 0, y >= 0. We first give a criterion which guarantees that the length generating…
We find the exponential generating function for permutations with all valleys even and all peaks odd, and use it to determine the asymptotics for its coefficients, answering a question posed by Liviu Nicolaescu. The generating function can…
We derive formulae for the number of set-valued standard tableaux of two-rowed shapes, keeping track of the total number of entries, the number of entries in the first row, and the number of entries in the second row. Key in the proofs is a…
In the present paper we construct plans orthogonal through the block factor (POTBs). We describe procedures for adding blocks as well as factors to an initial plan and thus generate a bigger plan. Using these procedures we construct POTBs…
Generating functions for plane overpartitions are obtained using various methods such as nonintersecting paths, RSK type algorithms and symmetric functions. We extend some of the generating functions to cylindric partitions. Also, we show…
In this paper, we consider situations in which a given logical function is realized by a multithreshold threshold function. In such situations, constant functions can be easily obtained from multithreshold threshold functions, and…
Stochastic dynamics is generated by a matrix of transition probabilities. Certain eigenvectors of this matrix provide observables, and when these are plotted in the appropriate multi-dimensional space the phases (in the sense of phase…
We use a Hamiltonian (transition matrix) description of height-restricted Dyck paths on the plane in which generating functions for the paths arise as matrix elements of the propagator to evaluate the length and area generating function for…
In two recent works \cite{BMM,BK}, it has been shown that the counting generating functions (CGF) for the 23 walks with small steps confined in a quadrant and associated with a finite group of birational transformations are holonomic, and…
In this paper, we study the explicit expressions of multiple t-star values with an arbitrary number of blocks of twos of general level. We give an expression of a generating function of such values, which generalizes the results for…
Two kinds of configurations involving steps on surfaces are reviewed. The first one results from an initially planar vicinal surface, i.e. slightly deviating from a high-symmetry (001) or (111) orientation. In some cases, these surfaces…
A method is proposed for constructing a spline curve of the Bezier type, which is continuous along with its first derivative by a piecewise polynomial function. Conditions for its existence and uniqueness are given. The constructed curve…
Random walks are a series of up, down, and level steps that enumerate distinct paths from $(0,0)$ to $(2n,0)$, where $n$ is the semi-length of the path. We used these paths to analyze Catalan, Schr\"{o}der, and Motzkin number sequences…