Generating trees and the Catalan and Schröder numbers
type: Item
instance of: scholarly article
title: Generating trees and the Catalan and Schröder numbers
zbMATH Open document ID: 0841.05002
DOI: 10.1016/0012-365X(94)00067-1
author: Julian West
published in: Discrete Mathematics
publication date: 1996-07-14T00:00:00Z
review text: Let \(S_n(\tau)\) be the set of all permutations \(\pi\in S_n\) which avoid the subpattern \(\tau\). The author gives a new bijective proof of the well-known result that \(|S_n(123)|= |S_n(132)|= c_n\), the \(n\)th Catalan number. He also proves a conjecture of Shapiro and Getu that \(|S_n(3142, 2413)|\) equals the Schröder number \(S_{n- 1}\).
reviewed by: J. Cigler
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 825355
zbMATH Keywords: permutations
zbMATH Keywords: Catalan number
MaRDI profile type: Publication
cites work: Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
cites work: The number of Baxter permutations
cites work: Symmetric functions and P-recursiveness
cites work: Deux propriétés combinatoires des nombres de Schröder
cites work: Q4057549
cites work: Schubert polynomials and the Littlewood-Richardson rule
cites work: Q3975127
cites work: Q3283895
cites work: Asymptotic values for degrees associated with strips of Young diagrams
cites work: Q3495358
cites work: Longest Increasing and Decreasing Subsequences
cites work: Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
cites work: Restricted permutations
cites work: Q4774085
cites work: Classification of forbidden subsequences of length 4
cites work: Forbidden subsequences
description: scientific article; zbMATH DE number 825355