Pages that link to "Item:Q1398262"
From MaRDI portal
The following pages link to Finite transition matrices for permutations avoiding pairs of length four patterns (Q1398262):
Displaying 18 items.
- Partial permutations avoiding pairs of patterns (Q393932) (← links)
- Counting \(\mathbf {(3+1)}\)-avoiding permutations (Q649006) (← links)
- Finding regular insertion encodings for permutation classes (Q765858) (← links)
- Generating permutations with restricted containers (Q1747767) (← links)
- Pattern avoidance of \([4,k]\)-pairs in circular permutations (Q2134002) (← links)
- Subregularity in infinitely labeled generating trees of restricted permutations (Q2155932) (← links)
- On partially ordered patterns of length 4 and 5 in permutations (Q2318773) (← links)
- Permutation patterns and cell decompositions (Q2319453) (← links)
- Nine classes of permutations enumerated by binomial transform of Fine's sequence (Q2357779) (← links)
- The enumeration of permutations avoiding 3124 and 4312 (Q2363494) (← links)
- Finitely labeled generating trees and restricted permutations (Q2457348) (← links)
- Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations (Q2657073) (← links)
- (Q5121940) (← links)
- On the centrosymmetric permutations in a class (Q5197609) (← links)
- Enumeration Schemes for Restricted Permutations (Q5448994) (← links)
- Some Transformation Schemes Involving the Special (132)-Avoiding Permutation Patterns and a Binary Coding: An Algorithmic Approach (Q5894242) (← links)
- Some Transformation Schemes Involving the Special (132)-Avoiding Permutation Patterns and a Binary Coding: An Algorithmic Approach (Q5894410) (← links)
- Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024 (Q6613409) (← links)