Published January 1, 2019 | Version v1
Journal article Open

Longest increasing subsequences in involutions avoiding patterns of length three

  • 1. Univ Haifa, Dept Math, Haifa, Israel
  • 2. Bilkent Univ, Fac Sci, Dept Math, Ankara, Turkey

Description

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.

Files

bib-9359b98e-b2f9-4c7a-9330-19d9f3de6f2b.txt

Files (166 Bytes)

Name Size Download all
md5:cc6573b60dcf674dfedca297a5af863a
166 Bytes Preview Download