InsEnc
From MaRDI portal
Cited in
(25)- Growth rates of permutation classes: categorization up to the uncountability threshold
- Exhaustive generation for permutations avoiding (colored) regular sets of patterns
- Permutation patterns and cell decompositions
- WILF
- HERB
- Enumeration schemes for permutations avoiding barred patterns
- Maximally clustered elements and Schubert varieties.
- Embedded factor patterns for Deodhar elements in Kazhdan-Lusztig theory.
- Finitely labeled generating trees and restricted permutations
- PermLab
- Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
- Refining enumeration schemes to count according to the inversion number
- Wilf classification of subsets of four letter patterns
- Enumeration schemes for words avoiding permutations
- Small permutation classes
- Enumeration of some classes of words avoiding two generalized patterns of length three
- scientific article; zbMATH DE number 5557896 (Why is no real title available?)
- PermStruct
- PermPAL
- Repetition in reduced decompositions
- Automatic discovery of structural rules of permutation classes
- Enumeration and Wilf-classification of permutations avoiding four patterns of length 4
- On the centrosymmetric permutations in a class
- On the effective and automatic enumeration of polynomial permutation classes
- Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents
This page was built for software: InsEnc
