Show simple item record

dc.contributor.authorMansour, T.en_US
dc.contributor.authorYıldırım, Gökhanen_US
dc.date.accessioned2020-02-24T06:43:19Z
dc.date.available2020-02-24T06:43:19Z
dc.date.issued2019-07
dc.identifier.issn1300-0098
dc.identifier.urihttp://hdl.handle.net/11693/53475
dc.description.abstractWe 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.en_US
dc.language.isoEnglishen_US
dc.source.titleTurkish Journal of Mathematicsen_US
dc.relation.isversionofhttps://dx.doi.org/10.3906/mat-1901-86en_US
dc.subjectPattern-avoidanceen_US
dc.subjectInvolutionsen_US
dc.subjectLongest increasing subsequencesen_US
dc.subjectChebyshev polynomialsen_US
dc.subjectGenerating functionsen_US
dc.titleLongest increasing subsequences in involutions avoiding patterns of length threeen_US
dc.typeArticleen_US
dc.departmentDepartment of Mathematicsen_US
dc.citation.spage2183en_US
dc.citation.epage2192en_US
dc.citation.volumeNumber43en_US
dc.citation.issueNumber5en_US
dc.identifier.doi10.3906/mat-1901-86en_US
dc.publisherTÜBİTAKen_US
dc.contributor.bilkentauthorYıldırım, Gökhan


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record