Pattern avoiding permutations with a unique longest increasing subsequence (Q2215466)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Pattern avoiding permutations with a unique longest increasing subsequence |
scientific article |
Statements
Pattern avoiding permutations with a unique longest increasing subsequence (English)
0 references
13 December 2020
0 references
Summary: We investigate permutations and involutions that avoid a pattern of length three and have a unique longest increasing subsequence (ULIS). We prove an explicit formula for 231-avoiders, we show that the growth rate for 321-avoiding permutations with a ULIS is 4, and prove that their generating function is not rational. We relate the case of 132-avoiders to the existing literature, raising some interesting questions. For involutions, we construct a bijection between 132-avoiding involutions with a ULIS and bidirectional ballot sequences.
0 references
bidirectional ballot sequences
0 references
permutation patterns
0 references
0 references