Toufik MANSOUR, Gökhan YILDIRIM

99117

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,

Turkish Journal of Mathematics-Cover

ISSN: 1300-0098
Yayın Aralığı: 6
Yayıncı: TÜBİTAK

Arşiv

Sayıdaki Diğer Makaleler

Arzu AKGÜL, Fethiye Müge SAKAR

Huanyin CHEN, Tuğçe ÇALCI

Some permutations and complete permutation polynomials over finite fields

Pınar ONGAN, Burcu GÜLMEZ TEMÜR

On a class of nonself-adjoint multidimensional periodic Schrödinger operators

Pedro A. GARCIA-SANCHEZ, İgnacio OJEDA

On congruence equations arising from suborbital graphs

Bahadır Özgür GÜLER, Murat BEŞENK, Serkan KADER

Categorified groupoid-sets and their Burnside ring

Laiachi EL KAOUTIT, Leonardo SPINOSA

Ebru YİĞİT, Gonca AYIK, Hayrullah AYIK

Hesam MAHZOON, Rahim KARGAR, Janusz SOKOL