References
- [1] M. H. A
lbert , C. Homberger , J. Pantone , N. Shar and V. Vatter , Generating permutations with restricted containers, at http://arxiv.org/abs/1510.00269. - [2] M. H. A
lbert , S. Linton and N. Ruskuc , The insertion encoding of permutations, Electron. J. Combin., 12 (2005) #R47. - [3] D. C
allan and T. Mansour , On permutations avoiding 1324, 2143, and another 4-letter pattern, Pure Math. Appl. (PU.M.A.), 26 (2017) 1–10. - [4] D. C
allan and T. Mansour , On permutations avoiding 1243, 2134, and another 4-letter pattern, Pure Math. Appl. (PU.M.A.), 26 (2017) 11–21. - [5] D. C
allan and T. Mansour , Enumeration of small Wilf classes avoiding 1324 and two other 4-letter patterns, Pure Math. Appl. (PU.M.A.), 27(1) (2018) 32–61. - [6] D. C
allan and T. Mansour , Enumeration of small Wilf classes avoiding 1342 and two other 4-letter patterns, Pure Math. Appl. (PU.M.A.), 27(1) (2018) 62–97. - [7] D. C
allan , T. Mansour and M. Shattuck , Wilf classification of triples of 4-letter patterns I, Discrete Math. Theor. Comput. Sci., 19 (2017) #5. - [8] D. C
allan , T. Mansour and M. Shattuck , Wilf classification of triples of 4-letter patterns II, Discrete Math. Theor. Comput. Sci., 19 (2017) #6. - [9] D. C
allan , T. Mansour and M.Shattuck , Wilf classification of triples of 4-letter patterns, at http://arxiv.org/abs/1605.04969. - [10] G. F
irro and T. Mansour , Three-letter-pattern avoiding permutations and functional equations, Electron. J. Combin., 13 (2006) #R51. - [11] Q. H
ou and T. Mansour , Kernel method and linear recurrence system, J. Comput. Appl. Math., 261 (2008) 227–242. - [12] D. E. K
nuth , The Art of Computer Programming, 3rd edition, Addison Wesley, Reading, MA, 1997. - [13] D. K
remer and W. C. Shiu , Finite transition matrices for permutations avoiding pairs of length four patterns, Discrete Math., 268 (2003) 171–183. - [14] I. L
e , Wilf classes of pairs of permutations of length 4, Electron. J. Combin., 12 (2005) #R25. - [15] T. M
ansour and M. Schork , Wilf classification of subsets of four letter patterns, J. Comb. Number Theory, 8 (2016) 1–129. - [16] T. M
ansour and M. Schork , Wilf classification of subsets of eight and nine four-letter patterns, J. Comb. Number Theory, 8 (2016) 257–283. - [17] R. S
imion and F. W. Schmidt , Restricted permutations, European J. Combin., 6 (1985) 383–406. - [18] N. J. A. S
loane , The On-Line Encyclopedia of Integer Sequences, at http://oeis.org. - [19] Z. S
tankova , Forbidden subsequences, Discrete Math., 132 (1994) 291–316. - [20] Z. S
tankova , Classification of forbidden subsequences of length four, European J. Combin., 17 (1996) 501–517. - [21] V. V
atter , Finding regular insertion encodings for permutation classes, J. Symbolic Comput., 47 (2012) 259–265. - [22] J. W
est , Generating trees and the Catalan and Schröder numbers, Discrete Math., 146 (1995) 247–262. - [23] Wikipedia, Permutation pattern, at https://en.wikipedia.org/wiki/Permutation_pattern
- [24] Wikipedia, Enumerations of specific permutation classes, available at https://en.wikipedia.org/wiki/Enumerations_of_specific_permutation_classes