Finite transition matrices for permutations avoiding pairs of length four patterns
From MaRDI portal
Publication:1398262
DOI10.1016/S0012-365X(03)00042-6zbMATH Open1024.05001OpenAlexW2024633196MaRDI QIDQ1398262FDOQ1398262
Authors: 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
Recommendations
- Permutations avoiding certain patterns: The case of length 4 and some generalizations
- Enumeration and Wilf-classification of permutations avoiding four patterns of length 4
- Pattern avoidance of \([4,k]\)-pairs in circular permutations
- Pattern-avoiding \(( 0 , 1 )\)-matrices and bases of permutation matrices
- Enumerating pattern avoidance for affine permutations
- On consecutive pattern-avoiding permutations of length 4, 5 and beyond
- Pattern avoidance in alternating permutations and tableaux (extended abstract)
- Pattern avoidance in partial permutations (extended abstract)
- On bijections for pattern-avoiding permutations
- Enumeration and Wilf-classification of permutations avoiding five patterns of length 4
Cites Work
- Enumeration schemes and, more importantly, their automatic generation
- Restricted permutations
- 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
- Forbidden subsequences
- Generating trees and forbidden subsequences
- Permutations with forbidden subsequences and a generalized Schröder number
- Wilf-equivalence for singleton classes
- 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
- The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent
- On representations of the braid group
Cited In (18)
- Partial permutations avoiding pairs of patterns
- Counting \(\mathbf {(3+1)}\)-avoiding permutations
- Nine classes of permutations enumerated by binomial transform of Fine's sequence
- Generating permutations with restricted containers
- The enumeration of permutations avoiding 3124 and 4312
- Enumeration and Wilf-classification of permutations avoiding four patterns of length 4
- Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations
- Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024
- Subregularity in infinitely labeled generating trees of restricted permutations
- On the centrosymmetric permutations in a class
- Permutation patterns and cell decompositions
- On partially ordered patterns of length 4 and 5 in permutations
- Finding regular insertion encodings for permutation classes
- Some transformation schemes involving the special (132)-avoiding permutation patterns and a binary coding: an algorithmic approach
- Some transformation schemes involving the special (132)-avoiding permutation patterns and a binary coding: an algorithmic approach
- Finitely labeled generating trees and restricted permutations
- Enumeration Schemes for Restricted Permutations
- Pattern avoidance of \([4,k]\)-pairs in circular permutations
Uses Software
This page was built for publication: Finite transition matrices for permutations avoiding pairs of length four patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1398262)
