A concentration bound for the longest increasing subsequence of a randomly chosen involution

  • Authors:

  • Marcos Kiwi

  • Affiliations:

  • Departamento de Ingeniería Matemática y Centro de Modelamiento Matemático, Universidad de Chile, Santiago, Chile

  • Venue:
  • Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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