论文信息 - Lattice Path Enumeration of Permutations with k Occurrences of the Pattern 2-13 - 字舞流文

Lattice Path Enumeration of Permutations with k Occurrences of the Pattern 2-13

We count the number of permutations with k occurrences of the pattern 2{13 in permutations by lattice path enumeration. We give closed forms for k • 8, extending results of Claesson and Mansour.

Robert Parviainen | R. Parviainen

[1] Anders Claesson,et al. Generalized Pattern Avoidance , 2001, Eur. J. Comb..

[2] Philippe Flajolet. Combinatorial aspects of continued fractions , 1980, Discret. Math..

[3] Doron Zeilberger,et al. Denert's permutation statistic is indeed Euler-Mahonian , 1990 .

[4] Toufik Mansour,et al. Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations , 2002, Adv. Appl. Math..

[5] N. J. A. Sloane,et al. The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[6] Eric Babson,et al. Generalized permutation patterns and a classification of the Mahonian statistics , 2000 .

[7] Sylvie Corteel,et al. A Combinatorial Derivation of the PASEP Stationary State , 2006, Electron. J. Comb..