Increasing subsequences and the hard-to-soft edge transition in matrix ensembles

Details Increasing subsequences and the hard-to-soft edge transition in matrix ensembles Increasing subsequences and the hard-to-soft edge transition in matrix ensembles

2002-05-05

arxiv.org/abs/math-ph/0205007v1

Physics

Mathematical Physics

LaTeX, 19 pages

Scientific paper

10.1088/0305-4470/36/12/307

Our interest is in the cumulative probabilities Pr(L(t) \le l) for the maximum length of increasing subsequences in Poissonized ensembles of random permutations, random fixed point free involutions and reversed random fixed point free involutions. It is shown that these probabilities are equal to the hard edge gap probability for matrix ensembles with unitary, orthogonal and symplectic symmetry respectively. The gap probabilities can be written as a sum over correlations for certain determinantal point processes. From these expressions a proof can be given that the limiting form of Pr(L(t) \le l) in the three cases is equal to the soft edge gap probability for matrix ensembles with unitary, orthogonal and symplectic symmetry respectively, thereby reclaiming theorems due to Baik-Deift-Johansson and Baik-Rains.

Affiliated with

Also associated with

No associations

Rating

Increasing subsequences and the hard-to-soft edge transition in matrix ensembles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Increasing subsequences and the hard-to-soft edge transition in matrix ensembles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Increasing subsequences and the hard-to-soft edge transition in matrix ensembles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-472431