English
Related papers

Related papers: Generalized Schr\"oder paths arising from a combin…

200 papers

A Schr\"oder path is a lattice path from $(0,0)$ to $(2n,0)$ with steps $(1,1)$, $(1,-1)$ and $(2,0)$ that never goes below the $x-$axis. A small Schr\"{o}der path is a Schr\"{o}der path with no $(2,0)$ steps on the $x-$axis. In this paper,…

Combinatorics · Mathematics 2020-09-14 Xiaomei Chen , Yuan Xiang

Kasraoui, Stanton and Zeng, and Kim, Stanton and Zeng introduced certain $q$-analogues of Laguerre and Charlier polynomials. The moments of these orthogonal polynomials have combinatorial models in terms of crossings in permutations and set…

Combinatorics · Mathematics 2017-09-13 Matthieu Josuat-Vergès , Martin Rubey

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

In this thesis we develop generalized versions of the Chung-Feller theorem for lattice paths constrained in the half plane. The beautiful cycle method which was developed by Devoretzky and Motzkin as a means to prove the ballot problem is…

Combinatorics · Mathematics 2009-07-21 Aminul Huq

We study the higher-order Euler polynomials and give the corresponding monic orthogonal polynomials, which are Meixner-Pollaczek polynomials with certain arguments and constant factors. Moreover, through a general connection between moments…

Combinatorics · Mathematics 2018-08-14 Lin Jiu , Diane Yahui Shi

In this paper, we establish a connection between Rogers-Ramanujan-Gordon type overpartitions to lattice paths with four kinds of unitary steps. By establishing the bijective relationship between overpartitions and lattice paths, we…

Combinatorics · Mathematics 2025-01-29 Diane Y. H. Shi

Path pairs are a modification of parallelogram polyominoes that provide yet another combinatorial interpretation of the Catalan numbers. More generally, the number of path pairs of length $n$ and distance $\delta$ corresponds to the…

Combinatorics · Mathematics 2020-07-09 Paul Drube

Inhomogeneous lattice paths are introduced as ordered sequences of rectangular Young tableaux thereby generalizing recent work on the Kostka polynomials by Nakayashiki and Yamada and by Lascoux, Leclerc and Thibon. Motivated by these works…

Quantum Algebra · Mathematics 2009-10-31 Anne Schilling , S. Ole Warnaar

We generalize the shuffle theorem and its $(km,kn)$ version, as conjectured by Haglund et al. and Bergeron et al., and proven by Carlsson and Mellit, and Mellit, respectively. In our version the $(km,kn)$ Dyck paths on the combinatorial…

Combinatorics · Mathematics 2021-09-07 Jonah Blasiak , Mark Haiman , Jennifer Morse , Anna Pun , George H. Seelinger

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

Consider lattice paths in Z^2 taking unit steps north (N) and east (E). Fix positive integers r,s and put an equivalence relation on points of Z^2 by letting v,w be equivalent if v - w = m (r,s) for some m in Z. Call a lattice path valid if…

Combinatorics · Mathematics 2007-05-23 Nicholas A. Loehr , Bruce E. Sagan , Gregory S. Warrington

The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with flaws $m$ is the $n$-th Catalan number and independent on $m$. L. Shapiro [7] found the Chung-Feller properties for the Motzkin paths. In this…

Combinatorics · Mathematics 2008-12-17 Jun Ma , Yeong-Nan Yeh

Consideration of a question of E. R. Berlekamp led Carlitz, Roselle, and Scoville to give a combinatorial interpretation of the entries of certain matrices of determinant~1 in terms of lattice paths. Here we generalize this result by…

Combinatorics · Mathematics 2014-04-21 Christine Bessenrodt , Richard P. Stanley

We enumerate lattice paths in the planar integer lattice consisting of positively directed unit vertical and horizontal steps with respect to a specific elliptic weight function. The elliptic generating function of paths from a given…

Combinatorics · Mathematics 2019-02-22 Michael Schlosser

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…

Combinatorics · Mathematics 2009-05-26 Luca Ferrari , Emanuele Munarini

We relate the combinatorics of periodic generalized Dyck and Motzkin paths to the cluster coefficients of particles obeying generalized exclusion statistics, and obtain explicit expressions for the counting of paths with a fixed number of…

Mathematical Physics · Physics 2022-10-17 Li Gan , Stéphane Ouvry , Alexios P. Polychronakos

We prove the Schr\"oder case, i.e. the case $\langle \cdot,e_{n-d}h_d \rangle$, of the conjecture of Haglund, Remmel and Wilson (Haglund et al. 2018) for $\Delta_{h_m}\Delta_{e_{n-k-1}}'e_n$ in terms of decorated partially labelled Dyck…

Combinatorics · Mathematics 2022-06-06 Michele D'Adderio , Alessandro Iraci , Anna Vanden Wyngaerd

In this paper we enumerate the number of $(k, r)$-Fuss-Schr\"{o}der paths of type $\lambda$. Y. Park and S. Kim studied small Schr\"{o}der paths with type $\lambda$. Generalizing the results to small $(k, r)$-Fuss-Schr\"{o}der paths with…

Combinatorics · Mathematics 2017-01-03 Suhyung An , JiYoon Jung , Sangwook Kim

Motzkin paths of order-$\ell$ are a generalization of Motzkin paths that use steps $U=(1,1)$, $L=(1,0)$, and $D_i=(1,-i)$ for every positive integer $i \leq \ell$. We further generalize order-$\ell$ Motzkin paths by allowing for various…

Combinatorics · Mathematics 2021-01-01 Isaac DeJager , Madeleine Naquin , Frank Seidl , Paul Drube

Let M(n,k,r,s) be the number of ordered paths in the plane, with unit steps E or N, that intersect k times in which the first path ends at the point (r,n-r) and the second path ends at the point (s,n-s). Our main object of study in this…

Combinatorics · Mathematics 2013-02-01 Ira M. Gessel , Walter Shur
‹ Prev 1 2 3 10 Next ›