•  
  •  
 

Turkish Journal of Mathematics

DOI

10.3906/mat-1901-86

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.

First Page

2183

Last Page

2192

Included in

Mathematics Commons

Share

COinS