The longest increasing subsequence in a random permutation and a unitary random matrix model (Q1128265): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.4310/MRL.1998.v5.n1.a6 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4310/mrl.1998.v5.n1.a6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083884937 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4310/MRL.1998.V5.N1.A6 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:38, 10 December 2024

scientific article
Language Label Description Also known as
English
The longest increasing subsequence in a random permutation and a unitary random matrix model
scientific article

    Statements

    The longest increasing subsequence in a random permutation and a unitary random matrix model (English)
    0 references
    0 references
    17 October 1999
    0 references
    Let \(S_N\) be the group of all permutations of \(\{1, 2, \dots , N\}\). The main results of the paper are two theorems. Theorem 1. If \(F_N(n)\) is the longest increasing subsequence in a random permutation from \(S_N\), then \[ \lim_{N\to \infty} F_N(x\sqrt{N})=\begin{cases} 0,&\text{if } 0\leq x<2,\\ 1, &\text{if } x>2.\end{cases} \] Theorem 2. The expexted length \(L_N\) of the longest increasing subsequence in a random permutation in \(S_N\) satisfies \(\lim_{N\to \infty} L_N/\sqrt{N}= 2.\) A new proof of Theorem 2 based on analytic tools from the theory of random matrices is given.
    0 references
    random permutation
    0 references
    longest increasing subsequence
    0 references
    random matrices
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references