Longest increasing subsequences in involutions avoiding patterns of length three

TURKISH JOURNAL OF MATHEMATICS（2019）

引用 2|浏览3

暂无评分

摘要

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.

查看译文

关键词

Pattern-avoidance,involutions,longest increasing subsequences,Chebyshev polynomials,generating functions

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要