A bijective proof of the equation linking the Schröder numbers, large and small
From MaRDI portal
Publication:5951939
DOI10.1016/S0012-365X(01)00122-4zbMath0992.05010WikidataQ114122966 ScholiaQ114122966MaRDI QIDQ5951939
Publication date: 11 September 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Permutation of elements in double semigroups ⋮ Cumulants in noncommutative probability theory. IV: Noncrossing cumulants: de Finetti's theorem and \(L^{p}\)-inequalities ⋮ Degenerate flag varieties: moment graphs and Schröder numbers ⋮ The \(\mathfrak{uvu}\)-avoiding \((a, b, c)\)-generalized Motzkin paths with vertical steps: bijections and statistic enumerations ⋮ A Combinatorial Bijection between Ordered Trees and Lattice Paths ⋮ Some \(\gamma \)-positive polynomials arising from enumerations of the pseudo Schröder paths ⋮ Noncrossing linked partitions and large \((3,2)\)-Motzkin paths ⋮ The \(m\)-Schröder paths and \(m\)-Schröder numbers ⋮ Generalized Schröder matrices arising from enumeration of lattice paths ⋮ Generalized Schröder matrix and its combinatorial interpretation ⋮ 2-binary trees: bijections and related issues ⋮ Riordan arrays, Łukasiewicz paths and Narayana polynomials
