Book contents
- Frontmatter
- Contents
- Preface
- Some general results in combinatorial enumeration
- A survey of simple permutations
- Permuting machines and permutation patterns
- On three different notions of monotone subsequences
- A survey on partially ordered patterns
- Generalized permutation patterns – a short survey
- An introduction to structural methods in permutation patterns
- Combinatorial properties of permutation tableaux
- Enumeration schemes for words avoiding permutations
- The lexicographic first occurrence of a I-II-III-pattern
- Enumeration of partitions by rises, levels and descents
- Restricted patience sorting and barred pattern avoidance
- Permutations with k-regular descent patterns
- Packing rates of measures and a conjecture for the packing density of 2413
- On the permutational power of token passing networks
- Problems and conjectures
- References
On the permutational power of token passing networks
Published online by Cambridge University Press: 05 October 2010
Book contents
- Frontmatter
- Contents
- Preface
- Some general results in combinatorial enumeration
- A survey of simple permutations
- Permuting machines and permutation patterns
- On three different notions of monotone subsequences
- A survey on partially ordered patterns
- Generalized permutation patterns – a short survey
- An introduction to structural methods in permutation patterns
- Combinatorial properties of permutation tableaux
- Enumeration schemes for words avoiding permutations
- The lexicographic first occurrence of a I-II-III-pattern
- Enumeration of partitions by rises, levels and descents
- Restricted patience sorting and barred pattern avoidance
- Permutations with k-regular descent patterns
- Packing rates of measures and a conjecture for the packing density of 2413
- On the permutational power of token passing networks
- Problems and conjectures
- References
- Type
- Chapter
- Information
- Permutation Patterns , pp. 317 - 338Publisher: Cambridge University PressPrint publication year: 2010
References
[1] , , and . Regular closed sets of permutations. Theoret. Comput. Sci., 306(1-3):85–100, 2003.Google Scholar
[2] , , and . Permutations generated by token passing in graphs. Theoret. Comput. Sci., 178(1-2):103–118, 1997.Google Scholar
[3] , , , and . A linear-time algorithm for the feasibility of pebble motion on trees. Algorithmica, 23(3):223–245, 1999.Google Scholar
[5] . The art of computer programming. Vol. 1: Fundamental algorithms. Addison-Wesley Publishing Co., Reading, Mass., 1969.Google Scholar
[6] , , , and . Motion planning on a graph (extended abstract). In , editor, 35th Annual Symposium on Foundations of Computer Science, pages 511–520. IEEE, 1994.Google Scholar
[7] . Computing permutations with double-ended queues, parallel stacks and parallel queues. In STOC '73: Proceedings of the fifth annual ACM symposium on Theory of computing, pages 268–277, New York, NY, USA, 1973. ACM Press.Google Scholar
[8] and . The (n2 – 1)-puzzle and related relocation problems. J. Symbolic Comput., 10(2):111–137, 1990.Google Scholar
[9] . Sorting using networks of queues and stacks. J. Assoc. Comput. Mach., 19:341–346, 1972.Google Scholar
[10] . Graph puzzles, homotopy, and the alternating group. J. Combinatorial Theory Ser. B, 16:86–96, 1974.Google Scholar