Longest increasing subsequences in involutions avoiding patterns of length three
Date
2019-07
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Turkish Journal of Mathematics
Print ISSN
1300-0098
Electronic ISSN
1303-6149
Publisher
TÜBİTAK
Volume
43
Issue
5
Pages
2183 - 2192
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Citation Stats
Attention Stats
BUIR Usage Stats
2
views
views
10
downloads
downloads
Series
Abstract
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.