Bijective proofs of recurrences involving two Schröder triangles
From MaRDI portal
Publication:1987071
DOI10.1016/j.ejc.2019.103077zbMath1437.05008OpenAlexW2997132820WikidataQ113875507 ScholiaQ113875507MaRDI QIDQ1987071
Publication date: 9 April 2020
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2019.103077
Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)
Related Items (4)
A combinatorial bijection on di-sk trees ⋮ Some \(\gamma \)-positive polynomials arising from enumerations of the pseudo Schröder paths ⋮ The \(m\)-Schröder paths and \(m\)-Schröder numbers ⋮ Refined Wilf-equivalences by Comtet statistics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Patterns in permutations and words.
- Identities induced by Riordan arrays
- On two unimodal descent polynomials
- Sequence characterization of Riordan arrays
- The Riordan group
- Pascal triangles, Catalan numbers and renewal arrays
- Bijective recurrences concerning Schröder paths
- Riordan arrays and combinatorial sums
- A classic proof of a recurrence for a very classical sequence
- Production matrices
- Bijections and the Riordan group
- Generating trees and the Catalan and Schröder numbers
- Total positivity of Riordan arrays
- Notes on the total positivity of Riordan arrays
- Classification of bijections between 321- and 132-avoiding permutations
- Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
- On Some Alternative Characterizations of Riordan Arrays
- Log-concavity and strong q-log-convexity for Riordan arrays and recursive matrices
- ECO method and hill-free generalized Motzkin paths
This page was built for publication: Bijective proofs of recurrences involving two Schröder triangles
