Abstract
In Chapter 2 we discussed how the (permutation) patterns theory is connected to other areas, such as sorting problems, maps and orientations, trees, Baxter permutations, Schröder structures and certain algebra problems. In this section, we discuss other important connections, namely, to statistical mechanics, to certain partially ordered sets and equinumerous objects, to the study of permutation statistics, to encoding combinatorial structures, and to proving combinatorial identities.
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). More 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_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-17333-2_3
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)