Pattern avoiding permutations and involutions with a unique longest increasing subsequence
Combinatorics
2020-03-25 v1
Abstract
We investigate permutations and involutions that avoid a pattern of length three and have a {\em unique} longest increasing subsequence.
Cite
@article{arxiv.2003.10640,
title = {Pattern avoiding permutations and involutions with a unique longest increasing subsequence},
author = {Miklos Bona and Elijah DeJonge},
journal= {arXiv preprint arXiv:2003.10640},
year = {2020}
}
Comments
Ten pages