Longest increasing subsequences in involutions avoiding patterns of length three
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.
Keywords:
Pattern-avoidance, involutions, longest increasing subsequences Chebyshev polynomials, generating functions,
- ISSN: 1300-0098
- Yayın Aralığı: Yılda 6 Sayı
- Yayıncı: TÜBİTAK
Sayıdaki Diğer Makaleler
Fekete–Szegö problem for a general subclass of analytic functions
Ebru YİĞİT, Gonca AYIK, Hayrullah AYIK
Elif UYANIK, Murat Hayrettin YURDAKUL
Elvan AKIN, Taher S HASSAN, Özkan ÖZTÜRK, İsmail Uğur TİRYAKİ
Tuba Taş ADIYAMAN, Zeynep ÖZKURT
Zahide Ok BAYRAKDAR, Tuna BAYRAKDAR