Shape and pattern containment of separable permutations.

zbMATH Open1474.05002arXiv1011.5491MaRDI QIDQ2829071FDOQ2829071

Authors: Andrew Crites, Greta Panova, Gregory S. Warrington 

Publication date: 26 October 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

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 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.

Full work available at URL: https://arxiv.org/abs/1011.5491

Recommendations

• Simple permutations, alternating permutations, and the superpatterns that contain them.
• Subclasses of the separable permutations
• Pattern containment in circular permutations
• The patterns of permutations
• Patterns in permutations and words.

zbMATH Keywords

permutationspatternsseparable permutationsshape of permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cited In (2)

• Permutation patterns, Stanley symmetric functions, and generalized Specht modules
• Interview with Greta Panova

This page was built for publication: Shape and pattern containment of separable permutations.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829071)