Look Inside Permutation Patterns

Permutation Patterns

Part of London Mathematical Society Lecture Note Series

Editors:
Steve Linton, University of St Andrews, Scotland
Nik Ruškuc, University of St Andrews, Scotland
Vincent Vatter, Dartmouth College, New Hampshire

Martin Klazar, Robert Brignall, Mike Atkinson, Miklós Bóna, Sergey Kitaev, Einar Steingrímsson, Michael Albert, Alexander Burstein, Niklas Eriksen, Lara Pudwell, Torey Burton, Anant P. Godbole, Brett M. Kindle, Toufik Mansour, Augustine O. Munagi, Alexander Burstein, Isaiah Lankham, Anthony Mendes, Jeffrey B. Remmel, Amanda Riehl, Cathleen Battiste Presutti, Walter Stromquist, Steve Linton, Nik Rŭskuc

View all contributors

Date Published: July 2010
availability: Available
format: Paperback
isbn: 9780521728348

Rate & review

Paperback

Add to wishlist

Other available formats:
eBook

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description

Permutation patterns is a thriving area of combinatorics that relates to many other areas of mathematics, including graph theory, enumerative combinatorics, model theory, the theory of automata and languages, and bioinformatics. Arising from the Fifth International Conference on Permutation Patterns, held in St Andrew's in June 2007, this volume contains a mixture of survey and research articles by leading experts, whom include the two invited speakers, Martin Klazar and Mike Atkinson. Together, the collected articles cover all the significant strands of current research: structural methods and simple patterns, generalisations of patterns, various enumerative aspects, machines and networks, packing, and more. Specialists in this area and other researchers in combinatorics and related fields will find much of interest in this book. In addition, the volume provides plenty of material accessible to advanced undergraduates and is a suitable reference for projects and dissertations.
- Provides a snapshot of the area's current state of development
- Gives an insight into links with other areas of combinatorics and mathematics
- Includes an appendix containing a selection of open problems
Read more
Reviews & endorsements
"This well-written collection of research papers by international experts in the field covers all of the significant strands of current research, including structural methods and simple patterns, generalizations of patterns, various enumerative aspects, machines, and networks. I highly recommend this book to specialists and researchers in combinatorics. It should be noted that a few of the current problems in the field of permutation patterns are listed at the end of the book, which makes it a good starting point for future projects and dissertations."
Hamid R. Noori, Computing Reviews

Customer reviews

Not yet reviewed
Be the first to review

Log in to review

Review was not posted due to profanity
×

, create a review

(If you're not , sign out)

Please enter the right captcha value

Please enter a star rating.

Your review must be a minimum of 12 words.

How do you rate this item?

Reviews must contain at least 12 words about the product.

×

Product details
- Date Published: July 2010
- format: Paperback
- isbn: 9780521728348
- length: 352 pages
- dimensions: 228 x 153 x 20 mm
- weight: 0.5kg
- contains: 55 b/w illus. 20 exercises
- availability: Available
Table of Contents
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 Miklós Bóna
5. A survey on partially ordered patterns Sergey Kitaev
6. Generalized permutation patterns - a short survey Einar Steingrímsson
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.
Look Inside
Editors
Steve Linton, University of St Andrews, Scotland
Steve Linton is a Professor of Computer Science at the University of St Andrews, Scotland, where he directs the Centre for Interdisciplinary Research in Computational Algebra.
Nik Ruškuc, University of St Andrews, Scotland
Nik Ruškuc is a Professor of Mathematics at the University of St Andrews, Scotland.
Vincent Vatter, Dartmouth College, New Hampshire
Vincent Vatter is a John Wesley Young Instructor at Dartmouth College, New Hampshire.
Contributors
Martin Klazar, Robert Brignall, Mike Atkinson, Miklós Bóna, Sergey Kitaev, Einar Steingrímsson, Michael Albert, Alexander Burstein, Niklas Eriksen, Lara Pudwell, Torey Burton, Anant P. Godbole, Brett M. Kindle, Toufik Mansour, Augustine O. Munagi, Alexander Burstein, Isaiah Lankham, Anthony Mendes, Jeffrey B. Remmel, Amanda Riehl, Cathleen Battiste Presutti, Walter Stromquist, Steve Linton, Nik Rŭskuc