Abstract
While getting familiar with results on patterns in later chapters, one not only has a chance to appreciate the beauty of combinatorics of patterns on words and permutations (which is interesting in its own right), but also to learn about connections of the field to other branches of combinatorics, mathematics, and theoretical computer science. The main application of patterns so far is that in many situations they provide a convenient language for describing various (combinatorial) objects. Such descriptions can be used in establishing properties (e.g., equidistribution results) of objects related to words or permutations restricted somehow by patterns (e.g., avoiding certain patterns). However, in most of the cases considered in the literature, the prime interest in linking pattern-restricted permutations/words to other objects is finding a bijection between the structures involved rather than also trying to find immediate applications.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kitaev, S. (2011). Why such patterns? A few motivation points. In: Patterns in Permutations and Words. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17333-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-17333-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17332-5
Online ISBN: 978-3-642-17333-2
eBook Packages: Computer ScienceComputer Science (R0)