swMATH6181MaRDI QIDQ18315FDOQ18315
Author name not available (Why is that?)
Official website: http://www-circa.mcs.st-and.ac.uk/~vince/programs/insenc/
Cited In (22)
- On the effective and automatic enumeration of polynomial permutation classes
- Title not available (Why is that?)
- Automatic discovery of structural rules of permutation classes
- Enumeration and Wilf-classification of permutations avoiding four patterns of length 4
- Maximally clustered elements and Schubert varieties.
- Embedded factor patterns for Deodhar elements in Kazhdan-Lusztig theory.
- Repetition in reduced decompositions
- Small permutation classes
- Wilf classification of subsets of four letter patterns
- Enumeration schemes for permutations avoiding barred patterns
- Exhaustive generation for permutations avoiding (colored) regular sets of patterns
- Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
- On the centrosymmetric permutations in a class
- WILF
- PermLab
- Refining enumeration schemes to count according to the inversion number
- Permutation patterns and cell decompositions
- Enumeration schemes for words avoiding permutations
- Finitely labeled generating trees and restricted permutations
- Growth rates of permutation classes: categorization up to the uncountability threshold
- Enumeration of some classes of words avoiding two generalized patterns of length three
- Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents
This page was built for software: InsEnc
