Name: Patterns in Permutations and Words (Monographs in Theoretical Computer Science. An Eatcs Series) (en Inglés)
SKU: 64155316
Price: 154.44 USD
Availability: InStock
Author: Sergey Kitaev
ISBN: 9783642269875

portada Patterns in Permutations and Words (Monographs in Theoretical Computer Science. An Eatcs Series) (en Inglés)

Patterns in Permutations and Words (Monographs in Theoretical Computer Science. An Eatcs Series) (en Inglés)

Formato

Libro Físico

Editorial

Springer

Autor

Sergey Kitaev

Idioma

Inglés

N° páginas

516

Encuadernación

Tapa Blanda

ISBN13

9783642269875

N° edición

2011th

Patterns in Permutations and Words (Monographs in Theoretical Computer Science. An Eatcs Series) (en Inglés)

Sergey Kitaev (Autor) · Springer · Tapa Blanda

Libro Nuevo Importado

Envío: 21 a 28 días háb.

$ 280.80$ 154.44

-45%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

$ 154.44

Llega entre el 29 Sep y el 13 Oct a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Patterns in Permutations and Words (Monographs in Theoretical Computer Science. An Eatcs Series) (en Inglés)"

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.