Abstract
In this section we discuss several extensions of research on patterns in permutations and words to other contexts. Among these extensions are a requirement on parity of elements (see Section 9.1), considerations of multisets (see Section 9.3) and signed/colored permutations (see Section 9.6), increasing the number of dimensions (see Subsections 9.8.2 and 9.8.3), and some other directions/generalizations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). Extending research on patterns in permutations and words to other domains. 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_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-17333-2_9
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)