Permutation pattern avoidance and the Catalan triangle
From MaRDI portal
Publication:350823
zbMath1268.05003MaRDI QIDQ350823
Rebecca Meissen, Rebecca Field, Jacob Ziefle, Derek Desantis, Wesley K. Hough, Brant C. Jones
Publication date: 3 July 2013
Published in: Missouri Journal of Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.mjms/1369746397
Catalan numbers; recursive formulas; enumerative combinatorics; Catalan sequence; Catalan triangle; essentially different triangles; fixed pattern; permutation pattern avoidance; Wilf equivalence
Related Items
Catalan and Schröder permutations sortable by two restricted stacks, The operators \(F_i\) on permutations, 132-avoiding permutations and inversions
Uses Software
Cites Work
- Unnamed Item
- Governing singularities of Schubert varieties
- Generalized permutation patterns and a classification of the Mahonian statistics
- Singular loci of Schubert varieties
- The representation theory of the Temperley-Lieb algebras
- Generating trees and the Catalan and Schröder numbers
- Smoothness of Schubert varieties via patterns in root subsystems
- Enumeration Schemes for Restricted 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
- Sorting Using Networks of Queues and Stacks
- Restricted permutations
- Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations
