Cited in
(28)- Some enumerative results related to ascent sequences
- Enumeration schemes for vincular patterns
- Refining enumeration schemes to count according to permutation statistics
- Pattern avoidance in ordered set partitions
- Pattern-avoiding set partitions and Catalan numbers
- Automatic discovery of structural rules of permutation classes
- Finite transition matrices for permutations avoiding pairs of length four patterns
- Pattern avoidance in the rook monoid
- Restricted k-ary words and functional equations
- Catalan numbers and pattern restricted set partitions
- InsEnc
- Asyrec
- FindRec
- WILF
- F123
- F1234
- F12345
- P123
- P1234
- P12345
- P123456
- PermStruct
- PermPAL
- Counting subwords in flattened partitions of sets
- Finitely labeled generating trees and restricted permutations
- On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia
- Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3
- Enumeration schemes and, more importantly, their automatic generation
This page was built for software: HERB
