中文
相关论文

相关论文: Discrete excursions

200 篇论文

Starting from AJ Bu's recent article that computed explicit expressions for the GENERATING functions of sums of powers of areas under Dyck and Motzkin paths, we deduce from them explicit expressions for the actual sequences. This enables…

组合数学 · 数学 2024-05-07 AJ Bu , Shalosh B. Ekhad , Doron Zeilberger

We interpret walks in the first quadrant with steps {(1,1),(1,0),(-1,0), (-1,-1)} as a generalization of Dyck words with two sets of letters. Using this language, we give a formal expression for the number of walks in the steps above…

组合数学 · 数学 2011-04-20 Arvind Ayyer

In the past fifteen years, the enumeration of lattice walks with steps takenin a prescribed set S and confined to a given cone, especially the firstquadrant of the plane, has been intensely studied. As a result, the generating functions…

组合数学 · 数学 2018-06-05 Alin Bostan , Mireille Bousquet-Mélou , Stephen Melczer

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…

组合数学 · 数学 2024-04-18 AJ Bu

The diagonal of a multivariate power series F is the univariate power series Diag(F) generated by the diagonal terms of F. Diagonals form an important class of power series; they occur frequently in number theory, theoretical physics and…

符号计算 · 计算机科学 2015-10-15 Alin Bostan , Louis Dumont , Bruno Salvy

We study planar walks that start from a given point (i\_0, j\_0), take their steps in a finite set S, and are confined in the first quadrant of the plane. Their enumeration can be attacked in a systematic way: the generating function Q(x,…

组合数学 · 数学 2017-08-22 Mireille Bousquet-Melou

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…

组合数学 · 数学 2008-05-12 Toufik Mansour , Yidong Sun

The number of down-steps between pairs of up-steps in $k_t$-Dyck paths, a generalization of Dyck paths consisting of steps $\{(1, k), (1, -1)\}$ such that the path stays (weakly) above the line $y=-t$, is studied. Results are proved…

组合数学 · 数学 2023-06-22 Andrei Asinowski , Benjamin Hackl , Sarah J. Selkirk

The notion of symmetric and asymmetric peaks in Dyck paths was introduced by Fl\'orez and Rodr\'{\i}guez, who counted the total number of such peaks over all Dyck paths of a given length. In this paper we generalize their results by giving…

组合数学 · 数学 2020-08-14 Sergi Elizalde

Recently, in the context of walks of hexagonal circle packings, interest has emerged in the family of skew Dyck paths with two variants of down-steps. These paths have steps $U, D_g, D_b, L=D_r$. Using generating functions, the kernel…

组合数学 · 数学 2026-01-19 Helmut Prodinger

The diagonal of a multivariate power series F is the univariate power series Diag(F) generated by the diagonal terms of F. Diagonals form an important class of power series; they occur frequently in number theory, theoretical physics and…

符号计算 · 计算机科学 2015-10-16 Alin Bostan , Louis Dumont , Bruno Salvy

In this paper we study a subfamily of a classic lattice path, the \emph{Dyck paths}, called \emph{restricted $d$-Dyck} paths, in short $d$-Dyck. A valley of a Dyck path $P$ is a local minimum of $P$; if the difference between the heights of…

A dispersed Dyck path (DDP) of length n is a lattice path on $N\times N$ from (0,0) to (n,0) in which the following steps are allowed: "up" (x, y) $\to$ (x+1, y+1); "down" (x, y) $\to$ (x+1, y-1); and "right" (x,0) $\to$ (x+1,0). An ascent…

组合数学 · 数学 2016-03-07 Kairi Kangro , Mozhgan Pourmoradnasseri , Dirk Oliver Theis

For a simple connected graph $G$, the $Q$-generating function of the numbers $N_k$ of semi-edge walks of length $k$ in $G$ is defined by $W_Q(t)=\sum\nolimits_{k = 0}^\infty {N_k t^k }$. This paper reveals that the $Q$-generating function…

组合数学 · 数学 2014-03-13 Shu-Yu Cui , Gui-Xian Tian

In this paper, we introduce a new generating function called $d$-polynomial for the dimensions of $\tau$-tilting modules over a given finite dimensional algebra. Firstly, we study basic properties of $d$-polynomials and show that it can be…

表示论 · 数学 2025-03-10 Toshitaka Aoki , Yuya Mizuno

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…

数学物理 · 物理学 2022-02-04 Alexios P. Polychronakos

For a positive integer n and a subset S of [n-1], the descent polytope DP_S is the set of points x_1, ..., x_n in the n-dimensional unit cube [0,1]^n such that x_i >= x_{i+1} for i in S and x_i <= x_{i+1} otherwise. First, we express the…

组合数学 · 数学 2012-10-04 Denis Chebikin , Richard Ehrenborg

In the study of a tantalizing symmetry on Catalan objects, B\'ona et al. introduced a family of polynomials $\{W_{n,k}(x)\}_{n\geq k\geq 0}$ defined by \begin{align*} W_{n,k}(x)=\sum_{m=0}^{k}w_{n,k,m}x^{m}, \end{align*} where $w_{n,k,m}$…

组合数学 · 数学 2023-09-13 Bo Wang , Candice X. T. Zhang

In the first part of this paper, we enumerate exactly walks on the square lattice that start from the origin, but otherwise avoid the non positive horizontal half-axis. We call them "walks on the slit plane". We count them by their length,…

组合数学 · 数学 2025-09-26 Mireille Bousquet-Melou , Gilles Schaeffer

Gessel's walks are the planar walks that move within the positive quadrant $\mathbb{Z}_{+}^{2}$ by unit steps in any of the following directions: West, North-East, East and South-West. In this paper, we find an explicit expression for the…

组合数学 · 数学 2011-10-04 Irina Kurkova , Kilian Raschel