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
Combinatorial properties of permutation tableaux
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. 171 - 192Publisher: Cambridge University PressPrint publication year: 2010
References
[2] and . A conjecture of Stanley on alternating permutations. Electron. J. Combin., 14(1):Note 16, 7 pp., 2007.Google Scholar
[3] . Crossings and alignments of permutations. Adv. in Appl. Math., 38(2):149–163, 2007.Google Scholar
[4] and . Bijections for permutation tableaux. European J. Combin., 30(1):295–310, 2009.Google Scholar
[5] and . A Markov chain on permutations which projects to the PASEP. Int. Math. Res. Not. IMRN, 2007(17):Art. ID rnm055, 27, 2007.Google Scholar
[6] and . Tableaux combinatorics for the asymmetric exclusion process. Adv. in Appl. Math., 39(3):293–310, 2007.Google Scholar
[7] . Strongly convergent games and Coxeter groups. PhD thesis, KTH Royal Institute of Technology, 1993.
[8] . Webs in totally positive Grassmann cells. Manuscript, 2001.
[9] . The On-line Encyclopedia of Integer Sequences. Available online at http://www.research.att.com/∼njas/sequences/.
[10] and . Permutation tableaux and permutation patterns. J. Combin. Theory Ser. A, 114(2):211–234, 2007.Google Scholar
[11] . Enumeration of totally positive Grassmann cells. Adv. Math., 190(2):319–342, 2005.Google Scholar