Answers are grounded in this paper and cite their sources.
We study the longest increasing subsequences in random involutions that avoid the patterns of length three under the uniform probability distribution. We determine the exact and asymptotic formulas for the average length of the longest increasing subsequences for such permutation classes.
No takes yet. Share an insight, caveat, or question.
Mansour et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: