Abstract
The idea of this chapter is to provide a catalogue of known, mostly enumerative results, on classical and partially ordered patterns in permutations and words. We do not state any proofs, which can be found following the references we provide. When stating a result on (sets of) patterns, we normally pick just one representative from the corresponding symmetry class (the equivalence class modulo trivial bijections).
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). Classical patterns and POPs. 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_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-17333-2_6
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)