Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences
Date
2020
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
1
views
views
17
downloads
downloads
Citation Stats
Series
Abstract
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.
Source Title
Advances in Applied Mathematics
Publisher
Elsevier
Course
Other identifiers
Book Title
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Collections
Language
English