The following pages link to InsEnc (Q18315):
Displaying 20 items.
- Repetition in reduced decompositions (Q432487) (← links)
- Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents (Q974742) (← links)
- Growth rates of permutation classes: categorization up to the uncountability threshold (Q2182018) (← links)
- Exhaustive generation for permutations avoiding (colored) regular sets of patterns (Q2274076) (← links)
- Permutation patterns and cell decompositions (Q2319453) (← links)
- Enumeration schemes for permutations avoiding barred patterns (Q2380461) (← links)
- Maximally clustered elements and Schubert varieties. (Q2385103) (← links)
- Embedded factor patterns for Deodhar elements in Kazhdan-Lusztig theory. (Q2427009) (← links)
- Finitely labeled generating trees and restricted permutations (Q2457348) (← links)
- Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial (Q2915601) (← links)
- Refining enumeration schemes to count according to the inversion number (Q2915602) (← links)
- (Q2959518) (← links)
- (Q3084744) (← links)
- Small permutation classes (Q3102708) (← links)
- Enumeration of some classes of words avoiding two generalized patterns of length three (Q3589631) (← links)
- (Q3628998) (← links)
- Automatic discovery of structural rules of permutation classes (Q4629385) (← links)
- (Q5121940) (← links)
- On the centrosymmetric permutations in a class (Q5197609) (← links)
- On the effective and automatic enumeration of polynomial permutation classes (Q5963395) (← links)
