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
Restricted patience sorting and barred pattern avoidance
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. 233 - 258Publisher: Cambridge University PressPrint publication year: 2010
References
[1] , , and . The insertion encoding of permutations. Electron. J. Combin., 12(1):Research paper 47, 31 pp., 2005.Google Scholar
[2] and . Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem. Bull. Amer. Math. Soc. (N.S.), 36(4):413–432, 1999.Google Scholar
[3] and . Enumerating longest increasing subsequences and patience sorting. Inform. Process. Lett., 76(1-2):7–11, 2000.Google Scholar
[4] . Combinatorics of permutations. Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall/CRC, Boca Raton, FL, 2004.Google Scholar
[5] and . Combinatorics of patience sorting piles. Sém. Lothar. Combin., 54A:Art. B54Ab, 19 pp., 2005/07.Google Scholar
[6] and . A geometric form for the extended patience sorting algorithm. Adv. in Appl. Math., 36(2):106–117, 2006.Google Scholar
[8] and . Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations. Adv. in Appl. Math., 29(2):293–310, 2002.Google Scholar
[9] and . Enumerating permutations avoiding a pair of Babson-Steingrímsson patterns. Ars Combin., 77:17–31, 2005.Google Scholar
[10] , , and . A combinatorial proof of J. West's conjecture. Discrete Math., 187(1-3):71–96, 1998.Google Scholar
[11] , , and . Permutations with forbidden subsequences and nonseparable planar maps. Discrete Math., 153(1-3):85–103, 1996.Google Scholar
[12] . Problem 62-2, patience sorting. SIAM Review, 4:148–149, 1962. Solution in Vol. 5 (1963), 375–376.Google Scholar
[13] and . Excluded permutation matrices and the Stanley-Wilf conjecture. J. Combin. Theory Ser. A, 107(1):153–160, 2004.Google Scholar
[14] . Packing densities of layered patterns. PhD thesis, Univ. of Pennsylvania, 1997.
[15] . The Symmetric Group, volume 203 of Graduate Texts in Mathematics. Springer-Verlag, New York, second edition, 2001.Google Scholar
[17] . The On-line Encyclopedia of Integer Sequences. Available online at http://www.research.att.com/∼njas/sequences/.
[18] . Enumerative combinatorics. Vol. 2, volume 62 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1999.Google Scholar
[19] . Une forme géométrique de la correspondance de Robinson-Schensted. In Combinatoire et représentation du groupe symétrique (Actes Table Ronde CNRS, Univ. Louis-Pasteur Strasbourg, Strasbourg, 1976), pages 29–58. Lecture Notes in Math., Vol. 579. Springer, Berlin, 1977.Google Scholar
[20] . Permutations with forbidden subsequences and stack-sortable permutations. PhD thesis, M.I.T., 1990.
[22] and . Governing singularities of Schubert varieties. J. Algebra, 320(2):495–520, 2008.Google Scholar