Article ID Journal Published Year Pages File Type
421001 Discrete Applied Mathematics 2006 8 Pages PDF
Abstract

In this short note we prove a concentration result for the length of the longest increasing subsequence (LIS) of a randomly and uniformly chosen involution of {1,…,s}{1,…,s}.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
A concentration bound for the longest increasing subsequence of a randomly chosen involution
Authors
,