Longest increasing subsequences in involutions avoiding patterns of length three

Toufik Mansour; Gökhan Yildirim

doi:10.3906/mat-1901-86

Longest increasing subsequences in involutions avoiding patterns of length three

Toufik Mansour, Gökhan Yildirim

Department of Mathematics

University of Haifa

Research output: Contribution to journal › Article › peer-review

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.

Original language	American English
Pages (from-to)	2183-2192
Number of pages	10
Journal	Turkish Journal of Mathematics
Volume	43
Issue number	5
DOIs	https://doi.org/10.3906/mat-1901-86
State	Published - 2019

Keywords

Chebyshev polynomials
Generating functions
Involutions
Longest increasing subsequences
Pattern-avoidance

All Science Journal Classification (ASJC) codes

General Mathematics

Access to Document

10.3906/mat-1901-86

Cite this

@article{8622d21d70dc485ebef7653902943226,

title = "Longest increasing subsequences in involutions avoiding patterns of length three",

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.",

keywords = "Chebyshev polynomials, Generating functions, Involutions, Longest increasing subsequences, Pattern-avoidance",

author = "Toufik Mansour and G{\"o}khan Yildirim",

note = "Publisher Copyright: {\textcopyright} 2019 T{\"u}bitak.",

year = "2019",

doi = "10.3906/mat-1901-86",

language = "American English",

volume = "43",

pages = "2183--2192",

journal = "Turkish Journal of Mathematics",

issn = "1300-0098",

publisher = "TUBITAK",

number = "5",

}

TY - JOUR

T1 - Longest increasing subsequences in involutions avoiding patterns of length three

AU - Mansour, Toufik

AU - Yildirim, Gökhan

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

KW - Chebyshev polynomials

KW - Generating functions

KW - Involutions

KW - Longest increasing subsequences

KW - Pattern-avoidance

UR - http://www.scopus.com/inward/record.url?scp=85073146310&partnerID=8YFLogxK

U2 - 10.3906/mat-1901-86

DO - 10.3906/mat-1901-86

M3 - Article

SN - 1300-0098

VL - 43

SP - 2183

EP - 2192

JO - Turkish Journal of Mathematics

JF - Turkish Journal of Mathematics

IS - 5

ER -

Longest increasing subsequences in involutions avoiding patterns of length three

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this