Permutation pattern avoidance and the Catalan triangle
From MaRDI portal
Recommendations
Cites work
- Enumeration Schemes for Restricted Permutations
- Generalized permutation patterns and a classification of the Mahonian statistics
- Generating trees and the Catalan and Schröder numbers
- Governing singularities of Schubert varieties
- Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations
- Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
- Restricted permutations
- Singular loci of Schubert varieties
- Smoothness of Schubert varieties via patterns in root subsystems
- Sorting Using Networks of Queues and Stacks
- The art of computer programming. Vol. 4, Fasc. 0--4. Fasc. 0: Introduction to combinatorial algorithms and Boolean functions. Fasc. 1: Bitwise tricks \& techniques, binary decision diagrams. Fasc. 2: Generating all tuples and permutations. Fasc. 3: Genera
- The representation theory of the Temperley-Lieb algebras
Cited in
(7)- Catalan and Schröder permutations sortable by two restricted stacks
- The operators F_i on permutations, 132-avoiding permutations and inversions
- Some factorisations counted by Catalan numbers
- Harmonic numbers, Catalan's triangle and mesh patterns
- Surprising symmetries in objects counted by Catalan numbers
- Some statistics on the hypercubes of Catalan permutations
- Restricted permutations
This page was built for publication: Permutation pattern avoidance and the Catalan triangle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q350823)