论文信息 - Compositions of pattern restricted sets of permutations

Compositions of pattern restricted sets of permutations

The composition of two pattern restricted classes X,Y is the set of all permutation products θφ where θ ∈ X,φ ∈ Y . This set is also defined by pattern restrictions. Examples are given where this set of restrictions is finite and where it is infinite. The composition operation is studied in terms of machines that sort and generate permutations. The theory is then applied to a multistage sorting network where each stage can exchange any number of adjacent disjoint pairs.

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

[2] Mike D. Atkinson,et al. Permutations Generated by Token Passing in Graphs , 1997, Theor. Comput. Sci..

[3] Miklós Bóna,et al. A Survey of Stack-Sorting Disciplines , 2003, Electron. J. Comb..

[4] Maximilian M. Murphy,et al. Restricted permutations, antichains, atomic classes and stack sorting , 2003 .

[5] Gaetano Quattrocchi,et al. Resolving Triple Systems into Regular Configurations , 2000, Electron. J. Comb..

[6] Donald E. Knuth,et al. The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[7] Robert E. Tarjan,et al. Sorting Using Networks of Queues and Stacks , 1972, J. ACM.

[8] Nikola Ruskuc,et al. Regular closed sets of permutations , 2003, Theor. Comput. Sci..

[9] Daniel A. Spielman,et al. An Infinite Antichain of Permutations , 2000, Electron. J. Comb..

[10] Vaughan R. Pratt,et al. Computing permutations with double-ended queues, parallel stacks and parallel queues , 1973, STOC.

[11] Nikola Ruskuc,et al. Partially Well-Ordered Closed Sets of Permutations , 2002, Order.

[12] TarjanRobert. Sorting Using Networks of Queues and Stacks , 1972 .