Skip to main content
Springer logoLink to Springer
. 2023 Mar 31;388(4):3529–3587. doi: 10.1007/s00208-023-02603-z

Large gap asymptotics on annuli in the random normal matrix model

Christophe Charlier 1,
PMCID: PMC10960786  PMID: 38529402

Abstract

We consider a two-dimensional determinantal point process arising in the random normal matrix model and which is a two-parameter generalization of the complex Ginibre point process. In this paper, we prove that the probability that no points lie on any number of annuli centered at 0 satisfies large n asymptotics of the form

exp(C1n2+C2nlogn+C3n+C4n+C5logn+C6+Fn+O(n-112)),

where n is the number of points of the process. We determine the constants C1,,C6 explicitly, as well as the oscillatory term Fn which is of order 1. We also allow one annulus to be a disk, and one annulus to be unbounded. For the complex Ginibre point process, we improve on the best known results: (i) when the hole region is a disk, only C1,,C4 were previously known, (ii) when the hole region is an unbounded annulus, only C1,C2,C3 were previously known, and (iii) when the hole region is a regular annulus in the bulk, only C1 was previously known. For general values of our parameters, even C1 is new. A main discovery of this work is that Fn is given in terms of the Jacobi theta function. As far as we know this is the first time this function appears in a large gap problem of a two-dimensional point process.

Mathematics Subject Classification: 41A60, 60B20, 60G55

Introduction and statement of results

Consider the probability density function

1n!Zn1j<kn|zk-zj|2j=1n|zj|2αe-n|zj|2b,b>0,α>-1, 1.1

where z1,,znC and Zn is the normalization constant. We are interested in the gap probability

