Andrew Crites, Greta Panova, Gregory S. Warrington
Published 2010-11-24, updated 2011-09-05Version 2
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 \sigma\ as a pattern, the shape of w contains the shape of \sigma. As an application, we exhibit lower bounds for the lengths of supersequences of sets containing separable permutations.
Comments: 8 pages, 2 figures. Changed emphasis and structure towards shapes containment based on referee's suggestions
An application of a bijection of Mansour, Deng, and Du
An application of the Local C(G,T) Theorem to a conjecture of Weiss
A new application of the $\otimes_h$-product to $α$-labelings
![QR code for arXiv:1011.5491 [math.CO]](http://oss.arxitics.com/images/favicon.svg)