0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Algebra

Buy Now

Patterns in Permutations and Words (Hardcover, 2011 ed.) Loot Price: R4,322
Discovery Miles 43 220
Patterns in Permutations and Words (Hardcover, 2011 ed.): Sergey Kitaev

Patterns in Permutations and Words (Hardcover, 2011 ed.)

Sergey Kitaev

Series: Monographs in Theoretical Computer Science. An EATCS Series

 (sign in to rate)
Loot Price R4,322 Discovery Miles 43 220 | Repayment Terms: R405 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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.

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.

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Monographs in Theoretical Computer Science. An EATCS Series
Release date: September 2011
First published: 2011
Authors: Sergey Kitaev
Dimensions: 235 x 155 x 34mm (L x W x T)
Format: Hardcover
Pages: 494
Edition: 2011 ed.
ISBN-13: 978-3-642-17332-5
Categories: Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Books > Computing & IT > General theory of computing > Mathematical theory of computation
Books > Computing & IT > Applications of computing > General
Books > Science & Mathematics > Mathematics > Algebra > General
Books > Science & Mathematics > Biology, life sciences > Life sciences: general issues > General
LSN: 3-642-17332-2
Barcode: 9783642173325

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners