Dear Doron,
I saw your paper in arXiv "Counting Permutations that Avoid Many Patterns".
Here are my papers which are related to your results, see below (this is not a complete set of references). Actually i finished finding of all Wilf classes of any set T of patterns from S_4. More details: (a) the case |T|>=10 done in [3] (b) the case |T|=8,9 done in [2], (c) the case |T|=6,7 will be submitted in few days, (d) the case |T|=4,5 it is preprint up to editing and proofreading (e) the case |T|=3 will appear in DMTCS (see [3]+[4]), and also some singletons of Wilf classes already done and accepted in PuMA and other journals such as [1], [6], [7].
I hope these points will be moved to all your coauthors.
1. D. Callan and T. Mansour, A Wilf class composed of 7 symmetry classes of triples of 4-letter patterns, Journal of Analysis & Number Theory An International Journal 5:1 (2017) 19--26.
2. T. Mansour and M. Schork, Wilf classification of subsets of eight and nine four-letter patterns, Journal of Combinatorics and Number Theory 8:3 (2016) 27pp.
3. T. Mansour and M. Schork, Wilf classification of subsets of four letter patterns, Journal of Combinatorics and Number Theory 8:1 (2016) 1--111.
4. D. Callan, {\bf T. Mansour} and M. Shattuck, Wilf classification of triples of 4-letter patterns I, DMTCS, to appear
5. D. Callan, {\bf T. Mansour} and M. Shattuck, Wilf classification of triples of 4-letter patterns II, DMTCS, to appear
6. D. Callan and {\bf T. Mansour}, Five subsets of permutations
enumerated as weak sorting permutations.
7. D. Callan, {\bf T. Mansour} and M. Shattuck, Twelve subsets
of permutations enumerated as maximally clustered permutations.
actually there are more
All the best,
Professor Toufik Mansour
Chairman of Department of Mathematics
University of Haifa
www.math.haifa.ac.il/toufik