Pattern avoidance in inversion sequences

[1] A. Burstein, Enumeration of Words with Forbidden Patterns, Ph.D. thesis, University of Pennsylvania, 1998.Search in Google Scholar

[2] D. Callan, Pattern avoidance in „flattened” partitions, Discrete Math., 309 (2009) 4187-4191.Search in Google Scholar

[3] W. Y. C. Chen, A. J. X. Guo, P. L. Guo, H. H. Y. Huang and T. Y. H. Liu, s-inversion sequences and P-partitions of type B, at http://arxiv.org/abs/1310.5313.Search in Google Scholar

[4] Q. H. Hou and T. Mansour, Kernel method and systems of functional equations with several conditions, J. Comput. Appl. Math., 235 (2011) 1205-1212.Search in Google Scholar

[5] S. Kitaev, Patterns in Permutations and Words, Springer, 201110.1007/978-3-642-17333-2Search in Google Scholar

[6] D. E. Knuth, The Art of Computer Programming, Volumes 1 and 3, Addison-Wesley, Reading, MA 1968, 1973.Search in Google Scholar

[7] T. Mansour, Restricted 132-avoiding k-ary words, Chebyshev polynomials, and continued fractions, Adv. in Appl. Math., 36 (2006) 175-193.10.1016/j.aam.2005.04.003Search in Google Scholar

[8] T. Mansour and M. Shattuck, Pattern avoidance in flattened permutations, Pure Math. Appl. (PU.M.A.), 22 (2011) 75-86.Search in Google Scholar

[9] C. D. Savage and M. J. Schuster, Ehrhart series of lecture hall polytopes and Eulerian polynomials for inversion sequences, J. Combin. Theory Ser. A, 119 (2012) 850-870.10.1016/j.jcta.2011.12.005Search in Google Scholar

[10] R. Simion and F. W. Schmidt, Restricted permutations, European J. Combin., 6 (1985) 383-406.10.1016/S0195-6698(85)80052-4Search in Google Scholar

[11] N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences, at http://oeis.org, 2010.Search in Google Scholar

[12] R. P. Stanley, Enumerative Combinatorics, Vol. I, Cambridge University Press, 1997.10.1017/CBO9780511805967Search in Google Scholar

[13] D. Zeilberger, Enumeration schemes, and more importantly, their automatic generation, Ann. Comb., 2 (1998) 185-195.10.1007/BF01608488Search in Google Scholar