책 이미지
책 정보
· 분류 : 외국도서 > 과학/수학/생태 > 수학 > 이산수학
· ISBN : 9780521728348
· 쪽수 : 352쪽
목차
Preface; 1. Some general results in combinatorial enumeration Martin Klazar; 2. A survey of simple permutations Robert Brignall; 3. Permuting machines and permutation patterns Mike Atkinson; 4. On three different notions of monotone subsequences Miklos Bona; 5. A survey on partially ordered patterns Sergey Kitaev; 6. Generalized permutation patterns - a short survey Einar Steingrimsson; 7. An introduction to structural methods in permutation patterns Michael Albert; 8. Combinatorial properties of permutation tableaux Alexander Burstein and Niklas Eriksen; 9. Enumeration schemes for words avoiding permutations Lara Pudwell; 10. The lexicographic first occurrence of a I-II-III pattern Torey Burton, Anant P. Godbole and Brett M. Kindle; 11. Enumeration of partitions by rises, levels and descents Toufik Mansour and Augustine O. Munagi; 12. Restricted patience sorting and barred pattern avoidance Alexander Burstein and Isaiah Lankham; 13. Permutations with k-regular descent patterns Anthony Mendes, Jeffrey B. Remmel and Amanda Riehl; 14. Packing rates of measures and a conjecture for the packing density of 2413 Cathleen Battiste Presutti and Walter Stromquist; 15. On the permutational power of token passing networks Michael Albert, Steve Linton and Nik R?skuc; 16. Problems and conjectures.