Finite transition matrices for permutations avoiding pairs of length four patterns

DOI10.1016/S0012-365X(03)00042-6zbMath1024.05001OpenAlexW2024633196MaRDI QIDQ1398262

D. Massart

Publication date: 29 July 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00042-6

zbMATH Keywords

pattern-avoiding permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (13)

The enumeration of permutations avoiding 3124 and 4312 ⋮ Subregularity in infinitely labeled generating trees of restricted permutations ⋮ Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations ⋮ Partial permutations avoiding pairs of patterns ⋮ Counting \(\mathbf {(3+1)}\)-avoiding permutations ⋮ Finitely labeled generating trees and restricted permutations ⋮ Generating permutations with restricted containers ⋮ Enumeration Schemes for Restricted Permutations ⋮ Unnamed Item ⋮ Finding regular insertion encodings for permutation classes ⋮ On partially ordered patterns of length 4 and 5 in permutations ⋮ Permutation patterns and cell decompositions ⋮ On the centrosymmetric permutations in a class

Uses Software

• WILF
• HERB

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

This page was built for publication: Finite transition matrices for permutations avoiding pairs of length four patterns