论文信息 - Restricted permutations and queue jumping

Restricted permutations and queue jumping

A connection between permutations that avoid 4231 and a certain queuing discipline is established. It is proved that a more restrictive queuing discipline corresponds to avoiding both 4231 and 42513, and enumeration results for such permutations are given.

[1] Miklós Bóna. Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps , 1997, J. Comb. Theory, Ser. A.

[2] R. Stanley. What Is Enumerative Combinatorics , 1986 .

[3] Ira M. Gessel,et al. Symmetric functions and P-recursiveness , 1990, J. Comb. Theory, Ser. A.

[4] Miklós Bóna,et al. Permutations avoiding certain patterns: The case of length 4 and some generalizations , 1997, Discret. Math..

[5] Julian West,et al. Generating trees and the Catalan and Schröder numbers , 1995, Discret. Math..

[6] Mike D. Atkinson,et al. Restricted permutations , 1999, Discret. Math..

[7] Darla Kremer. Permutations with forbidden subsequences and a generalized Schro"der number , 2000, Discret. Math..

[8] R. Stanley,et al. Enumerative Combinatorics: Index , 1999 .