• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Patterns in Permutations and Words

Patterns in Permutations and Words

Hardcover

Series: Monographs in Theoretical Computer Science. an Eatcs

AlgebraGeneral ComputersGeneral Mathematics

ISBN10: 3642173322
ISBN13: 9783642173325
Publisher: Springer Nature
Published: Sep 1 2011
Pages: 494
Weight: 1.95
Height: 1.30 Width: 6.40 Depth: 9.20
Language: English

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.

Also in

General Computers