Permutations, parenthesis words, and Schröder numbers

DOI10.1016/S0012-365X(98)00155-1zbMath0956.05011MaRDI QIDQ1584395

Grzegorz Rozenberg, Paulien ten Pas, Andrzej Ehrenfeucht, Tero J.Harju

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Catalan numberspatternnumber of permutationsSchröder numberparenthesis words

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (5)

Unnamed Item ⋮ Parametric Catalan numbers and Catalan triangles ⋮ On the log-convexity of combinatorial sequences ⋮ Embedding linear orders in grids ⋮ Taylor expansions for the generating function of Catalan-like numbers

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

This page was built for publication: Permutations, parenthesis words, and Schröder numbers