Abstract
In this chapter we collect known enumerative results and/or references to them related to vincular patterns in permutations and words, and to bivincular patterns and barred patterns in permutations. As is typical for this book, no proofs are given, but they can easily be found following the references.
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). VPs, BVPs and BPs. 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_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-17333-2_7
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)