Longest increasing subsequences in involutions avoiding patterns of length three

Simple item page
buir.contributor.authorYıldırım, Gökhan
dc.citation.epage2192en_US
dc.citation.issueNumber5en_US
dc.citation.spage2183en_US
dc.citation.volumeNumber43en_US
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.departmentDepartment of Mathematicsen_US
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.identifier.doi10.3906/mat-1901-86en_US
dc.identifier.eissn1303-6149
dc.identifier.issn1300-0098
dc.identifier.urihttp://hdl.handle.net/11693/53475
dc.language.isoEnglishen_US
dc.publisherTÜBİTAKen_US
dc.relation.isversionofhttps://dx.doi.org/10.3906/mat-1901-86en_US
dc.source.titleTurkish Journal of Mathematicsen_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

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Longest_increasing_subsequences_in_involutions_avoiding_patterns_of_length_three.pdf
Size:
159.4 KB
Format:
Adobe Portable Document Format
Description:
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Scholarly Publications - Mathematics