The longest increasing subsequence in involutions avoiding 3412 and another pattern
Open Access
- 1 December 2022
- journal article
- research article
- Published by Walter de Gruyter GmbH in Pure Mathematics and Applications
- Vol. 30 (4) , 11-21
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.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Longest increasing subsequences in involutions avoiding patterns of length threeTURKISH JOURNAL OF MATHEMATICS, 2019
- The Surprising Mathematics of Longest Increasing Subsequences2014
- Patterns in Permutations and Words2011
- A survey of alternating permutations2010
- Increasing and decreasing subsequences and their variants2007
- A concentration bound for the longest increasing subsequence of a randomly chosen involutionDiscrete Applied Mathematics, 2006
- Bivariate generating functions for involutions restricted by 3412Advances in Applied Mathematics, 2006
- Restricted 3412-avoiding involutions, continued fractions, and Chebyshev polynomialsAdvances in Applied Mathematics, 2004
- On the diagram of 132-avoiding permutationsEuropean Journal of Combinatorics, 2003
- Longest Increasing Subsequences in Pattern-Restricted PermutationsThe Electronic Journal of Combinatorics, 2002