Random characters under the $L$-measure, I : Dirichlet characters
Yacine Barhoumi-Andr\'eani

TL;DR
This paper introduces an $L$-measure on Dirichlet characters, compares it with the Plancherel measure, and studies the asymptotic distribution of character evaluations, revealing convergence to imaginary exponentials of a Cauchy distribution.
Contribution
It defines a new $L$-measure on Dirichlet characters and analyzes the limiting distribution of character evaluations as the group size increases.
Findings
Character evaluations converge to imaginary exponentials of a Cauchy distribution.
Contrast with symmetric group characters, which converge to Gaussians.
The $L$-measure provides a new perspective on the distribution of Dirichlet characters.
Abstract
We define the -measure on the set of Dirichlet characters as an analogue of the Plancherel measure, once considered as a measure on the irreducible characters of the symmetric group. We compare the two measures and study the limit in distribution of characters evaluations when the size of the underlying group grows. These evaluations are proven to converge in law to imaginary exponentials of a Cauchy distribution in the same way as the rescaled windings of the complex Brownian motion. This contrasts with the case of the symmetric group where the renormalised characters converge in law to Gaussians after rescaling (Kerov Central Limit Theorem).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Random characters under the -measure, I :
Dirichlet characters
Yacine Barhoumi-Andréani
Department of Statistics, University of Warwick, Coventry CV4 7AL, U.K.
Abstract.
We define the -measure on the set of Dirichlet characters as an analogue of the Plancherel measure, once considered as a measure on the irreducible characters of the symmetric group.
We compare the two measures and study the limit in distribution of characters evaluations when the size of the underlying group grows. These evaluations are proven to converge in law to imaginary exponentials of a Cauchy distribution in the same way as the rescaled windings of the complex Brownian motion. This contrasts with the case of the symmetric group where the renormalised characters converge in law to Gaussians after rescaling (Kerov Central Limit Theorem).
2010 Mathematics Subject Classification:
60B15, 11K99, 11N64, 60F05
Contents
1. Introduction
1.1. Asymptotic representation theory of
For , set
[TABLE]
The goal of this article is to study the properties of characters of when and when the characters are selected at random according to the -measure that we introduce in definition 1.1.
This article focuses on the case of Dirichlet characters modulo that are multiplicative group morphisms extended to by setting if and finally extended by periodicity to by setting (see e.g. [15, § 5]). These maps were used by Dirichlet to prove his celebrated theorem on the infinitude of primes in arithmetic progressions.
Dirichlet characters have the following properties :
- (1)
is periodic modulo : for all , 2. (2)
is completely multiplicative : for all , 3. (3)
if and only if .
Note that these properties imply that , as and since .
We define to be the set of Dirichlet characters modulo . Apart from the value [math], these characters take values in the -roots of unity , where is Euler’s totient function. There are exactly such characters.
The -function attached to a Dirichlet character is the following function defined for all by (see e.g. [28])
[TABLE]
We consider these functions as linear forms in the character , hence the choice of notation compared with the usual one that writes .
Definition 1.1**.**
We define the -measure on by
[TABLE]
This measure can be written in the following way using the infamous Euler formula (12) :
[TABLE]
where is the set of prime numbers.
We can thus interpret (3) in the setting of statistical mechanics as a system of particles on a circle (whose positions are given by the angles of the character evaluated in prime numbers) submitted to a particular logarithmic confinement potential at inverse temperature .
Let denote the canonical evaluation on in the Dynkin formalism, namely
[TABLE]
We will be interested in the behaviour of the random variables for a fixed integer . The main theorem of this paper states
Theorem 1.2** (Convergence in law of the evaluations).**
Let be a fixed integer and . Then, under , the following convergence in law is satisfied
[TABLE]
where is a standard Cauchy-distributed random variable of density .
This theorem is proven in section 3.1. An immediate striking comparison with the winding number of the complex Brownian motion can be made : write with two independent real Brownian motions. Here, is a continuous determination of the argument of around [math]. Then, one has (see [27] or [24, X-4.1], [19, ch. 7])
[TABLE]
Spitzer proved this last convergence using an explicit computation of the Fourier transform of (see [24, X-4.1] for another proof). We will prove this convergence in the same vein, with a direct computation of the Laplace transform of .
The similarity stops nevertheless here : the windings of around several points of the complex plane do not converge in law after rescaling to independent Cauchy random variables. A precise description of the limiting joint distribution is given in [24, ch. XIII cor. 3.9] and involves a mixing by a random variable that creates a dependency in the limiting angles. In the case of evaluations of random Dirichlet characters, one has the following
Theorem 1.3** (Fluctuations of joint evaluations).**
Let . Let and be fixed prime numbers. Then, under , we have the following convergence in distribution
[TABLE]
where are independent Cauchy-distributed random variables.
It is enough to consider the evaluations in prime numbers by multiplicativity of characters. More general evaluations will be dependent, provided that the numbers in which they are evaluated are not coprime.
1.2. Motivations
Let . The Plancherel measure on the set of Young diagrams with boxes is defined by (see e.g. [17, 21])
[TABLE]
Here, denotes the dimension of the irreducible -module indexed by the Young diagram and is the symmetric group ; this quantity has an explicit expression in terms of , but it can also be written in terms of characters of as its irreducible characters are in bijection with Young diagrams (see [18, I-7]). For , let be the associated irreducible character. A classical formula states (see [18, ch. I-7 (7.6), ch. I-6 ex. 2 (a)])
[TABLE]
where is the identity permutation. This last formula allows to write the Plancherel measure as a measure on characters by setting
[TABLE]
Character evaluations form a natural set of observables for this measure. Using the Dynkin formalism, we define the canonical evaluation on by
[TABLE]
A natural question concerns the behaviour of under for a certain and ; such types of questions gave birth to the field of asymptotic representation theory [17]. In the case where is a -cycle for a fixed integer , one has the fondamental result due to Kerov [14] independently discovered by Hora [13] :
Theorem 1.4** (Gaussian fluctuations of character evaluations (Kerov CLT)).**
Let be a fixed integer and a -cycle. Then, under , one has the following convergence in law
[TABLE]
Moreover, different evaluations for a fixed integer converge to independent Gaussian random variables.
This result concerns the Gaussian fluctuations of the renormalised character, namely . It has been extended in various ways, by computing the speed of convergence in the total variation distance (see [11]), by letting depend on in the cycle (for , see [26] and references cited), by changing the cycle with a product of cycles, in which case the limiting distribution changes radically (see [13, 14]) or by changing the measure (see e.g. [10, 16, 8, 1, 20, 5] and references cited).
This article is in the lineage of these results ; it aims at giving another direction of generalisation of this last analysis by replacing the group with the group . The analogue of the Plancherel measure on will be the uniform measure, which is a limiting case of -measure that we will study separately in section 3.4. The case of the -measure corresponds to the aforementioned other types of measures, particular cases of the Schur measure that we describe in the next section. In this framework, theorems 1.2 and 1.3 are clear analogues of the Kerov CLT, the equivalence betwen disjoint cycles and prime numbers being made in accordance to the usual analogies between permutations and primes (see e.g. [12] or [2, p. 22]). These theorems have nevertheless some disparities : random Dirichlet characters need not be renormalised, and the limiting random variables involve the Cauchy distribution (the stable law of index ) and not the Gaussian one (the stable law of index ).
1.3. Natural analogues of the Plancherel measure on other groups
The first point to investigate when trying to generalise theorem 1.4 to other groups concerns the natural analogue of the Plancherel measure (7). Given its form, the Plancherel measure on is
[TABLE]
as . This is thus the uniform measure on . This measure corresponds to a limiting type of -measure, where we have set in (3) (see section 3.4). For this degenerate type of -measure, the limiting behaviour of the characters evaluations is given by the following theorem proven in section 3.4 :
Theorem 1.5** (Limit in law of the evaluations under ).**
The following convergence in law is satisfied for all fixed integer
[TABLE]
Moreover, converges in law to a vector of independent random variables.
More generally, the Plancherel measure and a wide class of measures studied in [10, 16, 8, 1, 20, 5] are particular specialisations of the following Schur measure restricted to :
[TABLE]
Here, is the Schur function [18, ch. 1-3] evaluated in an alphabet and the normalisation constant is a specialisation of the complete homogeneous functions [18, ch. 1-2]. The prominent Schur measure on the set of all Young diagrams introduced by Okounkov in [22] is an independent randomisation111By a random variable satisfying with . The Schur measure writes . of (9).
The Schur measure writes as a measure on using the Frobenius characteristic (see [18, I-7])
[TABLE]
where are the power functions, a particular type of symmetric functions (see [18, ch. 1-2]) indexed by the cycle-type of a permutation. Write where are the disjoint cycles of and is the total number of cycles. Then, the power functions can be expressed in terms of a family associated with the lenght of a cycle
[TABLE]
with and is the size of the cyle (the number of its elements).
We can thus write
[TABLE]
in the same way as
[TABLE]
The point of importance is to notice that one can write the measure (9) as a measure on by writing, in the same vein as for the Plancherel measure
[TABLE]
The Frobenius characteristic is a linear form on and so is the evaluation ; the common points in all the precedent measures is thus (1) their writing as a product of two linear forms and (2) the coefficients of each linear form that write as a product over the considered structures (cycles or primes).
If one replaces the characters of by characters of another finite group whose elements have a natural notion of decomposition into elementary structures (primes, cycles, etc.), a natural analogue of these measures can hence be defined by means of a product of two real linear forms on of the form
[TABLE]
where is a particular set characteristic of a certain decomposition of and the ’s are real numbers.
The measure (3) is clearly a particular case of (10), but it has only a one-dimensional free parameter ; from this perspective, it is more an analogue of the -measure [8] or the -Plancherel measure [10, 16] than the Schur measure itself. We will come back on this last point in section 4.
1.4. Plan
The plan of this article is the following : after some reminders on characters of both and , we start by comparing random characters under the aforementioned measures and show that they share a similarity of structure ; their evaluations can be written by operators of dilation in both cases, acting on different spaces of square integrable functions. We then study the asymptotic properties of under and prove theorems 1.2 and 1.3. We moreover give the speed of this convergence in the Wasserstein distance (lemma 3.2). We treat in section 3.4 the case of the uniform measure (8) that corresponds to the limiting case of the -measure . Last, we treat in section 4 the case of the analogue of the Schur measure on . We conclude with several questions of interest, extensions and future developments.
This article is the first of a series that investigates -measures on sets of more general characters such as Hecke characters and automorphic representations of .
1.5. Notations
We write for “ divides ” and for “ multiple of ”. We will make a constant use of the multi-index notation if and . We also set for the multi-index factorial. Last, we set for a multi-index. The raising factorial is defined as for and .
We will note for . The Vandermonde determinant is denoted by if and defined by
[TABLE]
For a Laurent series in variables, we write the coefficient of , i.e. with and the unit circle if this last integral converges.
The Euler’s totient function is denoted by and defined for all by
[TABLE]
Here, the product is on the set of prime numbers . Every integer decomposes into a product of primes according to
[TABLE]
where is the -adic valuation of . For a sequence of complex numbers such that , one has the formula, for all
[TABLE]
In particular, for a character , using the prime factor decomposition and the morphism property of , we get the well known Euler formula
[TABLE]
Note that as if , the product on the LHS of the last formula is in fact on the set of primes that do not divide .
Last, we set and we define the multiplicative convolution of two sequences and by
[TABLE]
In particular, we note ( times). We moreover recall that Dirichlet series have the following morphism property for the multiplicative convolution, for and provided that the following series converge
[TABLE]
2. From to
2.1. Reminders on the irreducible characters of
Let be the irreducible character associated to . For , the value of only depends on the cycle type . We denote this value by . The canonical evaluation on the probability space thus becomes . A classical formula for the evaluation of is given by [18, ch. I-7 (7.7)]
[TABLE]
Here, is the power function, and the scalar product can be realised as the classical scalar product for the Haar measure of the unitary group. One has also the following
Lemma 2.1** ([18], (7.8) p. 114).**
Write for the coefficient of in the Laurent series in variables, i.e. with and the unit circle. Then
[TABLE]
For the reader’s benefit, we remind the proof of this result.
Proof.
Using equation (14) and the fact that is an orthonormal basis, one has
[TABLE]
One has moreover (see e.g. [18]) , hence and in particular,
[TABLE]
It thus remains to prove that . But one has
[TABLE]
since the only permutation allowing to have is the identity, the partitions and having strictly increasing parts. ∎
2.2. Moments of characters under the Plancherel measure
Lemma 2.2** (Structure of character evaluations).**
Let . For , define the scalar product
[TABLE]
For all and , set
[TABLE]
We define the operator of anti-dilatation by
[TABLE]
and the following operator
[TABLE]
Using the fact that (as is a polynomial) and the Cauchy-Schwarz inequality, it is easily proven that if .
Last, set
[TABLE]
Then, we have
[TABLE]
Proof.
For and , one has
[TABLE]
Denote and . Last, set
[TABLE]
In this last formula, the variables can have a different size. For instance, one can define
[TABLE]
Then, one has
[TABLE]
Using the formula
[TABLE]
one can check that is autoreproducing with respect to , i.e.
[TABLE]
Writing for to simplify the notation, one thus has
[TABLE]
We define the coordinatewise product of two vectors and by . One can thus write
[TABLE]
Using the function , we have . Then, for all ,
[TABLE]
By induction and using in place of , one has
[TABLE]
Finally, one gets
[TABLE]
Setting in the last formula shows that , hence
[TABLE]
By polarisation,
[TABLE]
∎
Remark 2.3*.*
The Kerov Central Limit Theorem concerns the Gaussian fluctuations of when under (see [14]). As we have the law of the couple with (15), we also have the law of . Nevertheless, the scalar product in (15) involves integrals, and passing to the limit in this expression is not straightforward. This problem will not occur in the case of the -measure.
2.3. Reminders on Dirichlet characters
The content of this section is recalled for self-completeness and is likely to be well-known (see e.g. [15, ch. 5] and references cited or [25, 28]). A character of a group is a group homomorphism , namely for all . The set of characters of forms a group once endowed with the pointwise multiplication and the inverse . If is a finite group of cardinal , all characters take values in the group of -th roots of unity
[TABLE]
as for all and is a group morphism. In this case, the inverse of is given by its complex conjugate, i.e. . In particular, a character here defined corresponds to a particular character of a dimension one representation of a group.
The main property of characters of finite abelian groups is
Theorem 2.4** (Orthogonality, [15, 28]).**
Let be a finite abelian group. Then, a basis of the space of -valued functions on is given by the set of characters that form an orthonormal basis of with respect to the scalar product defined by
[TABLE]
One has moreover . Last, setting for the canonical evaluation on , one has the dual orthogonality relation
[TABLE]
The property (20) uses (19) and the orthogonal basis expansion of the function .
We denote by the group , and, with a slight abuse of notation, the set of Dirichlet characters by . As recalled in the introduction, this is the set of characters of that are extended by periodicity to . The second orthogonality relation (20) becomes thus
[TABLE]
As a Dirichlet character can take the value [math], we define the abstract symbol such that
[TABLE]
that allows to define the angle of a Dirichlet character .
Example 2.5**.**
A classical Dirichlet character is given by the Legendre symbol which is a Dirichlet character modulo . Define and let be the set of squares in . Then,
[TABLE]
Such a function is an analogue on of the sign function defined by .
Remark 2.6*.*
The prime factor decomposition and the chinese remainder theorem could allow to consider the sole case where is an integer power of a prime number.
Associated to a Dirichlet character is the -function defined for by (2). One can extend the definition to by means of a functional equation (see e.g. [28]). Equation (2) defines the linear form on given by
[TABLE]
When is endowed with a probability measure, these linear forms become random variables that we call for the sake of simplicity -random variables.
2.4. Moments of characters under the -measure
In view of (15), a natural question concerns now the properties of the evaluations on . The following lemma shows that the same type of structure occurs.
Lemma 2.7** (Structure of evaluations and -random variables).**
For , define the operators
[TABLE]
We recall that the polylogarithm function is defined for and by
[TABLE]
Define moreover
[TABLE]
Then, one has for all and for all
[TABLE]
Proof.
We only treat the case of -random variables, the case of evaluations being identical.
For , we have
[TABLE]
using the multiplicativity of characters. The orthogonality relation (19) gives then
[TABLE]
Recall the well known equality
[TABLE]
It implies
[TABLE]
Here, we have used the Fubini theorem relative to sums and integrals which is justified by the absolute convergence of the sums for .
Using and , one can thus write
[TABLE]
Since , one can write
[TABLE]
Setting , one finds that and using , one thus has
[TABLE]
Moreover, one has
[TABLE]
so for all . By polarisation and generating series in , one thus finds the result. ∎
Remark 2.8*.*
The auto-reproducing kernel equivalent to (16) is here
[TABLE]
It is autoreproduced for in the sense that
[TABLE]
since we defined in place of (hence the multiplication by ). The autoreproduction is a consequence of the fact that for all .
3. Fluctuations when
3.1. Evaluations
We now prove theorem 1.2.
Proof.
We use the method of moments. We have
[TABLE]
Each term of the ratio has the same form. It is thus enough to prove the convergence of the numerator when . As
[TABLE]
we have a Riemann sum, thus, it is enough to show that the function is continuous and integrable on to get the convergence. This fact is clear, given the form of the function (bounded by on ), hence the result :
[TABLE]
We now identify the limit. Set . Then,
[TABLE]
Note that the case gives .
[TABLE]
Thus, writing for the limiting measure, we get
[TABLE]
The symmetric stable random variable of parameter is defined for all by
[TABLE]
In the particular case of , , a Cauchy-distributed random variable whose Lebesgue-density is given by . Thus,
[TABLE]
hence the result. ∎
Remark 3.1*.*
It is enough to prove the convergence (25) on rational functions of the disk of the type for . Indeed, one has the following integral representation of the polylogarithm
[TABLE]
as and for . Using the Fubini theorem, it is thus enough to prove
[TABLE]
which is clear. As we have moreover
[TABLE]
we end up with the following equality that can be proven with a direct computation
[TABLE]
3.2. Joint evaluations
We now prove theorem 1.3.
Proof.
Set and for and integers. Then,
[TABLE]
Now, recalling that , define
[TABLE]
so that and . We have
[TABLE]
hence the result. ∎
3.3. Speed of convergence in the Wasserstein metric
One can adapt the proof of theorem 1.2 to get the speed of convergence in the Wasserstein distance.
Lemma 3.2** (Speed of convergence in the Wasserstein metric).**
For all bounded continuous functions , we have
[TABLE]
Proof.
We have
[TABLE]
Thus,
[TABLE]
And the case gives
[TABLE]
This implies
[TABLE]
Taking linear combinations on , we deduce that for all real polynomial , we get
[TABLE]
The implicit constant in the does not depend on any parameter. We can thus take a sequence of polynomials that approximate bounded continuous functions and get
[TABLE]
We thus get the result. ∎
Remark 3.3*.*
We also have the integral representation for
[TABLE]
Using , this implies, for all
[TABLE]
where .
This last representation, nevertheless, does not allow to extend analytically as the function is not analytic in [math].
Question 3.4**.**
The results on the speed of convergence of the windings of the complex Brownian motion as exposed in [23, 6] show a speed of convergence in in the total variation distance. If we make the analogy between and , we should thus consider the case . It is possible to give a meaning to the values of -functions in such a number, by means of a functional equation (see e.g. [28]). This raises the question of the behaviour of random characters for in this range of values.
3.4. The case : the uniform measure
3.4.1. Evaluations
Using the classical result
[TABLE]
we can conclude that
[TABLE]
This is the uniform measure on that assigns equal mass to any character. The behaviour of the evaluations under this measure is given in theorem 1.5 that we recall
Theorem 1.5 The following convergence in law is satisfied for all fixed integer
[TABLE]
Moreover, converges in law to a vector of independent random variables.
Proof.
An application of the method of moments and the second orthogonality relation gives
[TABLE]
For the independence, set and for and two sequences of integers. Then,
[TABLE]
which concludes the proof. ∎
We remark that this last convergence does not depend on , as long as does not vary with . This thus asks the
Question 3.5**.**
Describe the phase transition between and , i.e. can we find when with a certain parameter such that converges in law to a non-trivial random variable ?
The law of such a random variable would interpolate between and .
3.4.2. The Bohr-Jessen distribution
An interested question related with the uniform measure is to compute the limiting distribution of , as a classical distribution will appear at the limit :
Theorem 3.6** (Convergence in law of under ).**
Define the Bohr-Jessen law for by
[TABLE]
where is a sequence of i.i.d. uniform random variables on . Then, one has under
[TABLE]
Proof.
We have for all
[TABLE]
hence the convergence in law. To identify the limit, we use
[TABLE]
which is a consequence of the identities, valid for all
[TABLE]
[TABLE]
which concludes the proof. ∎
Remark 3.7*.*
The Bohr-Jessen distribution (27) appeared in [7] when considering the limiting distribution of the random variable for and . When , this is the method of moments that is used. The behaviour inside the strip is studied by means of an approximate functional equation (see [7, II.]).
Remark 3.8*.*
To compute the speed of convergence of the moments, one writes
[TABLE]
To pursue, one needs an equivalent of when . For , we have , the number of divisors of . It is known that for all , hence the speed of convergence
[TABLE]
4. Another type of -measure
As seen in the introduction, the general analogue of the Frobenius characteristic
[TABLE]
is
[TABLE]
where is a sequence of real numbers satisfying and . We thus define the the measure
[TABLE]
These last functions may seem more general, but they do not enjoy, in their full generality, the same properties as the -function, for instance a functional equation that allows to extend them analytically ; hence, in a certain way, the -measures defined in 3 are more general. For a certain choice of parameters , though, one can get -functions of twisted characters (see e.g. [25, 28]).
A more general definition with for instance with is also possible, but the limiting evaluations will not be independent ; in the case of (28), we indeed have the
Theorem 4.1**.**
Let and be fixed prime numbers. Then, under , we have the following convergence in distribution
[TABLE]
where are independent Cauchy-distributed random variables.
Proof.
Set and for and integers. Then, using the second orthogonality relation, the multiplicativity of characters and the property we get
[TABLE]
Define and so that and . We have
[TABLE]
hence the result. ∎
5. Conclusion and perspectives
The probabilistic fluctuations that we have addressed in this article are amongst the most natural questions when one is concerned with a particular model of random variables. In the case of random Dirichlet characters, though, several open questions deserve to be tackled, for instance the phase transition when depends on (question 3.5) or the extension of the range of (question 3.4), not to mention the extension to other types of characters such as characters of function fields, Hecke characters or higher-dimensional representations. One can also restrict the framework to primitive characters only.
Other probabilistic questions of interest concern the large deviations of or its mod-Cauchy convergence (see e.g. [9]) a rescaling of a diverging Fourier transform. In the case of the windings of the complex Brownian motion , one has, locally uniformly in (see [4])
[TABLE]
This result implies the convergence in law towards the Cauchy distribution, and is related with a second-order type of convergence in distribution (see [3]). In the case of , one needs to “rescale” by a diverging factor and look for a convergence of the form
[TABLE]
A last probabilistic question concerns a Markovian coupling in of the considered random variables. On the symmetric group , such a coupling exists for the Schur measure and is related with the notion of induction of a representation (or Pieri rule, see e.g. [17]). In the case of , one can consider for and that varies in to look for such an inductive coupling.
We will tackle these questions in subsequent publications.
Acknowledgements
The author expresses its thanks to the following persons for their useful discussions, corrections and encouragements : Gaëtan Borot, Valentin Féray, Olivier Hénard, Jeffrey Kuan, Mark Masdeu, Joseph Najnudel, Simon Pépin-Lehalleur, Nina Snaith and Nikos Zygouras.
The author was supported by EPSRC grant EP/L012154/1.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. M. Adin, A. Postnikov, Y. Roichman, Combinatorial Gelfand models, J. of Algebra, 320:1311-1325 ( 2008 ).
- 2[2] R. Arratia, A. D. Barbour, and S. Tavaré, Logarithmic combinatorial structures, a probabilistic approach, EMS Monographs in Mathematics, Zürich, Europ. Math. Soc. ( 2003 ).
- 3[3] Y. Barhoumi-Andréani, On Stein’s method and mod-* convergence, preprint https://arxiv.org/pdf/1701.03086 v 1.pdf ( 2017 ).
- 4[4] Y. Barhoumi-Andréani, On the splitting phenomenon in the Sathe-Selberg theorem: universality of the Gamma factor, in preparation ( 2017 ).
- 5[5] P. Biane, Approximate factorization and concentration for characters of symmetric groups, Int. Math. Res. Not. 178(4):179–192 ( 2001 ).
- 6[6] V. Bentkus, G. Pap, M. Yor, Optimal bounds for Cauchy approximations for the winding distribution of planar Brownian motion, J. Theoret. Prob. 16(2):345-361 ( 2003 ).
- 7[7] H. Bohr, B. Jessen, Über die Wertverteilung der Riemannschen Zetafunktion, I. , Acta Mathematica 54:1-35 ( 1930 ), II. , Acta Mathematica 58:1-55 ( 1932 ).
- 8[8] A. Borodin, G. Olshanski, Z 𝑍 Z -measures on partitions, Robinson-Schensted-Knuth correspondence and β = 2 𝛽 2 \beta=2 ensembles, in “Random matrix models and their applications”, P. M. Bleher and A. R. Its eds., MSRI Publications 40:71-94 ar Xiv:math/9905189 ( 2001 ).
