English
Related papers

Related papers: Refinements of Lattice paths with flaws

200 papers

It is a classical result in combinatorics that among lattice paths with 2m steps U=(1,1) and D=(1,-1) starting at the origin, the number of those that do not go below the x-axis equals the number of those that end on the x-axis. A much more…

Combinatorics · Mathematics 2014-06-09 Sergi Elizalde

We study a new class of palindromic descent polynomials. Given a Dyck path $d$ of semilength $n$ and a permutation $\sigma$ of size $n$, one can label the up-steps and down-steps of $d$ with the elements of $\sigma$. The labeled Dyck path…

Combinatorics · Mathematics 2026-03-25 Danai Deligeorgaki , Krishna Menon

We study a class of observables in four-dimensional superconformal Yang--Mills theories which, in the planar limit at finite 't Hooft coupling, can be expressed as determinants of semi-infinite matrices built from Bessel functions. This…

High Energy Physics - Theory · Physics 2025-08-29 G. P. Korchemsky

The number of Dyck paths of semilength $n$ is famously $C_n$, the $n$th Catalan number. This fact follows after noticing that every Dyck path can be uniquely parsed according to a context-free grammar. In a recent paper, Zeilberger showed…

Combinatorics · Mathematics 2020-09-22 AJ Bu , Robert Dougherty-Bliss

For $0\leq k\leq n-1$, we introduce a family of $k$-skeletal paths which are counted by the $n$-th Catalan number for each $k$, and specialize to Dyck paths when $k=n-1$. We similarly introduce $k$-skeletal parking functions which are…

A recurrence relation of the generating function of the dimer model of Fibonacci type gives a functional relation for formal power series associated to lattice paths such as a Dyck, Motzkin and Schr\"oder path. In this paper, we generalize…

Combinatorics · Mathematics 2023-01-02 Keiichi Shigechi

We study a class of rational Dyck paths with slope (2m+1)/2 corresponding to factor-free Dyck words, as introduced by P. Duchon. We show that, for the slopes considered in this paper, the language of factor-free Dyck words is generated by…

Combinatorics · Mathematics 2018-06-26 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

A variation of Dyck paths allows for down-steps of arbitrary length, not just one. Credits for this invention are given to Emeric Deutsch. Surprisingly, the enumeration of them is somewhat akin to the analysis of Motzkin-paths; the last…

Combinatorics · Mathematics 2020-04-16 Helmut Prodinger

A variation of Dyck paths allows for down-steps of arbitrary length, not just one. This is motivated by ideas published by Emeric Deutsch around the turn of the millenium. We are interested in the subclass of them where the sequence of the…

Combinatorics · Mathematics 2020-05-11 Helmut Prodinger

We count the number of lattice paths lying under a cyclically shifting piecewise linear boundary of varying slope. Our main result extends well known enumerative formulae concerning lattice paths, and its derivation involves a classical…

Combinatorics · Mathematics 2007-12-20 J. Irving , A. Rattan

We analyze some enumerative and asymptotic properties of Dyck paths under a line of slope 2/5.This answers to Knuth's problem \\#4 from his "Flajolet lecture" during the conference "Analysis of Algorithms" (AofA'2014) in Paris in June…

Discrete Mathematics · Computer Science 2016-06-29 Cyril Banderier , Michael Wallner

Let $a,b$ be fixed positive coprime integers. For a positive integer $g$, write $W_k(g)$ for the set of lattice paths from the startpoint $(0,0)$ to the endpoint $(ga,gb)$ with steps restricted to $\{(1,0), (0,1)\}$, having exactly $k$…

Combinatorics · Mathematics 2025-07-17 Federico Firoozi , Jonathan Jedwab , Amarpreet Rattan

We give several bijections among restricted Motzkin paths, explaining why various parameters on these paths are equidistributed. For example, the number of doublerise-free Motzkin paths of length n is the same as the number of peak-free…

Combinatorics · Mathematics 2007-05-23 David Callan

We introduce an equivalence relation on the set of Dyck paths and some operations on them. We determine a formula for the cardinality of those equivalence classes and use this information to obtain a combinatorial formula for the number of…

Combinatorics · Mathematics 2015-05-11 Stefano Capparelli , Alberto Del Fra

It is known that both the number of Dyck paths with $2n$ steps and $k$ peaks, and the number of Dyck paths with $2n$ steps and $k$ steps at odd height follow the Narayana distribution. In this paper we present a bijection which explicitly…

Combinatorics · Mathematics 2014-01-27 Paul R. G. Mortimer , Thomas Prellberg

We consider the system of equations $A_k(x)=p(x)A_{k-1}(x)(q(x)+\sum_{i=0}^k A_i(x))$ for $k\geq r+1$ where $A_i(x)$, $0\leq i \leq r$, are some given functions and show how to obtain a close form for $A(x)=\sum_{k\geq 0}A_k(x)$. We apply…

Combinatorics · Mathematics 2021-10-28 Jean-Luc Baril , Sergey Kirgizov

For $m,n$ coprime we introduce a new statistic skip on $(m,n)$-rational Dyck paths and give a fast way to compute dinv and skip statistics. We also introduce $(m,n)$-rank words, which are in one-to-one correspondence with $(m,n)$-Dyck…

Combinatorics · Mathematics 2016-11-16 Ryan Kaliszewski , Huilan Li

We study the relationship between rational slope Dyck paths and invariant subsets of $\mathbb Z,$ extending the work of the first two authors in the relatively prime case. We also find a bijection between $(dn,dm)$--Dyck paths and…

Combinatorics · Mathematics 2017-09-28 Eugene Gorsky , Mikhail Mazin , Monica Vazirani

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}$…

Combinatorics · Mathematics 2023-09-13 Bo Wang , Candice X. T. Zhang

We provide generating functions for the popularity and the distribution of patterns of length at most three over the set of Dyck paths having a first return decomposition constrained by height.

Combinatorics · Mathematics 2020-05-19 Jean-Luc Baril , Richard Genestier , Sergey Kirgizov