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, ...
Read More
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.
Read Less
Add this copy of Patterns in Permutations and Words to cart. $177.49, like new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2011 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2011, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2011
Language:
English
Alibris ID:
18426677227
Shipping Options:
Standard Shipping: $4.99
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Monographs in Theoretical Computer Science. An EATCS Series . XXII, 494 p. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Patterns in Permutations and Words (Monographs in to cart. $506.97, very good condition, Sold by BetterBookDeals rated 3.0 out of 5 stars, ships from NIAGARA FALLS, NY, UNITED STATES, published 2013 by Springer.
