OpenAlex
The longest increasing subsequence in a random permutation and a unitary random matrix model
Work
Year: 1998
Type: article
Abstract: If L N is the expected length of the longest increasing subsequence in a random permutation, thenWe give a new proof of this result using a connection with a certain unitary random matrix model.The as... more
Cites: 20
Cited by: 140
Related to: 10
FWCI: 12.32
Citation percentile (by year/subfield): 97.48
Open Access status: bronze