The longest increasing subsequence in involutions avoiding 3412 and another pattern

2020/01/27 by Toufik Mansour, Mansour, Toufik, Reza Rastegar +5
Computer Science · Mathematics · #05A16 #Advanced Combinatorial Mathematics #Algorithms and Data Compression #Combinatorics (math.CO) #FOS: Mathematics #Primary 05A05 #Secondary 05A15 #Stochastic processes and statistical mechanics

paper · pdf · doi:10.48550/arxiv.2001.10030

openalex publication_date 2020/01/27 · openalex created_date 2022/07/26 · openalex updated_date 2026/07/28

Abstract

In this note, we study the mean length of the longest increasing subsequence of a uniformly sampled involution that avoids the pattern 3412 and another pattern.

Related

• Pattern avoiding permutations and involutions with a unique longest increasing subsequence
• A mean identity for longest increasing subsequence problems
• On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation
• On increasing subsequences of iid samples
• Asymptotic expansions relating to the lengths of longest monotone subsequences of involutions