Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences
Advances in Applied Mathematics(2020)
摘要
We study the longest increasing subsequence problem for random permutations avoiding the pattern 312 and another pattern τ 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 specifically when the pattern τ is monotone increasing or decreasing, or any pattern of length four.
更多查看译文
关键词
05A05,05A15
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要