English
Related papers

Related papers: Generating functions for plateaus in Motzkin paths

200 papers

In this paper, I derive a generating function for discrete Motzkin paths of step size +2,+1,-1, restricted between two absorbing parallel lines, and generalized to arbitrary step weights. This continues off work of similar problems…

Combinatorics · Mathematics 2023-06-13 Cetin Hakimoglu-Brown

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…

Mathematical Physics · Physics 2022-02-04 Alexios P. Polychronakos

Motzkin paths consist of up-steps, down-steps, level-steps, and never go below the $x$-axis. They return to the $x$-axis at the end. The concept of skew Dyck path \cite{Deutsch-italy} is transferred to skew Motzkin paths, namely, a left…

Combinatorics · Mathematics 2022-04-08 Helmut Prodinger

We find a generating function for interval-closed sets of the product of two chains poset by constructing a bijection to certain bicolored Motzkin paths. We also find a functional equation for the generating function of interval-closed sets…

A {\em Motzkin 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 $(1, 0)$, up-steps $(1,1)$, and down-steps $(1,-1)$, which never passes…

Combinatorics · Mathematics 2008-05-29 Yidong Sun

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…

Combinatorics · Mathematics 2023-11-21 Helmut Prodinger

Using a recursive approach, we show that the generating function for sets of Motzkin paths avoiding a single (not necessarily consecutive) pattern is rational over $x$ and the Catalan generating function $C(x) =…

Combinatorics · Mathematics 2022-02-28 Christian Bean , Antonio Bernini , Matteo Cervetti , Luca Ferrari

The lattice path model suggested by E. Deutsch is derived from ordinary Dyck paths, but with additional down-steps of size -3,-5,-7,... . For such paths, we find the generating functions of them, according to length, ending at level $i$,…

Combinatorics · Mathematics 2020-04-10 Helmut Prodinger

In this paper, we first describe how to find the generating function for the sum of the areas under generalized Dyck paths (with an arbitrary set of steps) using Motzkin paths as a motivating example. We then focus on Motzkin and Dyck…

Combinatorics · Mathematics 2024-04-18 AJ Bu

We consider a generalised version of Motzkin paths, where horizontal steps have length $\ell$, with $\ell$ being a fixed positive integer. We first give the general functional equation for the area-length generating function of this model.…

Statistical Mechanics · Physics 2017-05-24 Nils Haug , Thomas Prellberg , Grzegorz Siudem

Motzkin paths are simple yet important combinatorial objects. In this paper, we consider families of Motzkin paths with restrictions on peak heights, valley heights, upward-run lengths, downward-run lengths, and flat-run lengths. This paper…

Combinatorics · Mathematics 2020-10-07 AJ Bu

We recall the main types of lattice paths, which are sequences in the lattice of integer coordinates points in the plane. We start with the fundamental central lattice paths and Dyck paths and proceed in elementary terms through recently…

Combinatorics · Mathematics 2024-01-17 Rui Duarte , António Guedes de Oliveira

There was recent interest in Motzkin paths without peaks (peak: up-step followed immediately by down-step); additional results about this interesting family is worked out. The new results are the enumeration of such paths that live in a…

Combinatorics · Mathematics 2023-08-08 Helmut Prodinger

Recently, several authors have considered lattice paths with various steps, including vertical steps permitted. In this paper, we consider a kind of generalized Motzkin paths, called {\it G-Motzkin paths} for short, that is lattice paths…

Combinatorics · Mathematics 2022-01-25 Yidong Sun , Di Zhao , Wenle Shi , Weichen Wang

Motzkin paths consist of up-steps, down-steps, horizontal steps, never go below the $x$-axis and return to the $x$-axis. Versions where the return to the $x$-axis isn't required are also considered. A path is peakless (valleyless) if $UD$…

Combinatorics · Mathematics 2025-01-24 Helmut Prodinger

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…

Combinatorics · Mathematics 2022-12-26 Jean-Luc Baril , Paul Barry

We provide formulas for generating functions of many types of paths in various rooted tree structures. We compute the $k$th moment of the generating functions for various types of vertical paths. In two specific familes of trees we find…

Combinatorics · Mathematics 2018-10-03 Keith Copenhaver

By using the matrix formulation of the two-step approach to the distributions of runs, a recursive relation and an explicit expression are derived for the generating function of the joint distribution of rises and falls for multivariate…

Combinatorics · Mathematics 2024-05-06 Yong Kong

This short note gives a bijection between quarter plane walks using the steps $\{\rightarrow, \searrow, \downarrow, \leftarrow, \nwarrow, \uparrow\}$ and bicoloured Motzkin paths.

Combinatorics · Mathematics 2014-12-05 Karen Yeats

We consider walks on a triangular domain that is a subset of the triangular lattice. We then specialise this by dividing the lattice into two directed sublattices with different weights. Our central result is an explicit formula for the…

Combinatorics · Mathematics 2014-11-25 Paul RG Mortimer , Thomas Prellberg
‹ Prev 1 2 3 10 Next ›