Patterns in Permutations and Words

• Κύριος συγγραφέας: Kitaev, Sergey (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011.
• Σειρά: Monographs in Theoretical Computer Science. An EATCS Series,
• Θέματα: Computer science.; Computers.; Computer science > Mathematics.; Bioinformatics.; Algebra.; Combinatorics.; Computer Science.; Theory of Computation.; Mathematics of Computing.; Computational Biology/Bioinformatics.

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

Πίνακας περιεχομένων:

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