Finite transition matrices for permutations avoiding pairs of length four patterns
From MaRDI portal
Publication:1398262
DOI10.1016/S0012-365X(03)00042-6zbMath1024.05001MaRDI QIDQ1398262
Publication date: 29 July 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
05A05: Permutations, words, matrices
Uses Software
Cites Work
- Enumeration schemes and, more importantly, their automatic generation
- Forbidden subsequences
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Permutations avoiding certain patterns: The case of length 4 and some generalizations
- Permutations which are the union of an increasing and a decreasing subsequence
- The permutation classes equinumerous to the smooth class
- Asymptotic values for degrees associated with strips of Young diagrams
- Generating trees and the Catalan and Schröder numbers
- Generating trees and forbidden subsequences
- Permutations with forbidden subsequences and a generalized Schröder number
- On representations of the braid group
- Wilf-equivalence for singleton classes
- Restricted permutations
- The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent