Longest increasing subsequences in involutions avoiding patterns of length three

Date

2019-07

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
2
views
12
downloads

Citation Stats

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.

Source Title

Turkish Journal of Mathematics

Publisher

TÜBİTAK

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)

Language

English