Permutations, parenthesis words, and Schröder numbers
From MaRDI portal
Publication:1584395
DOI10.1016/S0012-365X(98)00155-1zbMath0956.05011MaRDI QIDQ1584395
Andrzej Ehrenfeucht, Grzegorz Rozenberg, Paulien ten Pas, Tero J.Harju
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Cites Work
- Characterization and complexity of uniformly nonprimitive labeled 2-structures
- T-structures, T-functions, and texts
- A correspondence between ordered trees and noncrossing partitions
- Ordered trees and non-crossing partitions
- Chain enumeration and non-crossing partitions
- Enumerations of ordered trees
- Complement reducible graphs
- Generating trees and the Catalan and Schröder numbers
- On \(abab\)-free and \(abba\)-free set partitions
- Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
- Hipparchus, Plutarch, Schroder, and Hough