Finite transition matrices for permutations avoiding pairs of length four patterns

This article shows that four classes of pattern-avoiding permutations are enumerated by a closed formula. The technique of proofs uses finite transition matrices associated with permutations avoiding pairs of length four patterns.

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

Asymptotic values for degrees associated with strips of Young diagrams
Enumeration schemes and, more importantly, their automatic generation
Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
Forbidden subsequences
Generating trees and forbidden subsequences
Generating trees and the Catalan and Schröder numbers
On representations of the braid group
Permutations avoiding certain patterns: The case of length 4 and some generalizations
Permutations which are the union of an increasing and a decreasing subsequence
Permutations with forbidden subsequences and a generalized Schröder number
Restricted permutations
The permutation classes equinumerous to the smooth class
The permutations 123p₄ p_m and 321p₄ p_m are Wilf-equivalent
Wilf-equivalence for singleton classes

Cited in

(19)

Generating permutations with restricted containers
Pattern avoidance of \([4,k]\)-pairs in circular permutations
Subregularity in infinitely labeled generating trees of restricted permutations
On partially ordered patterns of length 4 and 5 in permutations
Permutation patterns and cell decompositions
Nine classes of permutations enumerated by binomial transform of Fine's sequence
The enumeration of permutations avoiding 3124 and 4312
Finitely labeled generating trees and restricted permutations
Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations
Partial permutations avoiding pairs of patterns
Enumeration and Wilf-classification of permutations avoiding four patterns of length 4
On the centrosymmetric permutations in a class
Enumeration Schemes for Restricted Permutations
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
Counting \(\mathbf {(3+1)}\)-avoiding permutations
Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024
Combinatorial exploration: an algorithmic framework for enumeration
Finding regular insertion encodings for permutation classes

Describes a project that uses

Uses Software

WILF
HERB

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)