Generating trees and the Catalan and Schröder numbers (Q1903733)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 825355
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generating trees and the Catalan and Schröder numbers |
scientific article; zbMATH DE number 825355 |
Statements
Generating trees and the Catalan and Schröder numbers (English)
0 references
14 July 1996
0 references
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}\).
0 references
permutations
0 references
Catalan number
0 references
0 references
0.8473058342933655
0 references
0.8395968675613403
0 references
0.8249210715293884
0 references
