Permutations avoiding sets of patterns with long monotone subsequences
Combinatorics
2022-08-23 v2
Abstract
We enumerate permutations that avoid all but one of the patterns of length starting with a monotone increasing subsequence of length . We compare the size of such permutation classes to the size of the class of permutations avoiding the monotone increasing subsequence of length .
Cite
@article{arxiv.2103.06918,
title = {Permutations avoiding sets of patterns with long monotone subsequences},
author = {Miklós Bóna and Jay Pantone},
journal= {arXiv preprint arXiv:2103.06918},
year = {2022}
}