On the diagram of 132-avoiding permutations
From MaRDI portal
Publication:1405003
DOI10.1016/S0195-6698(03)00065-9zbMath1031.05004arXivmath/0208006MaRDI QIDQ1405003
Publication date: 25 August 2003
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0208006
Related Items
Restricted Dumont permutations, Dyck paths, and noncrossing partitions, Bijections for refined restricted permutations, The Corners of Core Partitions, Unimodal permutations and almost-increasing cycles, Descents and des-Wilf equivalence of permutations avoiding certain nonclassical patterns, Two involutions on binary trees and generalizations, The area above the Dyck path of a permutation, A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations, A solution to one of Knuth's permutation problems, The operators \(F_i\) on permutations, 132-avoiding permutations and inversions, Edit distance between unlabeled ordered trees, Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials
Cites Work
- Counting occurrences of 132 in a permutation
- Flags, Schubert polynomials, degeneracy loci, and determinantal formulas
- Forbidden subsequences and Chebyshev polynomials
- Dyck path enumeration
- Some combinatorial properties of Schubert polynomials
- A bijection on Dyck paths and its consequences
- Permutations with one or two 132-subsequences
- Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three
- Combinatorics of Fulton's essential set
- Catalan continued fractions and increasing subsequences in permutations
- Restricted permutations and Chebyshev polynomials
- Generating trees and the Catalan and Schröder numbers
- Restricted permutations, continued fractions, and Chebyshev polynomials
- Restricted permutations
- Restricted 132-avoiding permutations
- Permutations with restricted patterns and Dyck paths
