Patterns in Permutations and Words

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 poin...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Kitaev, Sergey (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011.
Edición:1st ed. 2011.
Colección:Monographs in Theoretical Computer Science. An EATCS Series,
Temas:
Computer science.
Discrete mathematics.
Computer science-Mathematics.
Algebra.
Bioinformatics.
Theory of Computation.
Discrete Mathematics.
Mathematics of Computing.
Computational and Systems Biology.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares