Shape and pattern containment of separable permutations

preprint2011arXivOpen access

Abstract

Every word has a shape determined by its image under the Robinson-Schensted-Knuth correspondence. We show that when a word w contains a separable (i.e., 3142- and 2413-avoiding) permutation σ as a pattern, the shape of w contains the shape of σ. As an application, we exhibit lower bounds for the lengths of supersequences of sets containing separable permutations.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.