HAPPY HOLIDAYS: Get a special discount on Apress Access! Subscribe today >>

Monographs in Theoretical Computer Science. An EATCS Series

Patterns in Permutations and Words

Authors: Kitaev, Sergey

  • Collects the main results in the field
  • Addresses differences in ideas and notations, highlights the main achievements, and points to research directions and open problems
  • Will be of interest to researchers and graduate students in theoretical computer science and mathematics
see more benefits

Buy this book

eBook $169.00
price for USA
  • ISBN 978-3-642-17333-2
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Download immediately after purchase
Hardcover $219.00
price for USA
  • ISBN 978-3-642-17332-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $219.00
price for USA
  • ISBN 978-3-642-26987-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

There has been considerable interest recently in the subject of patterns in permutations and words, a new branch of combinatorics with its roots in the works of Rotem, Rogers, and Knuth in the 1970s. Consideration of the patterns in question has been extremely interesting from the combinatorial point of view, and it has proved to be a useful language in a variety of seemingly unrelated problems, including the theory of Kazhdan—Lusztig polynomials, singularities of Schubert varieties, interval orders, Chebyshev polynomials, models in statistical mechanics, and various sorting algorithms, including sorting stacks and sortable permutations.

The author collects the main results in the field in this up-to-date, comprehensive reference volume. He highlights significant achievements in the area, and points to research directions and open problems. The book will be of interest to researchers and graduate students in theoretical computer science and mathematics, in particular those working in algebraic combinatorics and combinatorics on words. It will also be of interest to specialists in other branches of mathematics, theoretical physics, and computational biology.

About the authors

The author is a Reader in the Department of Computer and Information Sciences at the University of Strathclyde; his main research interests are enumerative and algebraic combinatorics, combinatorics on words, discrete analysis, graph theory and formal languages.

Reviews

From the reviews:

“This book summarizes recent developments in the rapidly growing field of patterns in permutations and words. … The book is a compendium of a great number of recent papers about patterns in permutations and words. … The book is a good summary of the current state of the subject. The bibliography at the end of the book is especially comprehensive, and very useful for the reader who wants to learn more about particular topics.” (Sergi Elizalde, Mathematical Reviews, September, 2013)

“The book presents the state of the art of ‘patterns in permutations and words’, a topic that has recently attracted considerable interest among researchers in various fields of mathematics and computer science, but also in theoretical physics and computational biology. It contains a list of 816 references and is well suited as a handbook for the methods and results of this area.” (K. Auinger, Monatshefte für Mathematik, Vol. 170 (2), May, 2013)

“The monograph provides probably a first comprehensive overview of a vivid area of pattern observations, forming itself a common tool for various fields of mathematics. Containing a list of 816 references to recent and older literature, it has a good chance to become a handbook and a useful guide to results and techniques in the area.” (Anton Cerny, Zentralblatt MATH, Vol. 1257, 2013)

Table of contents (9 chapters)

  • What is a pattern in a permutation or a word?

    Kitaev, Sergey

    Pages 1-28

  • Why such patterns? A few motivation points

    Kitaev, Sergey

    Pages 29-80

  • More motivation points

    Kitaev, Sergey

    Pages 81-139

  • Bijections between 321- and 132-avoiding permutations

    Kitaev, Sergey

    Pages 141-163

  • Consecutive patterns

    Kitaev, Sergey

    Pages 165-221

Buy this book

eBook $169.00
price for USA
  • ISBN 978-3-642-17333-2
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Download immediately after purchase
Hardcover $219.00
price for USA
  • ISBN 978-3-642-17332-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $219.00
price for USA
  • ISBN 978-3-642-26987-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Bibliographic Information

Bibliographic Information
Book Title
Patterns in Permutations and Words
Authors
Series Title
Monographs in Theoretical Computer Science. An EATCS Series
Copyright
2011
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-17333-2
DOI
10.1007/978-3-642-17333-2
Hardcover ISBN
978-3-642-17332-5
Softcover ISBN
978-3-642-26987-5
Series ISSN
1431-2654
Edition Number
1
Number of Pages
XXII, 494
Topics