Pn:=P(#{zj:|zj|[r1,r2][r3,r4][r2g-1,r2g]}=0), 1.2

where 0r1<r2<<r2g+. Thus Pn is the probability that no points lie on g annuli centered at 0 and whose radii are given by r1,,r2g. One annulus is a disk if r1=0, and one annulus is unbounded if r2g=+. In this paper we obtain the large n asymptotics of Pn, up to and including the term of order 1.

The particular case b=1 and α=0 of (1.1) is known as the complex Ginibre point process [40] (or simply Ginibre process, for short) and is the most well-studied two-dimensional determinantal point process of the theory of random matrices. It describes the distribution of the eigenvalues of an n×n random matrix whose entries are independent complex centered Gaussian random variables with variance 1n. For general values of b>0 and α>-1, (1.1) is the joint eigenvalue density of a normal matrix M taken with respect to the probability measure [58]

1Zn|det(M)|2αe-ntr((MM)b)dM. 1.3

Here dM denotes the measure induced by the flat Euclidian metric of Cn×n on the set of normal n×n matrices (see e.g. [20, 32] for details), M is the conjugate transpose of M, “tr" denotes the trace, and Zn is the normalization constant.

The limiting mean density (with respect to d2z) as n+ of the points z1,,zn is given by [17, 67]

b2π|z|2b-2, 1.4

and is supported on the disk centered at 0 and of radius b-12b. In particular, for b=1, the limiting density is uniform over the unit disk; this is a well-known result of Ginibre [40]. Since the points accumulate on a compact set as n+, this means that for large n, Pn is the probability of a rare event, namely that there are g “large gaps/holes” in the form of annuli.

The probability to observe a hole on a disk centered at 0 and of radius r<1 in the Ginibre process was first studied by Forrester, who obtained [37, eq. (27)]

Pn=exp(C1n2+C2nlogn+C3n+C4n+o(n)),asn+, 1.5

where

C1=-r44,C2=-r22,C3=r2(1-log(r2π)),C4=2r{-0log(12erfc(y))dy+0+[log(12erfc(y))+y2+logy+log(2π)]dy},

and erfc is the complementary error function defined by

erfc(z)=2πze-t2dt. 1.6

The constant C1 was also given independently by Jancovici, Lebowitz and Manificat in [48, Eq. (2.7)]. As noticed in [37, Eq. (13)], C1 and C2 also follow from the asymptotic expansion obtained in an equivalent problem considered in the earlier work [44]. The constants C1,C2,C3 have also been obtained in the more recent work [4] using a different method; see also [52, Eq. (49)] for another derivation of C1. Although Forrester’s result (1.5) is 30 years old, as far as we know it is the most precise result available in the literature prior to this work.

When the hole region is an unbounded annulus centered at 0 and of inner radius r<1, the following third order asymptotics for Pn were obtained by Cunden, Mezzadri and Vivo in [23, Eq. (51)] for the Ginibre process:

Pn=exp(C1n2+C2nlogn+C3n+o(n)),asn+, 1.7

where C1=r44-r2+34+logr, C2=r2-12, C3=(1-r2)(1-log2π(1-r2)r).

Hole probabilities of more general domains have been considered in [2] for the Ginibre process. In particular, for a large class of open sets U lying in the unit disk, Adhikari and Reddy in [1] proved that

P(#{zj:zjU}=0)=exp(C1n2+o(n2)),asn+,

where the constant C1=C1(U) is given in terms of a certain equilibrium measure related to a problem of potential theory. When U is either a disk, an annulus, an ellipse, a cardioid, an equilateral triangle or a half-disk, C1 has been computed explicitly. Some of these results have then been generalized for a wide class of point processes by Adhikari in [1]. For the point process (1.1) (with arbitrary b>0 but α=0), he obtained

P(#{zj:|zj|[0,r]}=0)=exp(-br4b4n2+o(n2)),P(#{zj:|zj|[r1,r2]}=0)=exp(-(b4(r24b-r14b)-(r22b-r12b)24log(r2r1))n2+o(n2)), 1.8

as n+ with 0<r1<r2<b-12b and r(0,b-12b) fixed, see [1, Theorem 1.2 and eqs (3.5)–(3.6)].

These are the only works which we are aware of and which fall exactly in our setting. There are however several other works that fall just outside. In [69], Shirai considered the infinite Ginibre process, which, as its name suggests, is the limiting point process arising in the bulk of the (finite) Ginibre process. He proved, among other things, that the probability of the hole event #{zj:|zj|r}=0 behaves as exp(-r44+o(r4)) as r+ (see also [47, Proposition 7.2.1] for a different proof). This result can be seen as a less precise analogue of (1.5) for the infinite Ginibre process, and was later generalized for more general shapes of holes in [2] and then for more general point processes in [1]. Hole probabilities for product random matrices have been investigated in [3, 5]. The existing literature on large gap problems in dimension 2 goes beyond random matrix theory. The random zeros of the hyperbolic analytic function k=0+ξkzk — here the ξk’s are independent standard complex Gaussians — form a determinantal point process [63], and the associated large gap problem on a centered disk has been solved in [63, Corollary 3 (i)]. Another well studied two-dimensional point process is the random zeros of the standard Gaussian entire function. This function is given by k=0+ξkzkk!, where the ξk’s are independent standard complex Gaussians. In [70], the probability for this function to have no zeros in a centered disk of radius r was shown to be, for all sufficiently large r, bounded from below by exp(-Cr4) and bounded from above by exp(-cr4) for some positive constants c and C. This result was later improved by Nishry in [59], who proved that this probability is exp(-e24r4+o(r4)) as r+. A similar result as in [70] was obtained in [46] for a different kind of random functions with diffusing coefficients. Also, for a d-dimensional process of noninteracting fermions, it is shown in [43] that the hole probability on a spherical domain of radius r behaves as exp(-crd+1+o(r3)) as r+, and an explicit expression for c>0 is also given.

In its full generality, the random normal matrix model is associated with a given confining potential Q:CR{+} and is defined by a probability measure proportional to e-ntrQ(M)dM, where dM is as in (1.3). The random normal matrix model has been extensively studied over the years, see e.g. [20, 32] for early works, [7, 38, 53, 66] for smooth linear statistics, [9, 17, 30, 36, 65, 74] for non-smooth linear statistics, and [6, 11, 45, 54, 55] for recent investigations on planar orthogonal polynomials. Despite such progress, the problem of determining large gap asymptotics in this model has remained an outstanding problem. In this work we focus on Q(z)=|z|2b+2αnlog|z|, which is a generalization of the Gaussian potential |z|2 known as the Mittag–Leffler potential [8].

Let us now explain our results in more detail. We obtain the large n asymptotics of Pn for general values of b>0 and α>-1 in four different cases:

  1. The case 0<r1<<r2g<b-12b is stated in Theorem 1.1,

  2. The case 0<r1<<r2g-1<b-12b<r2g=+ is stated in Theorem 1.4,

  3. The case 0=r1<r2<<r2g<b-12b is stated in Theorem 1.7,

  4. The case 0=r1<r2<<r2g-1<b-12b<r2g=+ is stated in Theorem 1.9.

In other words, we cover the situations where the hole region consists of

  1. g annuli inside the disk of radius b-12b (“the bulk"),

  2. g-1 annuli in the bulk and one unbounded annulus (g1),

  3. g-1 annuli in the bulk and one disk (g1),

  4. g-2 annuli in the bulk, one unbounded annulus, and one disk (g2).

For each of these four cases, we prove that

Pn=exp(C1n2+C2nlogn+C3n+C4n+C5logn+C6+Fn+O(n-112)), 1.9

as n+, and we give explicit expressions for the constants C1,,C6.

The quantity Fn fluctuates around 0 as n increases, is of order 1, and is given in terms of the Jacobi theta function (see e.g. [61, Chapter 20])

θ(z|τ):==-+e2πizeπi2τ,zC,τi(0,+). 1.10

Note that θ(z|τ)=θ(z+1|τ) for all zC and τi(0,+); in particular Rxθ(x|τ) is periodic of period 1. To our knowledge, this is the first time the Jacobi theta function appears in a large gap problem of a two-dimensional point process.

The presence of oscillations in these asymptotics can be explained by the following heuristics. It is easy to see (using Bayes’ formula) that Pn is also equal to the partition function (= normalization constant) of the point process (1.1) conditioned on the event that #{zj:|zj|[r1,r2][r3,r4]...[r2g-1,r2g]}=0. As is typically the case in the asymptotic analysis of partition functions, an important role is played by the n-tuples (z1,,zn) which maximize the density of this conditional process. One is then left to understand the configurations of such n-tuples when n is large. To be more concrete, suppose for example that g=1 and 0<r1<r2<b-12b. Since the support of (1.4) is the centered disk of radius b-12b, it is natural to expect that the points in the conditional process will accumulate as n+ on two separated components (namely the centered disk of radius r1, and an annulus whose small radius is r2). The n-tuples (z1,,zn) maximizing the conditional density may differ from each other by the number of zj’s lying on a given component. This, in turn, produces some oscillations in the behavior of Pn. More generally, if the points in the conditional process accumulate on several components (“the multi-component regime"), then one expects some oscillations in the asymptotics of Pn. (There exist several interesting studies on conditional processes in dimension two, see e.g. [42, 60, 68].) In the setting of this paper, there are three cases for which there is no oscillation (i.e. Fn=0): when the hole region consists of only one disk (the case g=1 of Theorem 1.4), only one unbounded annulus (the case g=1 of Theorem 1.7), or one disk and one unbounded annulus (the case g=2 of Theorem 1.9). This is consistent with our above discussion since in each of these three cases the points of the conditional process will accumulate on a single connected component.

It has already been observed that the Jacobi theta function (and more generally, the Riemann theta function) typically describes the oscillations in the large gap asymptotics of one-dimensional point processes in “the multi-cut regime”. Indeed, Widom in [76] discovered that the large gap asymptotics of the one-dimensional sine process, when the gaps consist of several intervals, contain oscillations of order 1 given in terms of the solution to a Jacobi inversion problem. These oscillations were then substantially simplified by Deift, Its and Zhou in [26], who expressed them in terms of the Riemann theta function. Since then, there has been other works of this vein, see [16] for β-ensembles, [21] for partition functions of random matrix models, [35] for the sine process, [12, 13, 51] for the Airy process, and [14] for the Bessel process. In all these works, the Riemann theta function describes the fluctuations in the asymptotics, thereby suggesting that this function is a universal object related to the multi-cut regime of one-dimensional point processes. Our results show that, perhaps surprisingly, the universality of the Jacobi theta function goes beyond dimension 1.

Another function that plays a predominant role in the description of the large n asymptotics of Pn is the complementary error function (defined in (1.6)). This function already emerges in the constant C4|(b=1,α=0) of Forrester, see (1.5). Interestingly, the constant C4 of Theorem 1.1 involves the same integrals (which are independent of b and α), namely

-0log(12erfc(y))dy,0+[log(12erfc(y))+y2+logy+log(2π)]dy, 1.11

and the constants C6 of Theorems 1.4 and 1.7 involve

-0{2ylog(12erfc(y))+e-y2(1-5y2)3πerfc(y)}dy, 1.12
0+{2ylog(12erfc(y))+e-y2(1-5y2)3πerfc(y)+113y3+2ylogy+(12+2log(2π))y}dy. 1.13

Using the well-known large y asymptotics of erfc(y) [61, 7.12.1]

erfc(y)=e-y2π(1y-12y3+34y5-158y7+O(y-9)),asy+, 1.14

and erfc(-y)=2-erfc(y), it is easy to check that the integrals in (1.11), (1.12) and (1.13) are finite, as it must.

We expect that the estimate O(n-112) for the error term in (1.9) is not optimal and could be reduced to O(n-12). However, proving this is a very technical task, and we will not pursue that here. We now state our main results, and discuss our method of proof afterwards.

Fig. 1.

Fig. 1

This situation is covered by Theorem 1.1 with g=3

Theorem 1.1

(g annuli in the bulk) Let

g{1,2,},α>-1,b>0,0<r1<<r2g<b-12b

be fixed parameters. As n+, we have

Pn=exp(C1n2+C2nlogn+C3n+C4n+C5logn+C6+Fn+O(n-112)), 1.15

where

C1=k=1g{(r2k2b-r2k-12b)24log(r2kr2k-1)-b4(r2k4b-r2k-14b)},C2=-k=1gb(r2k2b-r2k-12b)2,C3=k=1g{b(r2k2b-r2k-12b)(12+logb2π)+b2(r2k2blog(r2k)-r2k-12blog(r2k-1))-(t2k-br2k-12b)log(t2k-br2k-12b)-(br2k2b-t2k)log(br2k2b-t2k)},C4=2b{-0log(12erfc(y))dy+0+[log(12erfc(y))+y2+logy+log(2π)]dy}k=12grkb,C5=0,C6=g2log(π)+k=1g{1-2b212log(r2kr2k-1)+b2r2k2bbr2k2b-t2k+b2r2k-12bt2k-br2k-12b-12loglog(r2kr2k-1)+[log(br2k2b-t2kt2k-br2k-12b)]24log(r2kr2k-1)-j=1+log(1-(r2k-1r2k)2j)},Fn=k=1glogθ(t2kn+12-α+log(br2k2b-t2kt2k-br2k-12b)2log(r2kr2k-1)|πilog(r2kr2k-1)),

θ is given by (1.10), and for k{1,,g}

t2k:=12r2k2b-r2k-12blog(r2kr2k-1)(br2k-12b,br2k2b). 1.16

Remark 1.2

By setting α=0 and g=1 in Theorem 1.1, we obtain C1=(r22b-r12b)24log(r2r1)-b4(r24b-r14b), which agrees with (1.8).

Remark 1.3

The constant C5=0 has been included in (1.15) to ease the comparison with Theorems  1.41.7 and 1.9 below.

Fig. 2.

Fig. 2

This situation is covered by Theorem 1.4 with g=3

Theorem 1.4

(g-1 annuli in the bulk and one unbounded annulus) Let

g{1,2,},α>-1,b>0,0<r1<<r2g-1<b-12b<r2g=+

be fixed parameters. As n+, we have

Pn=exp(C1n2+C2nlogn+C3n+C4n+C5logn+C6+Fn+O(n-112)), 1.17

where

C1=k=1g-1{(r2k2b-r2k-12b)24log(r2kr2k-1)-b4(r2k4b-r2k-14b)}+br2g-14b4-r2g-12b+12blog(br2g-12b)+34b,C2=-k=1g-1b(r2k2b-r2k-12b)2+br2g-12b2-12,C3=k=1g-1{b(r2k2b-r2k-12b)(12+logb2π)+b2(r2k2blog(r2k)-r2k-12blog(r2k-1))-(t2k-br2k-12b)log(t2k-br2k-12b)-(br2k2b-t2k)log(br2k2b-t2k)}-r2g-12b(α+b+12+blog(br2g-1b2π))-(1-br2g-12b)log(1-br2g-12b)+1+2α2blog(br2g-12b)+b+2α+12b+12log(b2π),C4=2b{-0log(12erfc(y))dy+0+[log(12erfc(y))+y2+logy+log(2π)]dy}k=12g-1rkb,C5=-1+2α4,C6=g-12log(π)+k=1g-1{1-2b212log(r2kr2k-1)+b2r2k2bbr2k2b-t2k+b2r2k-12bt2k-br2k-12b-12loglog(r2kr2k-1)+[log(br2k2b-t2kt2k-br2k-12b)]24log(r2kr2k-1)-j=1+log(1-(r2k-1r2k)2j)}-2α+14log(2π)-1+2α2log(1-br2g-12b)+b2r2g-12b1-br2g-12b+b+b2+6bα+6α2+6α+3b+112blog(b)+b2+6α2+6α+16log(r2g-1)+2b-0{2ylog(12erfc(y))+e-y2(1-5y2)3πerfc(y)}dy+2b0+{2ylog(12erfc(y))+e-y2(1-5y2)3πerfc(y)+113y3+2ylogy+(12+2log(2π))y}dy,Fn=k=1g-1logθ(t2kn+12-α+log(br2k2b-t2kt2k-br2k-12b)2log(r2kr2k-1)|πilog(r2kr2k-1)),

θ is given by (1.10), and t2k is given by (1.16) for k{1,,g-1}.

Remark 1.5

It is easy to check that the constants C1,C2,C3 of Theorem 1.4, when specialized to b=1, α=0 and g=1, are the same as the constants of Cunden, Mezzadri and Vivo in (1.7).

Fig. 3.

Fig. 3

This situation is covered by Theorem 1.7 with g=3

The constants C6 appearing in Theorems 1.7 and 1.9 below are notably different than in the previous two theorems, because they involve a new quantity G(b,α) which is defined by

G(b,α)=limN+[j=1NlogΓ(k+αb)-{N22blogN-3+2logb4bN2+1+2α-b2bNlogN+(log(2π)2+b-2α-12b(1+logb))N+1-3b+b2+6α-6bα+6α212blogN}], 1.18

where Γ(z)=0tz-1e-tdt is the Gamma function. Interestingly, this same object G(b,α) also appears in the large gap asymptotics at the hard edge of the Muttalib-Borodin ensemble, see [18, Theorem 1.1] (G(b,α) here corresponds to d(1b,αb-1) in [18]). It was also shown in [18] that if b is a rational, then G(b,α) can be expressed in terms of the Riemann ζ-function and Barnes’ G function, two well-known special functions (see e.g. [61, Chapters 5 and 25]). More precisely, we have the following.

Proposition 1.6

(Taken from [18, Proposition 1.4]) If b=n1n2 for some positive integers n1,n2, then G(b,α) is explicitly given by

G(b,α)=n1n2ζ(-1)+b(n2-n1)+2n1α4blog(2π)-1-3b+b2+6α-6bα+6α212blogn1-j=1n2k=1n1logG(j+αb-1n2+kn1).

We now state our next theorem.

Theorem 1.7

(g-1 annuli in the bulk and one disk)

Let

g{1,2,},α>-1,b>0,0=r1<r2<<r2g<b-12b

be fixed parameters. As n+, we have

Pn=exp(C1n2+C2nlogn+C3n+C4n+C5logn+C6+Fn+O(n-112)), 19

where

C1=k=2g{(r2k2b-r2k-12b)24log(r2kr2k-1)-b4(r2k4b-r2k-14b)}-br24b4,C2=-k=2gb(r2k2b-r2k-12b)2-br22b2,C3=k=2g{b(r2k2b-r2k-12b)(12+logb2π)+b2(r2k2blog(r2k)-r2k-12blog(r2k-1))-(t2k-br2k-12b)log(t2k-br2k-12b)-(br2k2b-t2k)log(br2k2b-t2k)}+r22b(α+12+b2(1-2log(r2b2π))),C4=2b{-0log(12erfc(y))dy+0+[log(12erfc(y))+y2+logy+log(2π)]dy}k=22grkb,C5=-1-6b+b2+6α+6α2-12αb12b,C6=g-12log(π)+k=2g{1-2b212log(r2kr2k-1)+b2r2k2bbr2k2b-t2k+b2r2k-12bt2k-br2k-12b-12loglog(r2kr2k-1)+[log(br2k2b-t2kt2k-br2k-12b)]24log(r2kr2k-1)-j=1+log(1-(r2k-1r2k)2j)}+2α+14log(2π)+(b+2αb-α-α2-1+b26)logr2-b2-6bα+6α2+6α-3b+112blog(b)-G(b,α)-2b-0{2ylog(12erfc(y))+e-y2(1-5y2)3πerfc(y)}dy-2b0+{2ylog(12erfc(y))+e-y2(1-5y2)3πerfc(y)+113y3+2ylogy+(12+2log(2π))y}dy,Fn=k=2glogθ(t2kn+12-α+log(br2k2b-t2kt2k-br2k-12b)2log(r2kr2k-1)|πilog(r2kr2k-1)),

θ is given by (1.10), t2k is given by (1.16) for k{2,,g}, and G(b,α) is given by (1.18).

Remark 1.8

It is easy to check that the constants C1,C2,C3,C4 of Theorem 1.7, when specialized to b=1, α=0 and g=1, are the same as Forrester’s constants in (1.5).

Fig. 4.

Fig. 4

This situation is covered by Theorem 1.9 with g=3

Theorem 1.9

(g-2 annuli in the bulk, one unbounded annulus, and one disk) Let

g{2,3,},α>-1,b>0,0=r1<r2<<r2g-1<b-12b<r2g=+

be fixed parameters. As n+, we have

Pn=exp(C1n2+C2nlogn+C3n+C4n+C5logn+C6+Fn+O(n-112)), 1.19

where

C1=k=2g-1{(r2k2b-r2k-12b)24log(r2kr2k-1)-b4(r2k4b-r2k-14b)}+br2g-14b4-r2g-12b+12blog(br2g-12b)+34b-br24b4,C2=-k=2g-1b(r2k2b-r2k-12b)2+br2g-12b2-12-br22b2,C3=k=2g-1{b(r2k2b-r2k-12b)(12+logb2π)+b2(r2k2blog(r2k)-r2k-12blog(r2k-1))-(t2k-br2k-12b)log(t2k-br2k-12b)-(br2k2b-t2k)log(br2k2b-t2k)}-r2g-12b(α+b+12+blog(br2g-1b2π))-(1-br2g-12b)log(1-br2g-12b)+1+2α2blog(br2g-12b)+b+2α+12b+12log(b2π)+r22b(α+12+b2(1-2log(r2b2π))),C4=2b{-0log(12erfc(y))dy+0+[log(12erfc(y))+y2+logy+log(2π)]dy}k=22g-1rkb,C5=-1-3b+b2+6α+6α2-6αb12b,C6=g-22log(π)+k=2g-1{1-2b212log(r2kr2k-1)+b2r2k2bbr2k2b-t2k+b2r2k-12bt2k-br2k-12b-12loglog(r2kr2k-1)+[log(br2k2b-t2kt2k-br2k-12b)]24log(r2kr2k-1)-j=1+log(1-(r2k-1r2k)2j)}-1+2α2log(1-br2g-12b)+b2r2g-12b1-br2g-12b+b+1+2α2log(br22b)+b2+6α2+6α+16log(r2g-1r2)-G(b,α),Fn=k=2g-1logθ(t2kn+12-α+log(br2k2b-t2kt2k-br2k-12b)2log(r2kr2k-1)|πilog(r2kr2k-1)),

θ is given by (1.10), t2k is given by (1.16) for k{2,,g-1}, and G(b,α) is given by (1.18).

Method of proof. The problem of determining large gap asymptotics is a notoriously difficult problem in random matrix theory with a long history [39, 41, 50]. There have been several methods that have proven successful to solve large gap problems of one-dimensional point processes, among which: the Deift–Zhou [25] steepest descent method for Riemann–Hilbert problems [10, 18, 19, 22, 24, 2729, 49], operator theoretical methods [33, 34, 75], the “loop equations" [15, 16, 56, 57], and the Brownian carousel [31, 64, 72, 73].

Our method of proof shows similarities with the method of Forrester in [37]. It relies on the fact that (1.1) is determinantal, rotation-invariant, and combines the uniform asymptotics of the incomplete gamma function with some precise Riemann sum approximations. Our method is less robust with respect to the shape of the hole region than the one of Adhikari and Reddy [1, 2], but allows to give precise asymptotics. We also recently used this method of Riemann sum approximations in [17] to obtain precise asymptotics for the moment generating function of the disk counting statistics of (1.1). However, the problem considered here is more challenging and of a completely different nature than the one considered in [17]; most of the difficulties that we have to overcome here are not present in [17]. These differences will be discussed in more detail in Sect. 3.

Preliminaries

By definition of Zn and Pn (see (1.1) and (1.2)), we have

Zn=1n!CC1j<kn|zk-zj|2j=1n|zj|2αe-n|zj|2bd2zj, 20
Pn=1n!ZnCC1j<kn|zk-zj|2j=1nw(zj)d2zj, 1.20

where the weight w is defined by

w(z)=|z|2αe-n|z|2b0,if|z|[r1,r2][r3,r4][r2g-1,r2g],1,otherwise.

We will use the following well-known formula to rewrite Zn and Pn in terms of one-fold integrals.

Lemma 2.1

If w:C[0,+) is rotation invariant (i.e. w(z)=w(|z|)) and satisfies

Cujw(u)du<+,forallj0,

then

1n!CC1j<kn|zk-zj|2j=1nw(zj)d2zj=(2π)nj=0n-10+u2j+1w(u)du.

The proof of Lemma 2.1 is standard and we omit it, see e.g. [74, 17, Lemma 1.9] and the references therein. The argument relies on the fact that the point process on z1,,znC with density proportional to 1j<kn|zk-zj|2j=1nw(zj) is determinantal and rotation-invariant.

Using twice Lemma 2.1, with w(z)=|z|2αe-n|z|2b and w(x)=w(x), we obtain

Zn=n-n22bn-1+2α2bnπnbnj=1nΓ(j+αb), 2.1
ZnPn=(2π)nj=0n-1=0gr22+1u2j+1+2αe-nu2bdu=n-n22bn-1+2α2bnπnbnj=1n=0gγj+αb,nr2+12b-γj+αb,nr22b, 2.2

where r0:=0, r2g+1:=+, we recall that Γ(a)=0ta-1e-tdt is the Gamma function, and γ(a,z) is the incomplete gamma function

γ(a,z)=0zta-1e-tdt.

By combining (2.3) with (2.4), we obtain

logPn=j=1nlog(=12g+1(-1)+1γ(j+αb,nr2b)Γ(j+αb)). 2.3

This exact formula is the starting point of the proofs of our four theorems. To analyze the large n behavior of logPn, we will use the asymptotics of γ(a,z) in various regimes of the parameters a and z. These asymptotics are available in the literature and are summarized in the following lemmas.

Lemma 2.2

[61, formula 8.11.2]. Let a>0 be fixed. As z+,

γ(a,z)=Γ(a)+O(e-z2).

Lemma 2.3

[71, Section 11.2.4]. The following hold:

γ(a,z)Γ(a)=12erfc(-ηa/2)-Ra(η),Ra(η):=e-12aη22πi-e-12au2g(u)du, 2.4

where erfc is given by (1.6), g(u):=dtdu1λ-t+1u+iη,

λ=za,η=(λ-1)2(λ-1-lnλ)(λ-1)2,u=-i(t-1)2(t-1-lnt)(t-1)2, 2.5

and the principal branch is used for the roots. In particular, ηR for λ>0, while tL:={θsinθeiθ:-π<θ<π} for uR. Moreover, as a+, uniformly for z[0,),

Ra(η)e-12aη22πaj=0cj(η)aj. 2.6

All coefficients cj(η) are bounded functions of ηR (i.e. bounded for λ(0,)), and

c0(η)=1λ-1-1η,c1(η)=1η3-1(λ-1)3-1(λ-1)2-112(λ-1). 2.7

By combining Lemma 2.3 with the large z asymptotics of erfc(z) given in (1.14), we get the following.

Lemma 2.4

  • (i)
    Let δ>0 be fixed. As a+, uniformly for λ1+δ,
    γ(a,λa)Γ(a)=1+e-aη222π(-1λ-11a+1+10λ+λ212(λ-1)31a3/2+O(a-5/2)),
    where η is as in (2.7) (in particular e-aη22=ea-zzaaa).
  • (ii)
    As a+, uniformly for λ in compact subsets of (0, 1),
    γ(a,λa)Γ(a)=e-aη222π(-1λ-11a+1+10λ+λ212(λ-1)31a3/2+O(a-5/2)),
    where η is as in (2.7) (in particular e-aη22=ea-zzaaa).

Proof of Theorem 1.1: the case r1>0 and r2g<b-12b

In this paper, log always denotes the principal branch of the logarithm. Recall from (2.5) that

logPn=j=1nlog(=12g+1(-1)+1γ(j+αb,nr2b)Γ(j+αb)). 2.8

To analyze asymptotically as n+ the sum on the right-hand side, we will split it into several smaller sums, which need to be handled in different ways.

For j=1,,n and =1,,2g, we define

aj:=j+αb,λj,:=bnr2bj+α,ηj,:=(λj,-1)2(λj,-1-lnλj,)(λj,-1)2. 2.9

Let M be a large integer independent of n, and let ϵ>0 be a small constant independent of n. Define

j,-:=bnr2b1+ϵ-α,j,+:=bnr2b1-ϵ-α,=1,,2g,j0,-:=1,j0,+:=M,j2g+1,-:=n+1, 3.1

where x denotes the smallest integer x, and x denotes the largest integer x. We take ϵ sufficiently small such that

br2b1-ϵ<br+12b1+ϵ,forall{1,,2g-1},andbr2g2b1-ϵ<1. 3.2

A natural quantity that will appear in our analysis is

t2k:=12r2k2b-r2k-12blog(r2kr2k-1)=br2k2b-br2k-12blog(r2k2b)-log(r2k-12b),k=1,,g. 3.3

It is easy to check that for each k{1,,g}, t2k lies in the interval (br2k-12b,br2k2b). For reasons that will be apparent below, we also choose ϵ>0 sufficiently small such that

br2k-12b1-ϵ<t2k<br2k2b1+ϵ,k=1,,g. 3.4

Using (2.4) and (3.4), we split the j-sum in (3.1) into 4g+2 sums

logPn=S0+k=12g(S2k-1+S2k)+S4g+1, 3.5

with

S0=j=1Mlog(=12g+1(-1)+1γ(j+αb,nr2b)Γ(j+αb)), 3.6
S2k-1=j=jk-1,++1jk,--1log(=12g+1(-1)+1γ(j+αb,nr2b)Γ(j+αb)),k=1,,2g+1, 3.7
S2k=j=jk,-jk,+log(=12g+1(-1)+1γ(j+αb,nr2b)Γ(j+αb)),k=1,,2g. 3.8

We first show that the sums S0 and S1,S5,S9,,S4g+1 are exponentially small as n+.

Lemma 3.1

There exists c>0 such that S0=O(e-cn) as n+.

Proof

Since M is fixed, by (3.8) and Lemma 2.2, as n+ we have

S0=j=1Mlog(=12g+1(-1)+1[1+O(e-12r2bn)])=O(e-12r12bn).

Lemma 3.2

Let k{1,3,5,,2g+1}. There exists c>0 such that S2k-1=O(e-cn) as n+.

Proof

The proof is similar to [17, Lemma 2.2]. Let us consider first the case k{3,5,,2g+1}. By (3.2) and (3.3), for j{jk-1,++1,,jk,--1} and {1,,2g} we have

(1+ϵ)r2brk2b+1+ϵbnλj,(1-ϵ)r2brk-12b-1-ϵbn. 3.9

For k=2g+1, the left-hand side in (3.11) must be replaced by r2bb-1+αbn. Since ϵ>0 is fixed, λj, remains in a compact subset of (0, 1) as n+ with j{jk-1,++1,,jk,--1} and {1,,k-1}, while λj, remains in a compact subset of (1,) as n+ with j{jk-1,++1,,jk,--1} and {k,,2g}. Thus we can use Lemma  2.4 (i)–(ii) with a and λ replaced by aj and λj, respectively, where j{jk-1,++1,,jk,--1} and {1,,2g}. This yields

S2k-1=j=jk-1,++1jk,--1log(=1k-1(-1)+1O(e-ajηj,22)+=k2g(-1)+1(1+O(e-ajηj,22))+1), 3.10

as n+. By (3.2) and (3.11), there exist constants {cj,cj}j=13 such that c1najc1n, 0<c1, 0<c2|λj,-1|c2 and 0<c3ηj,2c3 hold for all large enough n, all j{jk-1,++1,,jk,--1} and all {1,,2g}. Thus S2k-1=O(e-c1c34n) as n+, which finishes the proof for k=3,5,,2g+1. Let us now consider the case k=1, which requires a slightly different argument. We infer from Lemma 2.4 (i) that for any ϵ>0 there exist A=A(ϵ),C=C(ϵ)>0 such that |γ(a,λa)Γ(a)-1|Ce-aη22 for all aA and all λ[1+ϵ,+], where η is given by (2.7). Let us choose ϵ=ϵ2 and M sufficiently large such that aj=j+αbA(ϵ2) holds for all j{M+1,,j1,--1}. In a similar way as in (3.12), we obtain

S1=j=M+1j1,--1log(=12g(-1)+1(1+O(e-ajηj,22))+1),asn+.

For each {1,2,,2g}, ajηj,2 is decreasing as j increases from M+1 to j1,--1, and therefore

ajηj,22aj1,--1ηj1,--1,22cn,forallj{M+1,,j1,--1},{1,,2g},

for a small enough constant c>0. It follows that S1=O(e-cn) as n+, which finishes the proof for k=1.

Now, we analyze S3,S7,,S4g-1. As it turns out, these are the sums responsible for the oscillations in the large n asymptotics of logPn. There is no such sums in [17], so the analysis done here for S3,S7,,S4g-1 is new.

The next lemma makes apparent the terms that are not exponentially small.

Lemma 3.3

Let k{2,4,,2g}. There exists c>0 such that

S2k-1=S2k-1(1)+S2k-1(2)+O(e-cn),asn+, 3.11

where

S2k-1(1)=j=jk-1,++1jk,log(1+γ(j+αb,nrk-12b)Γ(j+αb)-γ(j+αb,nrk2b)Γ(j+αb)),S2k-1(2)=j=jk,+1jk,--1log(1+γ(j+αb,nrk-12b)Γ(j+αb)-γ(j+αb,nrk2b)Γ(j+αb)),

and

jk,:=ntk-α, 3.12

where tk is defined in (3.5).

Proof

Note that (3.11) also holds for k{2,4,,2g}, which implies in particular that for each {1,,2g}, |λj,-1| remains bounded away from 0 as n+ and simultaneously j{jk-1,++1,,jk,--1}. Thus we can use Lemma 2.4 (i)–(ii) with a and λ replaced by aj and λj, respectively, where j{jk-1,++1,,jk,--1} and {1,,2g}, and this gives

γ(j+αb,nr2b)Γ(j+αb)=e-ajηj,222π(11-λj,1aj+O(n-3/2)),{1,,k-1},γ(j+αb,nr2b)Γ(j+αb)=1+e-ajηj,222π(11-λj,1aj+O(n-3/2)),{k,,2g},

as n+ uniformly for j{jk-1,++1,,jk,--1}. In a similar way as (3.11), we derive

(1+ϵ)r2b-r-12brk2b+1+ϵbnλj,-λj,-1(1-ϵ)r2b-r-12brk-12b-1-ϵbn,

for all j{jk-1,++1,,jk,--1} and {2,,2g}, which implies by (3.2) that

min{ηj,2-ηj,1,ηj,3-ηj,2,,ηj,k-1-ηj,k-2,0-ηj,k-1,ηj,k-0,ηj,k+1-ηj,k,,ηj,2g-ηj,2g-1}

is positive and remains bounded away from 0 for all n sufficiently large and for all j{jk-1,++1,,jk,--1}. In particular,

1+=12g(-1)+1γ(j+αb,nr2b)Γ(j+αb)=(1+γ(j+αb,nrk-12b)Γ(j+αb)-γ(j+αb,nrk2b)Γ(j+αb))(1+O(e-cn))

as n+ uniformly for j{jk-1,++1,,jk,--1}, which implies

S2k-1=j=jk-1,++1jk,--1log(1+γ(j+αb,nrk-12b)Γ(j+αb)-γ(j+αb,nrk2b)Γ(j+αb))+O(e-cn),asn+, 3.13

and the claim follows after splitting the above sum into two parts.

The reason why we have split the sum in (3.15) into two parts (denoted S2k-1(1) and S2k-1(2)) around the value j=jk, is the following. As can be seen from the proof of Lemma 3.3, we have

γ(j+αb,nrk-12b)Γ(j+αb)=e-ajηj,k-1222π(11-λj,k-11aj+O(n-3/2)), 3.14
1-γ(j+αb,nrk2b)Γ(j+αb)=e-ajηj,k222π(1λj,k-11aj+O(n-3/2)), 3.15

as n+ uniformly for j{jk-1,++1,,jk,--1}. The two above right-hand sides are exponentially small. To analyze their sum, it is relevant to know whether ηj,k-12ηj,k2 or ηj,k-12<ηj,k2 holds. It is easy to check that the function jηj,k2-ηj,k-12, when viewed as an analytic function of j[jk-1,++1,jk,--1], has a simple zero at j=jk,. In fact, we have

aj(ηj,k2-ηj,k-12)2=2(jk,-j)log(rkrk-1), 3.16

which implies in particular that ηj,k2-ηj,k-12 is positive for j{jk-1,++1,,jk,} and negative for j{jk,+1,,jk,--1}. Note that jk, lies well within the interval [jk-1,++1,jk,--1] for all sufficiently large n by (3.3), (3.5) and (3.6), which implies that the number of terms in each of the sums S2k-1(1) and S2k-1(2) is of order n. When j is close to jk,, the two terms (3.16) and (3.17) are of the same order, and this will produce the oscillations in the asymptotics of logPn. We will evaluate S2k-1(1) and S2k-1(2) separately using some precise Riemann sum approximations. We first state a general lemma.

Lemma 3.4

Let A,a0, B,b0 be bounded function of n{1,2,}, such that

an:=An+a0andbn:=Bn+b0

are integers. Assume also that B-A is positive and remains bounded away from 0. Let f be a function independent of n, and which is C4([min{ann,A},max{bnn,B}]) for all n{1,2,}. Then as n+, we have

j=anbnf(jn)=nABf(x)dx+(1-2a0)f(A)+(1+2b0)f(B)2+(-1+6a0-6a02)f(A)+(1+6b0+6b02)f(B)12n+(-a0+3a02-2a03)f(A)+(b0+3b02+2b03)f(B)12n2+O(mA,n(f)+mB,n(f)n3+j=anbn-1mj,n(f)n4), 3.17

where, for a given function g continuous on [min{ann,A},max{bnn,B}],

mA,n(g):=maxx[min{ann,A},max{ann,A}]|g(x)|,mB,n(g):=maxx[min{bnn,B},max{bnn,B}]|g(x)|,

and for j{an,,bn-1}, mj,n(g):=maxx[jn,j+1n]|g(x)|.

Remark 3.5

To analyze the sums S2k-1(1) and S2k-1(2), we will use Lemma 3.4 only with A and B fixed. However, we will also deal with other sums (denoted S2k(1) and S2k(3) in Lemma 3.19 below) that require the use of Lemma 3.4 with varying A and B. So it is worth to emphasize already here that the condition “fC4([min{ann,A},max{bnn,B}]) for all n{1,2,}" allows to handle the situation where, for example, A0 as n+ and fC4((0,max{bnn,B}]) but fC4([0,max{bnn,B}]).

Proof

By Taylor’s theorem,

annbnnf(x)dx=j=anbn-1jnj+1nf(x)dx=j=anbn-1{f(jn)n+f(jn)2n2+f(jn)6n3+f(jn)24n4+jnj+1n(x-jn)424f(ξj,n(x))dx}, 3.18

for some ξj,n(x)[jn,x]. Clearly,

|jnj+1n(x-jn)424f(ξj,n(x))dx|mj,n(f)120n5.

Therefore, by isolating the sum j=anbn-1f(jn) in (3.20), we get

j=anbn-1f(jn)=nannbnnf(x)dx-j=anbn-1{f(jn)2n+f(jn)6n2+f(jn)24n3}+O(j=anbn-1mj,n(f)n4), 3.19

as n+. In the same way as (3.21), by replacing f successively by f, f and f, we also obtain

j=anbn-1f(jn)=nannbnnf(x)dx-j=anbn-1{f(jn)2n+f(jn)6n2}+O(j=anbn-1mj,n(f)n3), 3.20
j=anbn-1f(jn)=nannbnnf(x)dx-j=anbn-1f(jn)2n+O(j=anbn-1mj,n(f)n2), 3.21
j=anbn-1f(jn)=nannbnnf(x)dx+O(j=anbn-1mj,n(f)n), 3.22

as n+. After substituting (3.22)–(3.24) in (3.21), we get

j=anbnf(jn)=f(bnn)+annbnn{nf(x)-f(x)2+f(x)12n}dx+O(j=anbn-1mj,n(f)n4), 3.23

as n+. The integral on the right-hand side of (3.21) can be expanded using again Taylor’s theorem; this gives

annbnnf(x)dx=ABf(x)dx-a0f(A)n-a02f(A)2n2-a03f(A)6n3+b0f(B)n+b02f(B)2n2+b03f(B)6n3+En,

for some En satisfying |En|mA,n(f)+mB,n(f)n4. The quantities f(bnn), annbnnf(x)dx, annbnnf(x)dx can be expanded in a similar way using Taylor’s Theorem. After substituting these expressions in (3.25) and using some elementary primitives, we find the claim.

We introduce here a number of quantities that will appear in the large n asymptotics of S2k-1(1) and S2k-1(2). For k=2,4,,2g, define

θk=jk,-jk,,Ak=brk-12b1-ϵ,Bk=brk2b1+ϵ, 3.24

and for k=1,2,,2g, define

f1,k(x)=xb(1+logbrk2bx)-rk2b,f2,k(x)=(12-αb)logx+12logb-log2π+αblog(brk2b)-log|brk2b-x|, 3.25
f3,k(x)=-(b2-6bα+6α212bx+bx(x-brk2b)2+b-αbrk2b-x), 3.26
θk,+(n,ϵ)=(bnrk2b1-ϵ-α)-bnrk2b1-ϵ-α,θk,-(n,ϵ)=bnrk2b1+ϵ-α-(bnrk2b1+ϵ-α). 3.27

Lemma 3.6

Let k{2,4,,2g}. As n+, we have

S2k-1(1)=n2Akkf1,k-1(x)dx-tk-Ak2nlogn+n((α-1+θk-1,+(n,ϵ))f1,k-1(Ak)-(α+θk)f1,k-1(tk)+f1,k-1(tk)+f1,k-1(Ak)2+Akkf2,k-1(x)dx)-logn2(θk-1,+(n,ϵ)-θk)+1-6(α+θk)+6(α+θk)212(f1,k-1)(tk)-1+6(α-1+θk-1,+(n,ϵ))+6(α-1+θk-1,+(n,ϵ))212(f1,k-1)(Ak)-(α+θk)f2,k-1(tk)+(α-1+θk-1,+(n,ϵ))f2,k-1(Ak)+f2,k-1(tk)+f2,k-1(Ak)2+Akkf3,k-1(x)dx+j=0+log{1+(rk-1rk)2(j+θk)tk-brk-12bbrk2b-tk}+O((logn)2n),

where tk is given in (3.5) and f1,k-1,f2,k-1,f3,k-1,Ak,θk,θk-1,+(n,ϵ) are given in (3.26)–(3.29).

Proof

Recall from (3.11) that λj,k-1 remains in a compact subset of (0, 1) as n+ uniformly for j{jk-1,++1,,jk,--1}, and that λj,k remains in a compact subset of (1,+) as n+ uniformly for j{jk-1,++1,,jk,--1}. Hence, by Lemma 2.4 (i)–(ii), as n+ we have

S2k-1(1)=j=jk-1,++1jk,log{e-ajηj,k-1222π(11-λj,k-11aj+1+10λj,k-1+λj,k-1212(λj,k-1-1)31aj3/2+O(n-5/2))+e-ajηj,k222π(1λj,k-11aj-1+10λj,k+λj,k212(λj,k-1)31aj3/2+O(n-5/2))}.

Since the number of terms in S2k-1(1), namely #{jk-1,++1,,jk,}, is of order n as n+, the above asymptotics can be rewritten as

S2k-1(1)=j=jk-1,++1jk,log{e-ajηj,k-1222π(11-λj,k-11aj+1+10λj,k-1+λj,k-1212(λj,k-1-1)31aj3/2)+e-ajηj,k222π(1λj,k-11aj-1+10λj,k+λj,k212(λj,k-1)31aj3/2)}+O(n-1)=Sn(1)n+Sn(2)logn+Sn(3)+Sn(4)1n+S~n+O(n-1), 3.28

where

Sn(1)=j=jk-1,++1jk,{j/nb(1+logbrk-12bj/n)-rk-12b},Sn(2)=-12j=jk-1,++1jk,1,Sn(3)=j=jk-1,++1jk,{(12-αb)log(j/n)+12logb-log2π+αblog(brk-12b)-log(j/n-brk-12b)},Sn(4)=-j=jk-1,++1jk,{b2-6bα+6α212bj/n+bj/n(j/n-brk-12b)2+α-bj/n-brk-12b},S~n=j=jk-1,++1jk,log{1+e-aj(ηj,k2-ηj,k-12)2(j/n-brk-12bbrk2b-j/n+E~n)}=j=jk-1,++1jk,log(1+e-aj(ηj,k2-ηj,k-12)2j/n-brk-12bbrk2b-j/n)+j=jk-1,++1jk,log(1+e-aj(ηj,k2-ηj,k-12)2En),

where E~n=O(n-1) and En=O(n-1) as n+ uniformly for j{jk-1,++1,,jk,}. The large n asymptotics of Sn(1), Sn(2), Sn(3) and Sn(4) can be obtained using Lemma 3.4 with

an=jk-1,++1,bn=jk,,A=brk-12b1-ϵ,a0=1-α-θk-1,+(n,ϵ),B=tk,b0=-α-θk,

and with f replaced by f1,k-1, -12, f2,k-1 and f3,k-1 respectively. Thus it only remains to obtain the asymptotics of S~n. We can estimate the En-part of S~n using (3.18) as follows:

j=jk-1,++1jk,log(1+e-aj(ηj,k2-ηj,k-12)2En)=j=jk-1,++1jk,-Mlognlog(1+e-aj(ηj,k2-ηj,k-12)2En)+j=jk,-Mlogn+1jk,log(1+e-aj(ηj,k2-ηj,k-12)2En)=O(n-10)+O(lognn)=O(lognn),asn+, 3.29

where we recall that M is a large but fixed constant (independent of n). Thus we have S~n=S0+O(lognn) as n+, where

S0=j=jk-1,++1jk,log{1+e-aj(ηj,k2-ηj,k-12)2j/n-brk-12bbrk2b-j/n}. 3.30

By changing the index of summation in (3.32), and using again (3.18), we get

S0=j=0jk,-jk-1,+-1log{1+(rk-1rk)2(j+θk)-j/n-θkn+jk,n-brk-12bbrk2b+j/n+θkn-jk,n}=j=0jk,-jk-1,+-1log{1+(rk-1rk)2(j+θk)f0(j/n)}+O(lognn),asn+, 3.31

where the error term has been estimated in a similar way as in (3.31), and f0(x):=-x+tk-brk-12bbrk2b+x-tk. To estimate the remaining sum in (3.33), we split it into two parts as follows

j=0jk,-jk-1,+-1log{1+(rk-1rk)2(j+θk)f0(j/n)}=j=0Mlognlog{1+(rk-1rk)2(j+θk)f0(j/n)}+j=Mlogn+1jk,-jk-1,+-1log{1+(rk-1rk)2(j+θk)f0(j/n)}.

For the second part, we have

j=Mlogn+1jk,-jk-1,+-1log{1+(rk-1rk)2(j+θk)f0(j/n)}=O(n-10),asn+,

provided M is chosen large enough. For the first part, since f0 is analytic in a neighborhood of 0, as n+ we have

j=0Mlognlog{1+(rk-1rk)2(j+θk)f0(j/n)}=j=0Mlognlog{1+(rk-1rk)2(j+θk)(f0(0)+O(j/n))}=j=0Mlognlog{1+(rk-1rk)2(j+θk)f0(0)}+O((logn)2n)=j=0+log{1+(rk-1rk)2(j+θk)f0(0)}+O((logn)2n).

Hence, we have just shown that

S~n=j=0+log{1+(rk-1rk)2(j+θk)f0(0)}+O((logn)2n),asn+. 3.32

By substituting (3.34) and the large n asymptotics of Sn(1), Sn(2), Sn(3) and Sn(4) in (3.30), we obtain the claim.

The asymptotic analysis of the sums S2k-1(2), k=2,4,,2g is similar to that of the sums S2k-1(1), k=2,4,,2g, so we omit the proof of the following lemma.

Lemma 3.7

Let k{2,4,,2g}. As n+, we have

S2k-1(2)=n2tkkf1,k(x)dx-Bk-tk2nlogn+n((α-1+θk)f1,k(tk)-(α+1-θk,-(n,ϵ))f1,k(Bk)+f1,k(Bk)+f1,k(tk)2+tkkf2,k(x)dx)-logn2(θk,-(n,ϵ)-1+θk)+1-6(α+1-θk,-(n,ϵ))+6(α+1-θk,-(n,ϵ))212(f1,k)(Bk)-1+6(α-1+θk)+6(α-1+θk)212(f1,k)(tk)-(α+1-θk,-(n,ϵ))f2,k(Bk)+(α-1+θk)f2,k(tk)+f2,k(Bk)+f2,k(tk)2+tkkf3,k(x)dx+j=0+log{1+(rk-1rk)2(j+1-θk)brk2b-tktk-brk-12b}+O((logn)2n),

where tk is given in (3.5) and f1,k,f2,k,f3,k,Bk,θk,θk,-(n,ϵ) are given in (3.26)–(3.29).

Substituting the asymptotics of Lemmas 3.6 and 3.7 in (3.13), and using the definitions (3.26)–(3.29), after a long computation we get the following result.

Lemma 3.8

Let k{2,4,,2g}. As n+, we have

S2k-1=F1,k(ϵ)n2+F2,k(ϵ)nlogn+F3,k(n,ϵ)n+F5,k(n,ϵ)logn+F6,k(n,ϵ)+Θ~k,n+O((logn)2n)

where

F1,k(ϵ)=(rk2b-rk-12b)24log(rkrk-1)+brk-14b(1-ϵ)21-4ϵ-2log(1-ϵ)4-brk4b(1+ϵ)21+4ϵ-2log(1+ϵ)4,F2,k(ϵ)=-brk2b2(1+ϵ)+brk-12b2(1-ϵ),F3,k(n,ϵ)=rk-12b1-ϵ{2α-1+2θk-1,+(n,ϵ)2(ϵ+log(1-ϵ))-b+2α2-blogb+b2log(2π)-b2log(rk-1)-2α-b2log(1-ϵ)+bϵlog(ϵbrk-12b1-ϵ)}+rk2b1+ϵ{2α+1-2θk,-(n,ϵ)2(ϵ-log(1+ϵ))+b+2α2+blogb-b2log(2π)+b2log(rk)+2α-b2log(1+ϵ)+bϵlog(ϵbrk2b1+ϵ)}+2αtklogrk-1rk-(tk-brk-12b)log(tk-brk-12b)-(brk2b-tk)log(brk2b-tk),F5,k(n,ϵ)=1-θk-1,+(n,ϵ)-θk,-(n,ϵ)2,F6,k(n,ϵ)=1-3b+b2+6(b-1)θk,-(n,ϵ)+6(θk,-(n,ϵ))212blog(1+ϵ)-2bϵ+(1-θk-1,+(n,ϵ)-θk,-(n,ϵ))logϵ-1+3b+b2-6(1+b)θk-1,+(n,ϵ)+6(θk-1,+(n,ϵ))212blog(1-ϵ)+(12-α-θk-1,+(n,ϵ))log(rk-1b2π)+(12+α-θk,-(n,ϵ))log(rkb2π)+(1+b2+6bα6-θk+θk2)logrk-1rk+(θk-12)log(tk-brk-12bbrk2b-tk)+b2rk2bbrk2b-tk+b2rk-12btk-brk-12b,Θ~k,n=j=0+log{1+(rk-1rk)2(j+θk)tk-brk-12bbrk2b-tk}+j=0+log{1+(rk-1rk)2(j+1-θk)brk2b-tktk-brk-12b},

and where tk is given in (3.5) and θk,θk,+(n,ϵ),θk,-(n,ϵ) are given in (3.26)–(3.29).

We now turn our attention to the sums S2k, k=1,,2g. Their analysis is very different from the analysis of S2k-1. We first make apparent the terms that are not exponentially small.

Lemma 3.9

Let k{1,3,,2g-1}. There exists c>0 such that

S2k=j=jk,-jk,+log(γ(aj,nrk2b)Γ(aj))+O(e-cn),asn+. 3.33

Let k{2,4,,2g}. There exists c>0 such that

S2k=j=jk,-jk,+log(1-γ(aj,nrk2b)Γ(aj))+O(e-cn),asn+. 3.34

Proof

By definition of jk,-, jk,+ and λj, (see (3.2) and (3.3)), for j{jk,-,,jk,+} we have

(1-ϵ)r2brk2bλj,(1+ϵ)r2brk2band(1-ϵ)r2b-rk2brk2bλj,-λk,(1+ϵ)r2b-rk2brk2b. 3.35

Since ϵ>0 is fixed, the second part of (3.37) implies that for each k, λj,-λk, remains bounded away from 0 as n+ uniformly for j{jk,-,,jk,+}, and the first part of (3.37) combined with (3.4) implies that for all j{jk,-,,jk,+} we have

λj,[1-ϵ,1+ϵ],if=k,λj,(1+ϵ)r2brk2b<1-ϵ,ifk-1,λj,(1-ϵ)r2brk2b>1+ϵ,ifk+1.

Thus by (3.10) and Lemma  2.4 (i)–(ii), we have

S2k=j=jk,-jk,+log(=1k-1(-1)+1O(e-ajηj,22)+(-1)k+1γ(j+αb,nrk2b)Γ(j+αb)+=k+12g+1(-1)+1(1+O(e-ajηj,22)))=j=jk,-jk,+log((-1)k+1γ(j+αb,nrk2b)Γ(j+αb)+=k+12g+1(-1)+1)+O(e-cn),

as n+ for some constant c>0, and the claim follows.

Let M=n112. We now split the sums on the right-hand sides of (3.35) and (3.36) into three parts S2k(1), S2k(2), S2k(3), which are defined as follows

S2k(v)=j:λj,kIvlog(γ(aj,nrk2b)Γ(aj)),ifk{1,3,,2g-1},j:λj,kIvlog(1-γ(aj,nrk2b)Γ(aj)),ifk{2,4,,2g},v=1,2,3, 3.36

where

I1=[1-ϵ,1-Mn),I2=[1-Mn,1+Mn],I3=(1+Mn,1+ϵ]. 3.37

With this notation, the asymptotics (3.35) and (3.36) can be rewritten as

S2k=S2k(1)+S2k(2)+S2k(3)+O(e-cn),asn+,k=1,2,,2g. 3.38

Define also

gk,-:=bnrk2b1+Mn-α,gk,+:=bnrk2b1-Mn-α,k=1,2,,2g,

so that (formally) we can write

j:λj,kI3=j=jk,-gk,--1,j:λj,kI2=j=gk,-gk,+,j:λj,kI1=j=gk,++1jk,+. 3.39

The individual sums S2k(1), S2k(2) and S2k(3) depend on this new parameter M, but their sum S2k(1)+S2k(2)+S2k(3) does not. Note also that S2k(2) is independent of the other parameter ϵ, while S2k(1) and S2k(3) do depend on ϵ. The analysis of S2k(2) is very different from the one needed for S2k(1) and S2k(3). For S2k(1) and S2k(3), we will approximate several sums of the form jf(j/n) for some functions f, while for S2k(2), we will approximate several sums of the form jh(Mj,k) for some functions h, where Mj,k:=n(λj,k-1). As can be seen from (3.38) and (3.39), the sum S2k(2) involves the j’s for which

λj,kI2=[1-Mn,1+Mn],i.e.Mj,k[-M,M]. 3.40

Let us briefly comment on our choice of M. An essential difficulty in analyzing S2k(1), S2k(2), S2k(3) is that all the functions f and h will blow up near certain points. To analyze S2k(2), it would be simpler to define M as being, for example, of order logn, but in this case the sums jf(j/n) involve some j/n’s that are too close to the poles of f. On the other hand, if M would be of order n, then S2k(1) and S2k(3) could be analyzed in essentially the same way as the sums S2k-1(1) and S2k-1(2) of Lemmas 3.6 and 3.7 above (and if M=ϵn, then the sums S2k(1) and S2k(3) are even empty sums), but in this case the sums jh(Mj,k) involve some Mj,k’s that are too close to the poles of h. Thus we are tight up from both sides: M of order logn is not large enough, and M of order n is too large. The reason why we choose exactly M=n112 is very technical and will be discussed later.

We also mention that sums of the form jh(Mj,k) were already approximated in [17], so we will be able to recycle some results from there. However, even for these sums, our situation presents an important extra difficulty compared with [17], namely that in [17] the functions h are bounded, while in our case they blow up near either + or -.

We now introduce some new quantities that will appear in the large n asymptotics of S2k(1), S2k(2) and S2k(3). For k{1,2,,g}, define

θk,-(n,M):=gk,--(bnrk2b1+Mn-α)=bnrk2b1+Mn-α-(bnrk2b1+Mn-α),θk,+(n,M):=(bnrk2b1-Mn-α)-gk,+=(bnrk2b1-Mn-α)-bnrk2b1-Mn-α.

Clearly, θk,-(n,M),θk,+(n,M)[0,1). For what follows, it is useful to note that Mj,k is decreasing as j increases, and that j=gk,-k,+1 is of order Mn as n+.

We start with a general lemma needed for the analysis of S2k(2).

Lemma 3.10

(Adapted from [17, Lemma 2.7]) Let hC3(R) and k{1,,2g}. As n+, we have

j=gk,-gk,+h(Mj,k)=brk2b-MMh(t)dtn-2brk2b-MMth(t)dt+(12-θk,-(n,M))h(M)+(12-θk,+(n,M))h(-M)+1n[3brk2b-MMt2h(t)dt+(112+θk,-(n,M)(θk,-(n,M)-1)2)h(M)brk2b-(112+θk,+(n,M)(θk,+(n,M)-1)2)h(-M)brk2b]+O(1n3/2j=gk,-+1gk,+((1+|Mj|3)m~j,n(h)+(1+Mj2)m~j,n(h)+(1+|Mj|)m~j,n(h)+m~j,n(h))), 3.41

where, for h~C(R) and j{gk,-+1,,gk,+}, we define m~j,n(h~):=maxx[Mj,k,Mj-1,k]|h~(x)|.

Remark 3.11

Note that m~j,n depends on k, although this is not indicated in the notation.

Remark 3.12

If |h|,|h|,|h| and |h| are bounded, then the error term simplifies to O(M4n-1), which agrees with [17, Lemma 2.7].

Proof

This lemma was proved in [17, Lemma 2.7] in the case where |h|,|h|,|h| and |h| are bounded. The more general case considered here only requires more careful estimates on the various error terms.

Lemma 3.13

Let k{1,2,,2g}. As n+, we have

S2k(2)=G4,k(M)n+G6,k(M)+G7,k(M)1n+O(M9n-1), 3.42

where

G4,k(M)=brk2b-MMh0,k(x)dx, 3.43
G6,k(M)=-2brk2b-MMxh0,k(x)dx+(12-θk,-(n,M))h0,k(M)+(12-θk,+(n,M))h0,k(-M)+brk2b-MMh1,k(x)dx, 3.44
G7,k(M)=3brk2b-MMx2h0,k(x)dx+(112+θk,-(n,M)(θk,-(n,M)-1)2)h0,k(M)brk2b-(112+θk,+(n,M)(θk,+(n,M)-1)2)h0,k(-M)brk2b-2brk2b-MMxh1,k(x)dx+(12-θk,-(n,M))h1,k(M)+(12-θk,+(n,M))h1,k(-M)+brk2b-MMh2,k(x)dx, 3.45

and

h0,k(x)=log(12erfc(-xrkb2)),ifk{1,3,5,,2g-1},log(1-12erfc(-xrkb2)),ifk{2,4,6,,2g},h1,k(x)=e-x2rk2b22π12erfc(-xrkb2)(13rkb-5x2rkb6),ifk{1,3,5,,2g-1},-e-x2rk2b22π(1-12erfc(-xrkb2))(13rkb-5x2rkb6),ifk{2,4,6,,2g},
h2,k(x)=e-x2rk2b22πerfc(-xrkb2)(-2536x5rk3b+7336x3rkb+x6rkb)-e-x2rk2bπerfc2(-xrkb2)(13rkb-5x2rkb6)2,-e-x2rk2b222π(1-12erfc(-xrkb2))(-2536x5rk3b+7336x3rkb+x6rkb)-e-x2rk2b4π(1-12erfc(-xrkb2))2(13rkb-5x2rkb6)2.

In the above equation for h2,k, the first line reads for k{1,3,5,,2g-1} and the second line reads for k{2,4,6,,2g}.

Remark 3.14

Note that the error term O(M9n-1) above is indeed small as n+, because M=n112.

Proof

We only do the proof for k odd (the case of k even is similar). For convenience, in this proof we will use λj, ηj and Mj in place of λj,k, ηj,k and Mj,k. From (2.6), (3.38) and (3.41), we see that

S2k(2)=j:λj,kI2log(γ(aj,nrk2b)Γ(j+αb))=j=gk,-gk,+log(12erfc(-ηjaj/2)-Raj(ηj)). 3.46

Recall from (3.42) that for all j{j:λjI2}, we have

1-Mnλj=bnrk2bj+α1+Mn,-MMjM.

Hence, using (3.2) we obtain

ηj=(λj-1)(1-λj-13+736(λj-1)2+O((λj-1)3))=Mjn-Mj23n+7Mj336n3/2+O(M4n2),-ηjaj/2=-Mjrkb2+5Mj2rkb62n-53Mj3rkb722n+O(M4n-32), 3.47

as n+ uniformly for j{j:λjI2}. By Taylor’s theorem, for each j{j:λjI2} we have

12erfc(-ηjaj/2)=12erfc(-Mjrkb2)+12erfc(-Mjrkb2)(-ηjaj/2+Mjrkb2)+14erfc(-Mjrkb2)(-ηjaj/2+Mjrkb2)2+112erfc(ξj)(-ηjaj/2+Mjrkb2)3, 3.48

for a certain ξj[-Mjrkb2,-ηjaj/2]. Using (1.6), erfc(x)=4π(1-2x2)e-x2 and (3.49), we infer that there exists a constant C>0 such that

|112erfc(ξj)(-ηjaj/2+Mjrkb2)312erfc(-Mjrkb2)|C(1+Mj8)n-32 3.49

holds for all sufficiently large n and all j{j:λjI2}. Similarly, by Taylor’s theorem, for each j{j:λjI2} we have

Raj(ηj)=Raj(Mjn)+Raj(Mjn)(ηj-Mjn)+12Raj(ξ~j)(ηj-Mjn)2, 3.50

for some ξ~j[ηj,Mjn]. Furthermore, Ra(η) is analytic with respect to λ (see [71, p. 285]), in particular near λ=1 (or η=0), and the expansion (2.8) holds in fact uniformly for |argz|2π-ϵ for any ϵ>0 (see e.g. [62, p. 325]). It then follows from Cauchy’s formula that (2.8) can be differentiated with respect to η without increasing the error term. Thus, differentiating twice (2.8) we conclude that there exists C>0 such that

|12Raj(ξ~j)(ηj-Mjn)212erfc(-Mjrkb2)|C(1+Mj6)n-32 3.51

holds for all sufficiently large n and all j{j:λjI2}. Combining (3.48), (3.49), (3.50), (3.51), (3.52) and (3.53) with (2.8) and (2.9), we obtain after a computation that

S2k(2)=j=jk,-jk,+log{12erfc(-Mjrkb2)+12erfc(-Mjrkb2)5Mj2rk62n+Mj3288n(25Mjrk2berfc(-Mjrkb2)-532rkberfc(-Mjrkb2))+e-Mj2rk2b22π(13rkbn-[Mj12rkb+5Mj3rkb18]1n)}+j=jk,-jk,+O(Mj8n-3/2)=j=jk,-jk,+h0,k(Mj)+1nj=jk,-jk,+h1,k(Mj)+1nj=jk,-jk,+h2,k(Mj)+O(M9n-1), 3.52

as n+. Each of these three sums can be expanded using Lemma 3.10. The errors in these expansions can be estimated as follows. First, note that the function e-x2rk2b2erfc(-xrkb2)-1 is exponentially small as x+, and is bounded by a polynomial of degree 1 as x-. Hence, the functions h0,k(x), h1,k(x) and h2,k(x) also tend to 0 exponentially fast as x+, while as x- they are bounded by polynomials of degree 2, 3 and 6, respectively. The derivatives of h0,k(x), h1,k(x) and h2,k(x) can be estimated similarly. Using Lemma 3.10, we then find that the fourth term in the large n asymptotics of j=jk,-k,+h0,k(Mj) is

O(1n3/2j=gk,-+1gk,+((1+|Mj|3)m~j,n(h0,k)+(1+Mj2)m~j,n(h0,k)+(1+|Mj|)m~j,n(h0,k)+m~j,n(h0,k))=O(M6n),asn+.

Similarly, the third term in the asymptotics of 1nj=jk,-k,+h1,k(Mj) is O(M6n), and the second term in the asymptotics of 1nj=jk,-k,+h2,k(Mj) is O(M8n). All these errors are, in particular, O(M9n-1). Hence, by substituting the asymptotics of these three sums in (3.54), we find the claim.

The quantities G4,k(M), G6,k(M) and G7,k(M) appearing in (3.44) depend quite complicatedly on M. The goal of the following lemma is to find more explicit asymptotics for S2k(2). We can do that at the cost of introducing a new type of error terms. Indeed, the error O(M9n-1) of (3.44) is an error that only restrict M to be “not too large”. In Lemma 3.15 below, there is another kind of error term that restrict M to be “not too small".

Lemma 3.15

Let k{1,3,,2g-1}. As n+, we have

S2k(2)=G~4,k(M)n+G~6,k(M)+O(M5n)+O(nM7),

where

G~4,k(M)=-brk4b6M3-brk2bMlogM+brk2b(1-log(rkb2π))M+2brkb-0log(12erfc(y))dy+2brkb0+[log(12erfc(y))+y2+logy+log(2π)]dy+bM-5b6rk2bM3+37b15rk4bM5,G~6,k(M)=-1124brk4bM4-brk2bM2logM+rk2b(b4-blog(rkb2π)+2θk,+(n,M)-14)M2+2θk,+(n,M)-12log(Mrkb2π)+2b-0{2ylog(12erfc(y))+e-y2πerfc(y)1-5y23}dy+2b0+{2ylog(12erfc(y))+e-y2πerfc(y)1-5y23+113y3+2ylogy+(12+2log(2π))y}dy,

Let k{2,4,,2g}. As n+, we have

S2k(2)=G~4,k(M)n+G~6,k(M)+O(M5n)+O(nM7),

where

G~4,k(M)=-brk4b6M3-brk2bMlogM+brk2b(1-log(rkb2π))M+2brkb-0log(12erfc(y))dyO+2brkb0+[log(12erfc(y))+y2+logy+log(2π)]dy+bM-5b6rk2bM3+37b15rk4bM5,G~6,k(M)=1124brk4bM4+brk2bM2logM+rk2b(-b4+blog(rkb2π)+2θk,-(n,M)-14)M2+2θk,-(n,M)-12log(Mrkb2π)-2b-0{2ylog(12erfc(y))+e-y2πerfc(y)1-5y23}dy-2b0+{2ylog(12erfc(y))+e-y2πerfc(y)1-5y23+113y3+2ylogy+(12+2log(2π))y}dy.

Remark 3.16

With our choice M=n112, both errors O(M5n) and O(nM7) are of the same order:

M5n=nM7=M-1=n-112.

So M=n112 is the choice that produces the best control of the total error. However this still does not really explain why we chose M=n112. Indeed, in the above asymptotics one could have easily computed the next term of order nM7 if this was needed. The real reason why we chose M=n112 is because the sums S2k(1) and S2k(3), which are analyzed below, also contain a term of order nM7 in their asymptotics, and this term is hard to compute explicitly.

Proof

We only do the proof for k odd. As already mentioned in the proof of Lemma 3.13, h0,k(x), h1,k(x) and h2,k(x) are exponentially small as x+, and since M=n112, this implies that there exists c>0 such that

-1Mxhj,k(x)dx=-1+xhj,k(x)dx+O(e-nc),asn+,j=0,1,2,=0,1,2.

On the other hand, as x-, we have

h0,k(x)=-rk2b2x2-log(-x)-log(rkb2π)-rk-2bx2+5rk-4b2x4-37rk-6b3x6+O(x-8), 3.53
h1,k(x)=56rk2bx3+x2-2rk-2bx+O(x-3), 3.54
h2,k(x)=O(x4). 3.55

Using (3.55)–(3.57) and the definitions (3.45)–(3.47) of G4,k(M), G6,k(M), G7,k(M), we obtain that

G4,k(M)n=G~4,k(M)n+O(nM7),G6,k(M)=G~6,k(M)+O(1M2),G7,k(M)n=O(M5n),

as n+, and the claim follows.

Remark 3.17

From the above proof, we see that G7,k(M)n=O(M5n) as n+, and therefore G7,k(M) will not contribute at all in our final answer. It was however very important to compute G7,k(M) explicitly. Indeed, as can be seen from the statement of Lemma 3.13, h2,k consists of two parts, and it is easy to check that each of these two parts is of order x6 as x-. Thus the fact that actually we have h2,k(x)=O(x4) (see (3.57)) means that there are great cancellations in the asymptotic behavior of these two parts, and this is not something one could have detected in advance without computing explicitly G7,k(M) and h2,k.

Now we turn our attention to the sums S2k(3) and S2k(1). The analogue of these sums in [17] were relatively simple to analyze, see [17, Lemmas 2.5 and 2.6]. In this paper, the sums {S2k(3)}kodd and {S2k(1)}keven are straightforward to analyze (and even simpler than in [17, Lemmas 2.5 and 2.6]). However, the sums {S2k(1)}kodd and {S2k(3)}keven are challenging (their large n asymptotics depend on both ϵ and M in a complicated way). We start with the sums {S2k(3)}kodd and {S2k(1)}keven.

Lemma 3.18

Let k{1,3,,2g-1}. As n+, we have S2k(3)=O(n-10).

Let k{2,4,,2g}. As n+, we have S2k(1)=O(n-10).

Proof

Let k{1,3,,2g-1}. Recall from (3.38) that

S2k(3)=j:λj,kI3log(γ(aj,nrk2b)Γ(aj)),

and from (3.39) that I3=(1+Mn,1+ϵ]. We then infer, by (3.2), that there exists a constant c>0 such that ajηj,kcM holds for all large n and j{j:λj,kI3}. By (2.6), (2.8), (1.14) and erfc(-y)=2-erfc(y), this implies

γ(aj,nrk2b)Γ(aj)=12erfc(-ηj,kaj/2)-Raj(ηj,k)=1+O(e-c22M2),asn+

uniformly for j{j:λj,kI3}. Since M=n112, the claim is proved for k odd. The proof for k even is similar and we omit it.

We now focus on {S2k(1)}kodd and {S2k(3)}keven.

Lemma 3.19

Let k{1,3,,2g-1}. We have

S2k(1)=j=gk,++1jk,+log{12erfc(-ηj,k2aj)}+j=gk,++1jk,+log{1-Raj(ηj,k)12erfc(-ηj,k2aj)}, 3.56

where

-ηj,k2=brk2bj/n+αn-1-log(brk2bj/n+αn),aj=nbj/n+αn, 3.57
Raj(ηj,k)=exp(-ajηj,k22)n2πb-1j/n+αn{c0(ηj,k)+bc1(ηj,k)n(j/n+αn)+O(n-2)}, 3.58

and the last expansion holds as n+ uniformly for j{gk,++1,,jk,+}. We recall that the functions c0 and c1 are defined in (2.9).

Let k{2,4,,2g}. We have

S2k(3)=j=jk,-gk,--1log{1-12erfc(-ηj,k2aj)}+j=jk,-gk,--1log{1+Raj(ηj,k)1-12erfc(-ηj,k2aj)}, 3.59

where

-ηj,k2=-brk2bj/n+αn-1-log(brk2bj/n+αn),aj=nbj/n+αn,Raj(ηj,k)=exp(-ajηj,k22))n2πb-1j/n+αn{c0(ηj,k)+bc1(ηj,k)n(j/n+αn)+O(n-2)},

and the last expansion holds as n+ uniformly for j{jk,-,,gk,--1}.

Proof

This follows from a direct application of Lemma 2.3.

The asymptotic analysis of {S2k(1)}kodd and {S2k(3)}keven is challenging partly because, as can be seen from the statement of Lemma  3.19, there are four types of n-dependent parameters which vary at different speeds. Indeed, as n+ and j{gk,++1,,jk,+}, the quantities aj, ηj,k, j/n and α/n are of orders n, j/n-brk2b, 1 and 1n respectively. In particular, for j close to gk,++1, ηj,k is of order Mn, while for j close to jk,+, it is of order 1. In the next lemma, we obtain asymptotics for the right-hand sides of (3.58) and (3.61). These asymptotics will then be evaluated more explicitly using Lemma 3.4.

Lemma 3.20

Let k{1,3,,2g-1}. As n+, we have

j=gk,++1jk,+log{12erfc(-ηj,kaj2)}=nj=gk,++1jk,+gk,1(j/n)+lognj=gk,++1jk,+gk,2(j/n)+j=gk,++1jk,+gk,3(j/n)+1nj=gk,++1jk,+gk,4(j/n)+1n2j=gk,++1jk,+gk,5(j/n)+1n3j=gk,++1jk,+gk,6(j/n)+O(nM7), 3.60
j=gk,++1jk,+log{1-Raj(ηj,k)12erfc(-ηj,kaj2)}=j=gk,++1jk,+hk,3(j/n)+1nj=gk,++1jk,+hk,4(j/n)+O(M-2), 3.61

where

gk,1(x)=-brk2b-x-xlog(brk2bx)b,gk,2(x)=-12, 3.62
gk,3(x)=12log(b4π)-12log(brk2b-x-xlog(brk2bx))+αblog(brk2bx), 3.63
gk,4(x)=-12bbrk2b-x-xlog(brk2bx)+12αlog(brk2bx)brk2b-x-xlog(brk2bx)-α22bx, 3.64
gk,5(x)=5b28(brk2b-x-xlog(brk2bx))2-bαlog(brk2bx)2(brk2b-x-xlog(brk2bx))2+α2-brk2b+x+xlog(brk2bx)+xlog2(brk2bx)4x(brk2b-x-xlog(brk2bx))2+α36bx2, 3.65
gk,6(x)=-37b324(brk2b-x-xlog(brk2bx))3+5b2αlog(brk2bx)4(brk2b-x-xlog(brk2bx))3+bα2(brk2b-x-xlog(brk2bx)-2xlog2(brk2bx))4x(brk2b-x-xlog(brk2bx))3+α3(x-brk2b)2+5x(x-brk2b)log(brk2bx)+4x2log2(brk2bx)+2x2log3(brk2bx)12x2(brk2b-x-xlog(brk2bx))3-α412bx3, 3.66
hk,3(x)=log(2xbrk2b-x-xlog(brk2bx)|x-brk2b|), 3.67
hk,4(x)=-b(b2rk4b+10brk2bx+x2)12x(brk2b-x)2+brk2bαx(brk2b-x)+12xxb+(x-brk2b)αbrk2b-x-xlog(brk2bx). 3.68

Let k{2,4,,2g}. As n+, we have

j=jk,-gk,--1log{1-12erfc(-ηj,kaj2)}=nj=jk,-gk,--1gk,1(j/n)+lognj=jk,-gk,--1gk,2(j/n)+j=jk,-gk,--1gk,3(j/n)+1nj=jk,-gk,--1gk,4(j/n)+1n2j=jk,-gk,--1gk,5(j/n)+1n3j=jk,-gk,--1gk,6(j/n)+O(nM7),j=jk,-gk,--1log{1+Raj(ηj,k)1-12erfc(-ηj,kaj2)}=j=jk,-gk,--1hk,3(j/n)+1nj=jk,-gk,--1hk,4(j/n)+O(M-2),

where the functions gk,1,,gk,6,hk,3 and hk,4 are as in (3.64)–(3.70).

Remark 3.21

Using that g4,k, g5,k, g6,k and hk,4 each have a pole at x=brk2b, of order 2, 4, 6 and 1 respectively, we can easily show that the sums

1nj=gk,++1jk,+gk,4(j/n),1n2j=gk,++1jk,+gk,5(j/n),1n3j=gk,++1jk,+gk,6(j/n),1nj=gk,++1jk,+hk,4(j/n)

are, as n+, of order nM, nM3, nM5 and logn, respectively. Since M=n112, each of these sums is thus of order greater than 1.

Proof

Let k{1,3,,2g-1}, and define Fk(α~)=Fk(α~;x) by

Fk(α~)=x+α~bbrk2bx+α~-1-log(brk2bx+α~).

By (3.59) we have Fk(αn;jn)=-ηj,kaj2n for all j{gk,++1,,jk,+}. For each x[brk2b,brk+12b], using Taylor’s theorem, we obtain

Fk(α~;x)==04Fk()(0;x)!α~+Fk(5)(ξ(α~;x);x)5!α~5,

for some ξ(α~;x)(0,α~) if α~>0 and ξ(α~;x)(α~,0) if α~<0. The functions Fk(1),,Fk(5) are explicitly computable, but since their expressions are rather long we do not write them down (we simply mention that xFk(0;x) has a simple zero as xbrk2b, while the functions xFk()(0;x) for 1 remain bounded as xbrk2b). The function Fk(5) satisfies the following: there exist C>0 and δ>0 such that

|Fk(5)(ξ(α~;x);x)|C,forall|α~|δandallx[brk2b,brk+12b].

We thus have

-ηj,kaj2n==04Fk()(0;jn)!αn+O(n-5),asn+

uniformly for j{gk,++1,,jk,+}. These asymptotics can be rewritten as

-ηj,kaj2=nFk(0;jn)+=14β2-1(nFk(0;jn))2-1+O(n-92),β2-1:=Fk()(0;jn)!αFk(0;jn)2-1 3.69

as n+ uniformly for j{gk,++1,,jk,+}. Since xFk(0;x) has a simple zero at x=brk2b, there exist constants c1,c2,c1,c2>0 such that

c1Mc1n(jn-brk2b)nFk(0;jn)c2n(jn-brk2b)c2n 3.70

for all large enough n and all j{gk,++1,,jk,+}. On the other hand, using (1.14) we obtain

log(12erfc(z+β1z+β3z3+β5z5+β7z7+β9z9))=-z2-log(z)-log(2π)-2β1-12+β1+β12+2β3z2+58+β1+β122-β3-2β1β3-2β5z4+-3724+β1(-52+β3-2β5)-3β122-β133+β3-β32-β5-2β7z6+O(z-8), 3.71

as z+ uniformly for β1,β3,,β9 in compact subsets of R. Combining (3.71), (3.72) and (3.73) (with z=nFk(0;jn)), and using that

j=gk,++1jk,+1(nFk(0;jn))8=O(nM7),asn+,

we find (3.62) after a long but straightforward computation. To prove (3.63), we first use (3.60) to find

Raj(ηj,k)12erfc(-ηj,kaj2)=exp(-ajηj,k22)nFk(0;jn)12erfc(-ηj,kaj2)bFk(0;jn)2πj/n+αn×{c0(ηj,k)+bc1(ηj,k)n(j/n+αn)+O(n-2)} 3.72

as n+ uniformly for j{gk,++1,,jk,+}. Using again (1.14), we obtain

exp(-(z+β1z+β3z3+β5z5+β7z7+β9z9)2)z2erfc(z+β1z+β3z3+β5z5+β7z7+β9z9)=2π+π(1+2β1)z2+O(z-4),asz+ 3.73

uniformly for β1,β3,,β9 in compact subsets of R. The first ratio on the right-hand side of (3.74) can then be expanded by combining (3.75) (with z=nFk(0;jn)) and (3.71). For the second part in (3.74), since the coefficients c0(η) and c1(η) are analytic for ηR (the singularity at η=0 in (2.9) is removable), we have

bFk(0;jn)2πj/n+αn{c0(ηj,k)+bc1(ηj,k)n(j/n+αn)}=Fk(0;jn)(G0(jn)+1nG1(jn)+O(n-2)) 3.74

for some explicit G0, G1 (which we do not write down) such that G0(jn) and G0(jn) remain of order 1 as n+ uniformly for j{gk,++1,,jk,+}. After a computation using (3.74), (3.75) and (3.76), we find

j=gk,++1jk,+log{1-Raj(ηj,k)12erfc(-ηj,kaj2)}=j=gk,++1jk,+(hk,3(j/n)+1nhk,4(j/n)+O(1n2F(0;jn)3)),

as n+. Since xFk(0;x) has a simple zero at x=brk2b, we have

j=gk,++1jk,+1n2Fk(0;jn)3CM2,foracertainC>0andforallsufficientlylargen,

and (3.63) follows. The proof for k{2,4,,2g} is similar and we omit it.

By applying Lemma 3.4 with f replaced by gk,1,,gk,6,hk,3 and h4,k, we can obtain the large n asymptotics of the various sums appearing in the above Lemma  3.20. Note that, as already mentioned in Remark  3.21, the functions g4,k, g5,k, g6,k and hk,4 have poles at x=brk2b. Nevertheless, we can still apply Lemma 3.4 to obtain precise large n asymptotics for

1nj=gk,++1jk,+gk,4(j/n),1n2j=gk,++1jk,+gk,5(j/n),1n3j=gk,++1jk,+gk,6(j/n),1nj=gk,++1jk,+hk,4(j/n),

see in particular Remark 3.5. Substituting these asymptotics in Lemma 3.20 and then in Lemma 3.19, and simplifying, we obtain (after a long computation) the following explicit large n asymptotics of {S2k(1)}kodd and {S2k(3)}keven (see the arXiv version arXiv:2110.06908 for more details).

Lemma 3.22

Let k{1,3,,2g-1}. As n+, we have

S2k(1)=brk4b(2ϵ+ϵ2+2log(1-ϵ))4(1-ϵ)2n2-brk2bϵ2(1-ϵ)nlogn+rk2b2(1-ϵ){(1-2θk,+(n,ϵ)+b-2blog(rkb2π))ϵ+(1-b-2θk,+(n,ϵ))log(1-ϵ)-2bϵlog(ϵ1-ϵ)}n+{brk4b6M3+brk2b(log(M)+log(rkb2π)-1)M-bM+5b6rk2bM3-37b15rk4bM5}n+2θk,+(n,ϵ)-14logn+1124brk4bM4+brk2bM2logM+{1-b-2θk,+(n,M)4+blog(rkb2π)}rk2bM2+1-2θk,+(n,M)2logM+(θk,+(n,ϵ)-θk,+(n,M))log(rkb2π)+2θk,+(n,ϵ)-12logϵ+bϵ+1+3b+b2-6(1+b)θk,+(n,ϵ)+6(θk,+(n,ϵ))212blog(1-ϵ)+O(M5n)+O(nM7).

Let k{2,4,,2g}. As n+, we have

S2k(3)=brk4b(2ϵ-ϵ2-2log(1+ϵ))4(1+ϵ)2n2-brk2bϵ2(1+ϵ)nlogn+rk2b2(1+ϵ){(2θk,-(n,ϵ)-1+b-2blog(rkb2π))ϵ+(1+b-2θk,-(n,ϵ))log(1+ϵ)-2bϵlog(ϵ1+ϵ)}n+{brk4b6M3+brk2b(log(M)+log(rkb2π)-1)M-bM+5b6rk2bM3-37b15rk4bM5}n+2θk,-(n,ϵ)-14logn-1124brk4bM4-brk2bM2logM+{1+b-2θk,-(n,M)4-blog(rkb2π)}rk2bM2+1-2θk,-(n,M)2logM+(θk,-(n,ϵ)-θk,-(n,M))log(rkb2π)+2θk,-(n,ϵ)-12logϵ+bϵ+-1+3b-b2+6(1-b)θk,-(n,ϵ)-6(θk,-(n,ϵ))212blog(1+ϵ)+O(M5n)+O(nM7).

Recall from (3.40) that

S2k=S2k(1)+S2k(2)+S2k(3)+O(e-cn),asn+.

By combining Lemmas 3.153.18 and 3.22 and simplifying, we finally obtain (after another long computation) the large n asymptotics of S2k.

Lemma 3.23

Let k{1,2,,2g}. As n+, we have

S2k=E1,k(ϵ)n2+E2,k(ϵ)nlogn+E3,k(n,ϵ)n+E4,kn+E5,k(n,ϵ)logn+E6,k(n,ϵ)+O(M5n+nM7),

where, for k{1,3,,2g-1}, the coefficients E1,k(ϵ), E2,k(ϵ), E3,k(n,ϵ), E4,k, E5,k(n,ϵ), E6,k(n,ϵ) are given by

E1,k(ϵ)=brk4b(2ϵ+ϵ2+2log(1-ϵ))4(1-ϵ)2,E2,k(ϵ)=-brk2bϵ2(1-ϵ),E3,k(n,ϵ)=(1-b+2bϵ-2θk,+(n,ϵ))log(1-ϵ)+ϵ(1+b-2θk,+(n,ϵ)-2blog(ϵrkb2π))2(1-ϵ)rk2b,E4,k=2brkb-0log(12erfc(y))dy+2brkb0+[log(12erfc(y))+y2+logy+log(2π)]dy,E5,k(n,ϵ)=2θk,+(n,ϵ)-14,E6,k(n,ϵ)=1+3b+b2-6(1+b)θk,+(n,ϵ)+6(θk,+(n,ϵ))212blog(1-ϵ)+bϵ+2θk,+(n,ϵ)-12log(ϵrkb2π)+2b-0{2ylog(12erfc(y))+e-y2(1-5y2)3πerfc(y)}dy+2b0+{2ylog(12erfc(y))+e-y2(1-5y2)3πerfc(y)+113y3+2ylogy+(12+2log(2π))y}dy,

while for k{2,4,,2g}, the coefficients E1,k(ϵ), E2,k(ϵ), E3,k(n,ϵ), E5,k(n,ϵ), E6,k(n,ϵ) are given by

E1,k(ϵ)=brk4b(2ϵ-ϵ2-2log(1+ϵ))4(1+ϵ)2,E2,k(ϵ)=-brk2bϵ2(1+ϵ),E3,k(n,ϵ)=(1+b+2bϵ-2θk,-(n,ϵ))log(1+ϵ)+ϵ(-1+b+2θk,-(n,ϵ)-2blog(ϵrkb2π))2(1+ϵ)rk2b,E4,k=2brkb-0log(12erfc(y))dy+2brkb0+[log(12erfc(y))+y2+logy+log(2π)]dy,E5,k(n,ϵ)=2θk,-(n,ϵ)-14,E6,k(n,ϵ)=-1+3b-b2+6(1-b)θk,-(n,ϵ)-6(θk,-(n,ϵ))212blog(1+ϵ)+bϵ+2θk,-(n,ϵ)-12log(ϵrkb2π)-2b-0{2ylog(12erfc(y))+e-y2(1-5y2)3πerfc(y)}dy-2b0+{2ylog(12erfc(y))+e-y2(1-5y2)3πerfc(y)+113y3+2ylogy+(12+2log(2π))y}dy.

Remark 3.24

Recall that although S2k(1), S2k(2) and S2k(3) depend on M, the sum S2k is independent of M. As can be seen from the above, all the coefficients E1,k(ϵ), E2,k(ϵ), E3,k(n,ϵ), E5,k(n,ϵ), E6,k(n,ϵ) are independent of M, as it must.

For xR, ρ(0,1) and a>0, define

Θ(x;ρ,a)=x(x-1)log(ρ)+xlog(a)+j=0+log(1+aρ2(j+x))+j=0+log(1+a-1ρ2(j+1-x)). 3.75

By shifting the indices of summation, it can be checked that xΘ(x;ρ,a) is periodic of period 1. To complete the proof of Theorem 1.1 we will need the following lemma.

Lemma 3.25

We have

Θ(x;ρ,a)=12log(πaρ-12log(ρ-1))+(loga)24log(ρ-1)-j=1+log(1-ρ2j)+logθ(x+log(aρ)2log(ρ)|πilog(ρ-1)),

where θ is the Jacobi theta function given by (1.10).

Proof

The statement follows from two remarkable identities of the Jacobi theta function. First, using the Jacobi triple product formula (see e.g. [61, Eq 20.5.3])

θ(z|τ)==1+(1-e2iπτ)(1+2eiπτ(2-1)cos(2πz)+eiπτ(4-2)), 3.76

we obtain

Θ(x,ρ,a)=x(x-1)log(ρ)+xlog(a)-j=1+log(1-ρ2j)+logθ((2x-1)log(ρ)+log(a)2πi|log(ρ-1)πi). 3.77

The claim then follows from a computation using the following Jacobi imaginary transformation (see e.g. [61, Eq (20.7.32)]): (-iτ)1/2θ(z|τ)=eiπτz2θ(zτ|τ), where τ=-1τ.

We now finish the proof of Theorem 1.1.

Proof of Theorem 1.1

Combining (3.7) with Lemmas 3.1,  3.23.8 and 3.23, we obtain

logPn=S0+k=1,3,...2g+1S2k-1+k=2,4,...2gS2k-1+k=12gS2k=O(e-cn)+k=1,3,...2g+1O(e-cn)+k=2,4,...2g{F1,k(ϵ)n2+F2,k(ϵ)nlogn+F3,k(n,ϵ)n+F5,k(n,ϵ)logn+F6,k(n,ϵ)+Θ~k,n+O((logn)2n)}+k=12g{E1,k(ϵ)n2+E2,k(ϵ)nlogn+E3,k(n,ϵ)n+E4,kn+E5,k(n,ϵ)logn+E6,k(n,ϵ)+O(M5n+nM7)}

as n+, for a certain constant c>0. Recall that M=n-112, so that M5n=nM7=n-112. Let C1,,C6,Fn be the quantities defined in the statement of Theorem 1.1. Using the formulas of Lemmas 3.8 and 3.23, we obtain after a long computation that

k=2,4,...2gF1,k(ϵ)+k=12gE1,k(ϵ)=C1,k=2,4,...2gF2,k(ϵ)+k=12gE2,k(ϵ)=C2,k=2,4,...2gF3,k(n,ϵ)+k=12gE3,k(n,ϵ)=C3,k=2,4,...2gF5,k(n,ϵ)+k=12gE5,k(n,ϵ)=C5.

It is also readily checked that k=12gE4,k=C4. From (3.79) and Lemma 3.8, we infer that

k=2,4,...2gΘ~k,n=k=1g{Θ(θ2k,r2k-1r2k,t2k-br2k-12bbr2k2b-t2k)+θ2k(θ2k-1)log(r2kr2k-1)+θ2klog(br2k2b-t2kt2k-br2k-12b)}.

Furthermore, by Lemma 3.25, θk=jk,-jk,, and jk,=ntk-α,

Θ(θ2k,r2k-1r2k,t2k-br2k-12bbr2k2b-t2k)=logπ2-12log(br2k2b-t2kt2k-br2k-12b)+14log(r2kr2k-1)-12loglog(r2kr2k-1)+[log(br2k2b-t2kt2k-br2k-12b)]24log(r2kr2k-1)-j=1+log(1-(r2k-1r2k)2j)+logθ(t2kn+12-α+log(br2k2b-t2kt2k-br2k-12b)2log(r2kr2k-1)|πilog(r2kr2k-1)),

where we have also used the fact that θ(x+1|τ)=θ(x|τ). Combining the above two equations yields

k=2,4,...2gΘ~k,n=Fn+g2log(π)+j=1g{(14+θ2k2-θ2k)log(r2kr2k-1)-12loglog(r2kr2k-1)+[log(br2k2b-t2kt2k-br2k-12b)]24log(r2kr2k-1)-j=1+log(1-(r2k-1r2k)2j)+(θ2k-12)log(br2k2b-t2kt2k-br2k-12b)}. 3.78

On the other hand, using Lemmas 3.8 and 3.23, we obtain (after a lot of cancellations)

k=2,4,...2gF6,k(n,ϵ)+k=12gE6,k(n,ϵ)=k=1g{(θ2k-θ2k2-1+b26)log(r2kr2k-1)+b2r2k2bbr2k2b-t2k+b2r2k-12bt2k-br2k-12b+(12-θ2k)log(br2k2b-t2kt2k-br2k-12b)}. 3.79

By combining (3.80) and (3.81), we finally obtain

k=2,4,...2g(F6,k(n,ϵ)+Θ~k,n)+k=12gE6,k(n,ϵ)=C6+Fn.

This finishes the proof of Theorem 1.1.

Proof of Theorem 1.4: the case r2g=+

As in Sect. 3, we start with (2.5), but now we split logPn into 4g parts

logPn=S0+k=12g-1(S2k-1+S2k)+S4g-1, 3.80

with S0,,S4g-2 as in (3.8)–(3.10), and

S4g-1=j=j2g-1,++1nlog(=12g+1(-1)+1γ(j+αb,nr2b)Γ(j+αb)).

The sums S0,S1,,S4g-2 can be analyzed exactly as in Sect. 3. For the large n asymptotics of these sums, see Lemma 3.1 for S0, Lemma 3.2 for S2k-1 with k{1,3,,2g-1}, Lemma 3.8 for S2k-1 with k{2,4,,2g-2}, and Lemma 3.23 for S2k with k{1,2,,2g-1}. Thus it only remains to determine the large n asymptotics of S4g-1 in this section. These asymptotics are stated in the following lemma.

Lemma 4.1

Let k=2g. As n+, we have

S2k-1=F1,k(ϵ)n2+F2,k(ϵ)nlogn+F3,k(n,ϵ)n+F5,k(n,ϵ)logn+F6,k(n,ϵ)+O(lognn),

where

F1,k(ϵ)=brk-14b(1-ϵ)21-4ϵ-2log(1-ϵ)4+34b+12blog(brk-12b)-rk-12b,F2,k(ϵ)=brk-12b2(1-ϵ)-12,F3,k(n,ϵ)=rk-12b1-ϵ{2α-1+2θk-1,+(n,ϵ)2(ϵ+log(1-ϵ))-b+2α2-blogb+b2log(2π)-b2log(rk-1)-2α-b2log(1-ϵ)+bϵlog(ϵbrk-12b1-ϵ)}+b+2α+12b-rk-12b2+12log(b2π)+1+2α2blog(brk-12b)-(1-brk-12b)log(1-brk-12b),F5,k(n,ϵ)=-θk-1,+(n,ϵ)+α2,F6,k(n,ϵ)=-1+3b+b2-6(1+b)θk-1,+(n,ϵ)+6(θk-1,+(n,ϵ))212blog(1-ϵ)-bϵ+(12-θk-1,+(n,ϵ))logϵ+(12-α-θk-1,+(n,ϵ))log(rk-1b2π)+14log(b4π)-1+2α2log(1-brk-12b)+b2rk-12b1-brk-12b+b+b2+6bα+6α2+6α+112blog(brk-12b).

Proof

In the same way as in Lemma 3.3, as n+ we find

S2k-1=S2k-1(1)+O(e-cn),whereS2k-1(1)=j=jk-1,++1nlog(γ(j+αb,nrk-12b)Γ(j+αb)).

The large n asymptotics of S2k-1(1) can be obtained in a similar (and simpler, because there is no theta functions) way than in Lemma 3.6 using Lemma 3.4. We omit further details.

By substituting the asymptotics of Lemmas 3.1,  3.23.8,  3.23 and 4.1 in (4.1), and then simplifying, we obtain the statement of Theorem 1.4.

Proof of Theorem 1.7: the case r1=0

We use again (2.5), but now we split logPn into 4g-1 parts as follows

logPn=S3+S4+k=32g(S2k-1+S2k)+S4g+1 3.81

with S4,,S4g+1 as in (3.8)–(3.10), and

S3=j=1j2,--1log(=12g+1(-1)+1γ(j+αb,nr2b)Γ(j+αb)).

The sums S4,S5,,S4g+1 can be analyzed exactly as in Sect. 3. Their large n asymptotics is given by Lemma 3.2 for S2k-1 with k{3,5,,2g+1}, Lemma 3.8 for S2k-1 with k{4,6,,2g}, and Lemma 3.23 for S2k with k{2,3,,2g}. Thus it only remains to analyze S3 in this section. This analysis is different than in the previous Sects. 3 and 4 and requires the asymptotics of γ(a,z) as z+ uniformly for az[0,11+ϵ/2]. These asymptotics are not covered by Lemma 2.3, but are also known in the literature, see e.g. [62].

Lemma 5.1

(Taken from [62, Sect. 4]) As z+ and simultaneously z-az+, we have

γ(a,z)Γ(a)=1-zae-zΓ(a)(1z-a-z(z-a)3+O(z-3)).

We are now in a position to obtain the large n asymptotics of S3.

Lemma 5.2

Let k=2. As n+, we have

S2k-1=F1,k(ϵ)n2+F2,k(ϵ)nlogn+F3,k(n,ϵ)n+F5,k(n,ϵ)logn+F6,k(n,ϵ)+O(lognn),

where

F1,k(ϵ)=-brk4b(1+ϵ)21+4ϵ-2log(1+ϵ)4,F2,k(ϵ)=-brk2b2(1+ϵ),F3,k(n,ϵ)=rk2b1+ϵ{(1+α-θk,-(n,ϵ))ϵ-b2log(rk)+α+12+b2+bϵlog(ϵ1+ϵ)-b2log(2π)+2θk,-(n,ϵ)-1-b2log(1+ϵ)},F5,k(n,ϵ)=-1+b2+6α+6α2-3b(3+4α)12b-θk,-(n,ϵ)2,F6,k(n,ϵ)=1-3b+b2+6(b-1)θk,-(n,ϵ)+6(θk,-(n,ϵ))212blog(1+ϵ)-bϵ+1-2θk,-(n,ϵ)2logϵ+(2b(1+α)-α-α2-1+3b+b26)log(rk)+α+12log(2π)-θk,-(n,ϵ)log(rkb2π)-1-3b+b2+6α-6bα+6α212blog(b)-G(b,α),

where G(b,α) is defined in (1.18).

Proof

In a similar way as in Lemma 3.3, as n+ we find

S2k-1=S2k-1(2)+O(e-cn),whereS2k-1(2)=j=1jk,--1log(1-γ(j+αb,nrk-12b)Γ(j+αb)).

Using Lemma 5.1, we conclude that as n+,

S2k-1=-j=1jk,--1logΓ(j+αb)+j=1jk,--1{j/nbnlogn+(2log(rk)j/n-rk2b)n+α-bblogn+2αlogrk-log(brk2b-j/nb)+1n-αj/n-b(b-α)rk2b(j/n-brk2b)2}+O(n-1). 4.1

The second sum on the right-hand side of (5.2) can be expanded explicitly using Lemma 3.4. For the first sum, using logΓ(z)=zlogz-z-logz2+log2π2+112z+O(z-3) as z+, we obtain

j=1jk,--1logΓ(j+αb)=brk4b2(1+ϵ)2n2logn-brk4b4(1+ϵ)2(3-2log(rk2b1+ϵ))n2+2θk,-(n,ϵ)-1-b2(1+ϵ)rk2bnlogn+blog(2π)+(2θk,-(n,ϵ)-1-b)(log(rk2b1+ϵ)-1)2(1+ϵ)rk2bn+1+3b+b2-6(1+b)θk,-(n,ϵ)+6(θk,-(n,ϵ))212blog(nrk2b1+ϵ)+θk,-(n,ϵ)-α-12log(2π)+1-3b+b2+6α-6bα+6α212blogb+G(b,α)+O(n-1),asn+.

This finishes the proof.

By combining the asymptotics of Lemmas 3.2,  3.83.23 and 4.1 with (5.1), and then simplifying, we obtain the statement of Theorem 1.7.

Proof of Theorem 1.9: the case r2g=+ and r1=0

We split logPn into 4g-3 parts

logPn=S3+S4+k=32g-1(S2k-1+S2k)+S4g-1 5.1

with S4,,S4g-2 as in (3.8)–(3.10), and

S3=j=1j2,--1log(=12g+1(-1)+1γ(j+αb,nr2b)Γ(j+αb)),S4g-1=j=j2g-1,++1nlog(=12g+1(-1)+1γ(j+αb,nr2b)Γ(j+αb)).

The sums S4,S5,,S4g-2 can be analyzed exactly as in Sect. 3, S4g-1 can be analyzed as in Sect. 4, and S3 as in Sect. 5. More precisely, their large n asymptotics are given by Lemma 3.2 for S2k-1 with k{3,5,,2g-1}, Lemma 3.8 for S2k-1 with k{4,6,,2g-2}, Lemma 3.23 for S2k with k{2,3,,2g-1}, Lemma 4.1 for S4g-1, and Lemma 5.2 for S3. Substituting all these asymptotics in (6.1) and simplifying, we obtain the asymptotic formula of Theorem 1.9.

Acknowledgements

The author is grateful to Oleg Lisovyy and Grégory Schehr for useful remarks. Support is acknowledged from the European Research Council, Grant Agreement No. 682537, the Ruth and Nils-Erik Stenbäck Foundation, and the Novo Nordisk Fonden Project Grant 0064428.

Funding Information

Open access funding provided by Lund University.

Data Availibility Statement

not applicable to this article as no datasets were generated.

Declarations

Conflict of interest

there is no conflict of interest.

Footnotes

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

References

  • 1.Adhikari, K.: Hole probabilities for β-ensembles and determinantal point processes in the complex plane, Electron. J. Probab. 23, 21 pp (2018)
  • 2.Adhikari K, Reddy NK. Hole probabilities for finite and infinite ginibre ensembles. Int. Math. Res. Not. IMRN. 2017;2017(21):6694–6730. [Google Scholar]
  • 3.Akemann G, Strahov E. Hole probabilities and overcrowding estimates for products of complex Gaussian matrices. J. Stat. Phys. 2013;151(6):987–1003. [Google Scholar]
  • 4.Akemann, G., Phillips, M.J., Shifrin, L.: Gap probabilities in non-Hermitian random matrix theory, J. Math. Phys. 50(6), 063504, 32 pp (2009)
  • 5.Akemann, G., Ipsen, J.R., Strahov, E.: Permanental processes from products of complex and quaternionic induced Ginibre ensembles, Random Matrices Theory Appl. 3,(4), 1450014, 54 pp (2014)
  • 6.Ameur Y, Cronvall J. Szegö type asymptotics for the reproducing kernel in spaces of full-plane weighted polynomials. Commun. Math. Phys. 2002 doi: 10.1007/s00220-022-04539-y. [DOI] [Google Scholar]
  • 7.Ameur Y, Hedenmalm H, Makarov N. Fluctuations of eigenvalues of random normal matrices. Duke Math. J. 2011;159:31–81. [Google Scholar]
  • 8.Ameur Y, Kang N-G. On a problem for Ward’s equation with a Mittag–Leffler potential. Bull. Sci. Math. 2013;137(7):968–975. [Google Scholar]
  • 9.Ameur Y, Kang N-G, Seo S-M. The random normal matrix model: insertion of a point charge. Potential Anal. 2023;58(2):331–372. [Google Scholar]
  • 10.Baik J, Buckingham R, DiFranco J. Asymptotics of Tracy-Widom distributions and the total integral of a Painlevé II function. Comm. Math. Phys. 2008;280:463–497. [Google Scholar]
  • 11.Balogh F, Bertola M, Lee S-Y, McLaughlin KT-R. Strong asymptotics of the orthogonal polynomials with respect to a measure supported on the plane. Comm. Pure Appl. Math. 2015;68(1):112–172. [Google Scholar]
  • 12.Blackstone E, Charlier C, Lenells J. Oscillatory asymptotics for Airy kernel determinants on two intervals. Int. Math. Res. Not. IMRN. 2022;2022(4):2636–2687. [Google Scholar]
  • 13.Blackstone, E., Charlier, C., Lenells, J.: Gap probabilities in the bulk of the Airy process, Random Matrices Theory Appl. 11(2), Paper No. 2250022, 30 pp (2022)
  • 14.Blackstone, E., Charlier, C., Lenells, J.: The Bessel kernel determinant on large intervals and Birkhoff’s ergodic theorem, to appear in Comm. Pure Appl. Math. arXiv:2101.09216
  • 15.Borot G, Guionnet A. Asymptotic expansion of β-matrix models in the one-cut regime. Comm. Math. Phys. 2013;317(2):447–483. [Google Scholar]
  • 16.Borot, G., Guionnet, A.: Asymptotic expansion of beta matrix models in the multi-cut regime. arXiv:1303.1045
  • 17.Charlier, C.: Asymptotics of determinants with a rotation-invariant weight and discontinuities along circles, Adv. Math. 408, Paper No. 108600 (2022)
  • 18.Charlier C, Lenells J, Mauersberger J. Higher order large gap asymptotics at the hard edge for Muttalib–Borodin ensembles. Comm. Math. Phys. 2021;384(2):829–907. doi: 10.1007/s00220-021-04059-1. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 19.Charlier C, Lenells J, Mauersberger J. Large gap asymptotics for the Meijer-G point process. Nonlinearity. 2021;34(5):2837–2877. [Google Scholar]
  • 20.Chau L-L, Zaboronsky O. On the structure of correlation functions in the normal matrix model. Comm. Math. Phys. 1998;196(1):203–247. [Google Scholar]
  • 21.Claeys T, Grava T, McLaughlin KT-R. Asymptotics for the partition function in two-cut random matrix models. Comm. Math. Phys. 2015;339(2):513–587. [Google Scholar]
  • 22.Claeys T, Girotti M, Stivigny D. Large gap asymptotics at the hard edge for product random matrices and Muttalib–Borodin ensembles. Int. Math. Res. Not. 2019;2019:2800–2847. [Google Scholar]
  • 23.Cunden FD, Mezzadri F, Vivo P. Large deviations of radial statistics in the two-dimensional one-component plasma. J. Stat. Phys. 2016;164(5):1062–1081. [Google Scholar]
  • 24.Dai D, Xu S-X, Zhang L. Asymptotics of Fredholm determinant associated with the Pearcey kernel. Comm. Math. Phys. 2021;382(3):1769–1809. [Google Scholar]
  • 25.Deift P, Zhou X. A steepest descent method for oscillatory Riemann-Hilbert problems. Asymptotics for the MKdV equation. Ann. Math. 1993;137:295–368. [Google Scholar]
  • 26.Deift P, Its A, Zhou X. A Riemann-Hilbert approach to asymptotic problems arising in the theory of random matrix models, and also in the theory of integrable statistical mechanics. Ann. Math. (2) 1997;146(1):149–235. [Google Scholar]
  • 27.Deift P, Its A, Krasovsky I, Zhou X. The Widom–Dyson constant and related questions of the asymptotic analysis of Toeplitz determinants. J. Comput. Appl. Math. 2007;202:26–47. [Google Scholar]
  • 28.Deift P, Its A, Krasovsky I. Asymptotics for the Airy-kernel determinant. Comm. Math. Phys. 2008;278:643–678. [Google Scholar]
  • 29.Deift P, Krasovsky I, Vasilevska J. Asymptotics for a determinant with a confluent hypergeometric kernel. Int. Math. Res. Not. 2011;9:2117–2160. [Google Scholar]
  • 30.Deaño A, Simm N. Characteristic polynomials of complex random matrices and Painlevé transcendents. Int. Math. Res. Not. IMRN. 2022;2022(1):210–264. [Google Scholar]
  • 31.Dumaz L, Virág B. The right tail exponent of the Tracy–Widom β distribution. Ann. Inst. Henri Poincaré Probab. Stat. 2013;49:915–933. [Google Scholar]
  • 32.Elbau P, Felder G. Density of eigenvalues of random normal matrices. Comm. Math. Phys. 2005;259(2):433–450. [Google Scholar]
  • 33.Ehrhardt T. Dyson’s constant in the asymptotics of the Fredholm determinant of the sine kernel. Comm. Math. Phys. 2006;262(2):317–341. [Google Scholar]
  • 34.Ehrhardt T. The asymptotics of a Bessel-kernel determinant which arises in random matrix theory. Adv. Math. 2010;225(6):3088–3133. [Google Scholar]
  • 35.Fahs, B., Krasovsky, I.: Sine-kernel determinant on two large intervals. arXiv:2003.08136
  • 36.Fenzl M, Lambert G. Precise deviations for disk counting statistics of invariant determinantal processes. Int. Math. Res. Not. IMRN. 2022;2022(10):7420–7494. [Google Scholar]
  • 37.Forrester PJ. Some statistical properties of the eigenvalues of complex random matrices. Phys. Lett. A. 1992;169(1–2):21–24. [Google Scholar]
  • 38.Forrester PJ. Fluctuation formula for complex random matrices. J. Phys. A. 1999;32:159–163. [Google Scholar]
  • 39.Forrester PJ. Asymptotics of spacing distributions 50 years later. MSRI Publ. 2014;65:199–222. [Google Scholar]
  • 40.Ginibre J. Statistical ensembles of complex, quaternion, and real matrices. J. Math. Phys. 1965;6:440–449. [Google Scholar]
  • 41.Ghosh S, Nishry A. Point processes, hole events, and large deviations: random complex zeros and coulomb gases. Constr. Approx. 2018;48(1):101–136. [Google Scholar]
  • 42.Ghosh S, Nishry A. Gaussian complex zeros on the hole event: the emergence of a forbidden region. Comm. Pure Appl. Math. 2019;72(1):3–62. [Google Scholar]
  • 43.Gouraud, G., Le Doussal, P., Schehr, G.: Hole probability for noninteracting fermions in a d-dimensional trap. arXiv:2104.08574
  • 44.Grobe R, Haake F, Sommers H-J. Quantum distinction of regular and chaotic dissipative motion. Phys. Rev. Lett. 1988;61(17):1899–1902. doi: 10.1103/PhysRevLett.61.1899. [DOI] [PubMed] [Google Scholar]
  • 45.Hedenmalm H, Wennman A. Planar orthogonal polynomials and boundary universality in the random normal matrix model. Acta Math. 2021;227(2):309–406. [Google Scholar]
  • 46.Hough, J.B.: Large deviations for the zero set of an analytic function with diffusing coefficients (2005). arXiv: 0510237
  • 47.Hough JB, Krishnapur M, Peres Y, Virág B. Zeros of Gaussian analytic functions and determinantal point processes, University Lecture Series. Providence: American Mathematical Society; 2009. [Google Scholar]
  • 48.Jancovici B, Lebowitz J, Manificat G. Large charge fluctuations in classical Coulomb systems. J. Statist. Phys. 1993;72(3–4):773–787. [Google Scholar]
  • 49.Krasovsky I. Gap probability in the spectrum of random matrices and asymptotics of polynomials orthogonal on an arc of the unit circle. Int. Math. Res. Not. 2004;2004:1249–1272. [Google Scholar]
  • 50.Krasovsky, I.: Large gap asymptotics for random matrices, in New Trends in Mathematical Physics. XVth International Congress on Mathematical Physics, Springer, Dordrecht (2009)
  • 51.Krasovsky, I., Maroudas, T.-H.: Airy-kernel determinant on two large intervals. arXiv:2108.04495
  • 52.Lacroix-A-Chez-Toine B, et al. Intermediate deviation regime for the full eigenvalue statistics in the complex Ginibre ensemble. Phys. Rev. E. 2019;100:012137. doi: 10.1103/PhysRevE.100.012137. [DOI] [PubMed] [Google Scholar]
  • 53.Leblé T, Serfaty S. Fluctuations of two dimensional Coulomb gases. Geom. Funct. Anal. 2018;28(2):443–508. [Google Scholar]
  • 54.Lee S-Y, Yang M. Discontinuity in the asymptotic behavior of planar orthogonal polynomials under a perturbation of the Gaussian weight. Comm. Math. Phys. 2017;355(1):303–338. [Google Scholar]
  • 55.Lee, S.-Y., Yang, M.: Strong Asymptotics of Planar Orthogonal Polynomials: Gaussian Weight Perturbed by Finite Number of Point Charges. arXiv:2003.04401
  • 56.Marchal O. Asymptotic expansions of some Toeplitz determinants via the topological recursion. Lett. Math. Phys. 2020;110(2):211–258. [Google Scholar]
  • 57.Marchal, O.: Asymptotic expansion of Toeplitz determinants of an indicator function with discrete rotational symmetry and powers of random unitary matrices. arXiv:2112.01306
  • 58.Mehta, M.L.: Random matrices. Pure and Applied Mathematics (Amsterdam), Vol. 142, 3rd ed., Elsevier/Academic Press, Amsterdam (2004)
  • 59.Nishry A. Asymptotics of the hole probability for zeros of random entire functions. Int. Math. Res. Not. 2010;2010(15):2925–2946. [Google Scholar]
  • 60.Nishry, A., Wennman, A.: The forbidden region for random zeros: appearance of quadrature domains. arXiv:2009.08774
  • 61.Olver, F.W.J., Olde Daalhuis, A.B., Lozier, D.W., Schneider, B.I., Boisvert, R.F., Clark, C.W., Miller, B.R., Saunders, B.V.: NIST Digital Library of Mathematical Functions. http://dlmf.nist.gov/. Release 1.0.13 of 2016-09-16
  • 62.Paris RB. A uniform asymptotic expansion for the incomplete gamma function. J. Comput. Appl. Math. 2002;148(2):323–339. [Google Scholar]
  • 63.Peres Y, Virág B. Zeros of the i.i.d. Gaussian power series: a conformally invariant determinantal process. Acta Math. 2005;194(1):1–35. [Google Scholar]
  • 64.Ramírez JA, Rider B, Zeitouni O. Hard edge tail asymptotics. Electron. Commun. Probab. 2011;16:741–752. [Google Scholar]
  • 65.Rider B. Deviations from the circular law. Probab. Theory Related Fields. 2004;130(3):337–367. [Google Scholar]
  • 66.Rider, B., Virag, B.: The noise in the circular law and the Gaussian free field, Int. Math. Res. Not, 2 (2007)
  • 67.Saff EB, Totik V. Logarithmic Potentials with External Fields. Berlin: Springer; 1997. [Google Scholar]
  • 68.Seo S-M. Edge behavior of two-dimensional Coulomb gases near a hard wall. Ann. Henri Poincaré. 2022;23(6):2247–2275. [Google Scholar]
  • 69.Shirai T. Large deviations for the fermion point process associated with the exponential kernel. J. Stat. Phys. 2006;123:615–629. [Google Scholar]
  • 70.Sodin M, Tsirelson B. Random complex zeroes, III, decay of the hole probability. Israel J. Math. 2005;147(1):371–379. [Google Scholar]
  • 71.Temme, N.M.: Special functions: an introduction to the classical functions of mathematical physics, John Wiley & Sons (1996)
  • 72.Valkó, B., Virág: Continuum limits of random matrices and the Brownian carousel, Invent. Math. 177(3), 463–508 (2009)
  • 73.Valkó B, Virág B. Large gaps between random eigenvalues. Ann. Probab. 2010;38(3):1263–1279. [Google Scholar]
  • 74.Webb C, Wong MD. On the moments of the characteristic polynomial of a Ginibre random matrix. Proc. Lond. Math. Soc. (3) 2019;118(5):1017–1056. [Google Scholar]
  • 75.Widom H. The strong Szegő limit theorem for circular arcs. Indiana Univ. Math. J. 1971;21:277–283. [Google Scholar]
  • 76.Widom H. Asymptotics for the Fredholm determinant of the sine kernel on a union of intervals. Comm. Math. Phys. 1995;171(1):159–180. [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

not applicable to this article as no datasets were generated.


Articles from Mathematische Annalen are provided here courtesy of Springer

RESOURCES