Hostname: page-component-6766d58669-nf276 Total loading time: 0 Render date: 2026-05-20T20:21:26.701Z Has data issue: false hasContentIssue false

Asymptotic expansions relating to the distribution of the length of longest increasing subsequences

Published online by Cambridge University Press:  15 March 2024

Folkmar Bornemann*
Affiliation:
Technical University of Munich, Department of Mathematics, 80290 Munich, Germany; E-mail: bornemann@tum.de

Abstract

We study the distribution of the length of longest increasing subsequences in random permutations of n integers as n grows large and establish an asymptotic expansion in powers of $n^{-1/3}$. Whilst the limit law was already shown by Baik, Deift and Johansson to be the GUE Tracy–Widom distribution F, we find explicit analytic expressions of the first few finite-size correction terms as linear combinations of higher order derivatives of F with rational polynomial coefficients. Our proof replaces Johansson’s de-Poissonization, which is based on monotonicity as a Tauberian condition, by analytic de-Poissonization of Jacquet and Szpankowski, which is based on growth conditions in the complex plane; it is subject to a tameness hypothesis concerning complex zeros of the analytically continued Poissonized length distribution. In a preparatory step an expansion of the hard-to-soft edge transition law of LUE is studied, which is lifted to an expansion of the Poissonized length distribution for large intensities. Finally, expansions of Stirling-type approximations and of the expected value and variance of the length distribution are given.

Information

Type
Probability
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2024. Published by Cambridge University Press
Figure 0

Figure 1 Plots of $F_{1}(t)$ (left panel) and $F_{2}(t)$ (middle panel) as in (3.4a/b). The right panel shows $F_{3}(t)$ as in (3.4c) (black solid line) with the approximations (3.5) for $\nu =100$ (red dotted line) and $\nu =800$ (green dashed line): the close agreement validates the functional forms displayed in (3.4). Details about the numerical method can be found in [14, 15, 19, 20].

Figure 1

Figure 2 Plots of $F_{1}^P(t)$ (left panel) and $F_{2}^P(t)$ (middle panel) as in (4.4a/b). The right panel shows $F_3^P(t)$ as in (4.4c) (black solid line) with the approximations (4.3) for $r=250$ (red dotted line) and $r=2000$ (green dashed line); the parameter $\nu $ has been varied such that $t_\nu (r)$ covers the range of t on display. Note that the functions $F_{j}^P(t)$ ($j=1,2,3$) are about two orders of magnitude smaller in scale than their counterparts in Figure 1.

Figure 2

Figure 3 Plots of $F_{1}^D(t)$ (left panel), $F_{2}^D(t)$ (middle panel) as in (5.8); both agree with the numerical prediction of their graphical form given in the left panels of [19, Figs. 4/6]. The right panel shows $F_3^D(t)$ as in (5.8) (black solid line) with the approximations (5.7) for $n=250$ (red $+$), $n=500$ (green $\circ $) and $n=1000$ (blue $\bullet $); the integer l has been varied such that $t_l(n)$ spreads over the range of t displayed here. Evaluation of (5.7) uses the table of exact values of ${\mathbb P}(L_n\leqslant l)$ up to $n=1000$ that was compiled in [19].

Figure 3

Figure 4 Plots of $F_{1}^*(t)$ (left panel) and $F_{2}^*(t)$ (middle panel) as in (5.13a/b); both agree with the numerical prediction of their graphical form given in the right panels of [19, Figs. 4/6]. The right panel shows $F_3^*$ as in (5.13c) (black solid line) with the approximations (5.12) for $n=250$ (red $+$), $n=500$ (green $\circ $) and $n=1000$ (blue $\bullet $); the integer l has been varied such that $t_{l-1/2}(n)$ spreads over the range of t displayed here. Evaluation of (5.12) uses the table of exact values of ${\mathbb P}(L_n= l)$ up to $n=1000$ that was compiled in [19].

Figure 4

Figure 5 The exact discrete length distribution ${\mathbb P}(L_{n}=l)$ (blue bars centered at the integers l) vs. the asymptotic expansion (5.11) for $m=0$ (the Baik–Deift–Johansson limit, dotted line) and for $m=2$ (the limit with the first two finite-size correction terms added, solid line). Left: $n=100$; right: $n=1000$. The expansions are displayed as functions of the continuous variable $\nu $, evaluating the right-hand side of (5.11) in $t=t_{\nu -1/2}(n)$. The exact values are from the table compiled in [19]. Note that a graphically accurate continuous approximation of the discrete distribution must intersect the bars right in the middle of their top sides: this is, indeed, the case for $m=2$ (except at the left tail for $n=100$). In contrast, the uncorrected limit law ($m=0$) is noticeable inaccurate for this range of n.

Figure 5

Figure 6 Left panel: plots of $\tilde F_{2}^S(t)$ (solid line) and $\tilde F_{2}^S(t)$ (dash-dotted line) as in (6.5). The middle and right panel show the approximations of $F_{3}^S(t)$ and $\tilde F_{3}^S(t)$ in (6.12) for $n=250$ (red $+$), $n=500$ (green $\circ $) and $n=1000$ (blue $\bullet $); the integer l has been varied such that $t_l(n)$ spreads over the range of the variable t displayed here; the dotted line displays a polynomial fit to the data points of degree $30$ to help visualizing their joint graphical form. Evaluation of (6.12) uses the table of exact values of ${\mathbb P}(L_n\leqslant l)$ up to $n=1000$ that was compiled in [19].

Figure 6

Table 1 Highly accurate values of $\mu _0,\ldots ,\mu _3$ and $\nu _0,\ldots ,\nu _3$ as computed from (7.6), (7.8) based on values for $M_j$ obtained as in [19, Table 3] (cf. Prähofer’s values for $M_1,\ldots ,M_4$, published in [73, p. 70]). For the values of $\mu _4,\mu _5$ and $\nu _4,\nu _5$, see the supplementary material mentioned in Footnote 13

Figure 7

Table 2 The $33\times 8$ linear system for constructing the entry $u_{30}(s)$ in the table [73, p. 68].

Figure 8

Table 3 The $28\times 4$ linear system for representing $u_{00}(s) u_{11}(s) - u_{10}(s)^2$ as in (B.7).