libri scuola books Fumetti ebook dvd top ten sconti 0 Carrello


Torna Indietro
ARGOMENTO:  BOOKS > INFORMATICA > TESTI GENERALI

kitaev sergey - patterns in permutations and words
Zoom

Patterns in Permutations and Words




Disponibilità: Normalmente disponibile in 15 giorni


PREZZO
162,98 €
NICEPRICE
154,83 €
SCONTO
5%



Questo prodotto usufruisce delle SPEDIZIONI GRATIS
selezionando l'opzione Corriere Veloce in fase di ordine.


Pagabile anche con Carta della cultura giovani e del merito, Carta della Cultura e Carta del Docente


Facebook Twitter Aggiungi commento


Spese Gratis

Dettagli

Genere:Libro
Lingua: Inglese
Editore:

Springer

Pubblicazione: 09/2011
Edizione: 2011





Trama

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.





Sommario

Chap. 1, What Is a Pattern in a Permutation or a Word?.-

Chap. 2, Why Such patterns? A Few Motivation Points.-

Chap. 3, More Motivation Points.-

Chap. 4, Bijections Between 321- and 132-Avoiding Permutations.-

Chap. 5, Consecutive Patterns.-

Chap. 6, Classical Patterns and POPs.-

Chap. 7, VPs, BVPs and BPs.-

Chap. 8, Miscellaneous on Patterns in Permutations and Words.-

Chap. 9, Extending Research on Patterns in Permutations and Words to Other Domains.-

App. A, Useful Notions and Facts.-

App. B, Some Algebraic Background.-

Bibliography.-

Index.





Autore

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.











Altre Informazioni

ISBN:

9783642173325

Condizione: Nuovo
Collana: Monographs in Theoretical Computer Science. An EATCS Series
Dimensioni: 235 x 155 mm
Formato: Copertina rigida
Illustration Notes:XXII, 494 p.
Pagine Arabe: 494
Pagine Romane: xxii


Dicono di noi