References
- [1] M
. Albert , M. Coleman , R. Flynn and I. Leader , Permutations containing many patterns, Ann. Comb., 11 (2007) 265—270. - [2] Y
. Biers- Ariel , A. Godbole and E. Kelley , Expected number of distinct subsequences in randomly generated binary strings, Discrete Math. Theor. Comput. Sci., 19 (2018) #10. - [3] M
. Bóna , On non-overlapping patterns of permutations, Pure Math. Appl. (PU.M.A.), 22 (2011) 99–105. - [4] J
. Borga and R. Penaguiao , The feasible region for consecutive patterns of permutations is a cycle polytope, available at https://arxiv.org/pdf/1910.02233.pdf. - [5] J
. Borga and R. Penaguiao , The feasible regions for consecutive patterns of pattern-avoiding permutations, available at https://arxiv.org/pdf/2010.06273.pdf. - [6] M
. Coleman , An answer to a question by Wilf on packing distinct patterns in a permutation, Electron. J. Combin., 11 (2004) #N8. - [7] A
. Duane and J. Remmel , Minimal overlapping patterns in colored permutations, Electron. J. Combin., 18 (2011) #P25. - [8] A
. Flaxman , A. Harrow and G. Sorkin , Strings with maximally many distinct subsequences and substrings, Electron. J. Combin., 11 (2004) #R8. - [9] E
. Fokuoh , The expected number of patterns in a randomly generated permutation on [n] = {1, 2, ..., n}, M.Sc. Thesis, East Tennessee State University, 2018, available at https://dc.etsu.edu/cgi/viewcontent.cgi?article=4916&context=etd. - [10] A
. Miller , Asymptotic bounds for permutations containing many different patterns, J. Combin. Theory Ser. A, 116 (2009) 92–108.