Searcharxiv⌕ Search

arXiv subjects

Alexei Borodin

Publications and source records attributed to Alexei Borodin.

At least 127 records · Page 7Linked to original sources

Representation theory and random point processes

We discuss a connection between two areas of mathematics which until recently seemed to be rather distant from each other: (1) noncommutative harmonic analysis on groups and (2) some topics in probability theory related to random point processes. In order to make the paper accessible to readers not familiar with either of these areas, we explain all needed basic concepts. This is an extended version of G.Olshanski's talk at the 4th European Congress of Mathematics.

math.RT↗

Janossy Densities I. Determinantal Ensembles

We derive an elementary formula for Janossy densities for determinantal point processes with a finite rank projection-type kernel. In particular, for beta=2 polynomial ensembles of random matrices we show that the Janossy densities on an interval I can be expressed in terms of the Christoffel-Darboux kernel for the orthogonal polynomials on the complement of I.

math-ph↗

Random partitions and the Gamma kernel

We study the asymptotics of certain measures on partitions (the so-called z-measures and their relatives) in two different regimes: near the diagonal of the corresponding Young diagram and in the intermediate zone between the diagonal and the edge of the Young diagram. We prove that in both cases the limit correlation functions have determinantal form with a correlation kernel which depends on two real parameters. In the first case the correlation kernel is discrete, and it has a simple expression in terms of the gamma functions. In the second case the correlation kernel is continuous and translationally invariant, and it can be a written as a ratio of two suitably scaled hyperbolic sines.

math-ph↗

Z-measures on partitions and their scaling limits

We study certain probability measures on partitions of n=1,2,..., originated in representation theory, and demonstrate their connections with random matrix theory and multivariate hypergeometric functions. Our measures depend on three parameters including an analog of the beta parameter in random matrix models. Under an appropriate limit transition as n goes to infinity, our measures converge to certain limit measures, which are of the same nature as one-dimensional log-gas with arbitrary beta>0. The first main result says that averages of products of ``characteristic polynomials'' with respect to the limit measures are given by the multivariate hypergeometric functions of type (2,0). The second main result is a computation of the limit correlation functions for the even values of beta.

math-ph↗

Isomonodromy transformations of linear systems of difference equations

We introduce and study isomonodromy transformations of the matrix linear difference equation Y(z+1)=A(z)Y(z) with polynomial (or rational) A(z). Our main result is a construction of an isomonodromy action of Z^{m(n+1)-1} on the space of coefficients A(z) (here m is the size of matrices and n is the degree of A(z)). The (birational) action of certain rank n subgroups can be described by difference analogs of the classical Schlesinger equations, and we prove that for generic initial conditions these difference Schlesinger equations have a unique solution. We also show that both the classical Schlesinger equations and the Schlesinger transformations known in the isomonodromy theory, can be obtained as limits of our action in two different limit regimes. Similarly to the continuous case, for m=n=2 the difference Schlesinger equations and their q-analogs yield discrete Painleve equations; examples include dPII, dPIV, dPV, and q-PVI.

math.CA↗

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

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

math-ph↗

Distribution of the first particle in discrete orthogonal polynomial ensembles

We show that the distribution function of the first particle in a discrete orthogonal polynomial ensemble can be obtained through a certain recurrence procedure, if the (difference or q-) log-derivative of the weight function is rational. In a number of classical special cases the recurrence procedure is equivalent to the difference and q-Painleve equations of chao-dyn/9507010, [Sakai]. Our approach is based on the formalism of discrete integrable operators and discrete Riemann--Hilbert problems developed in math.CO/9912093, math-ph/0111008.

math-ph↗

Harmonic analysis on the infinite-dimensional unitary group and determinantal point processes

The infinite-dimensional unitary group U(infinity) is the inductive limit of growing compact unitary groups U(N). In this paper we solve a problem of harmonic analysis on U(infinity) stated in the previous paper math/0109193. The problem consists in computing spectral decomposition for a remarkable 4-parameter family of characters of U(infinity). These characters generate representations which should be viewed as analogs of nonexisting regular representation of U(infinity). The spectral decomposition of a character of U(infinity) is described by the spectral measure which lives on an infinite-dimensional space Omega of indecomposable characters. The key idea which allows us to solve the problem is to embed Omega into the space of point configurations on the real line without 2 points. This turns the spectral measure into a stochastic point process on the real line. The main result of the paper is a complete description of the processes corresponding to our concrete family of characters. We prove that each of the processes is a determinantal point process. That is, its correlation functions have determinantal form with a certain kernel. Our kernels have a special `integrable' form and are expressed through the Gauss hypergeometric function. In simpler situations of harmonic analysis on infinite symmetric group and harmonic analysis of unitarily invariant measures on infinite hermitian matrices similar results were obtained in our papers math/9810015, math/9904010, math-ph/0010015.

math.RT↗

Discrete gap probabilities and discrete Painleve equations

We prove that Fredholm determinants of the form det(1-K_s), where K_s is the restriction of either the discrete Bessel kernel or the discrete {}_2F_1 kernel to {s,s+1,...}, can be expressed through solutions of discrete Painleve II and V equations, respectively. These Fredholm determinants can also be viewed as distribution functions of the first part of the random partitions distributed according to a poissonized Plancherel measure and a z-measure, or as normalized Toeplitz determinants with symbols exp(η(u+1/u)) and (1+u)^z(1+ξ/u)^{z'}. The proofs are based on a general formalism involving discrete integrable operators and discrete Riemann-Hilbert problem. A continuous version of the formalism has been worked out in math-ph/0111007.

math-ph↗

Asymptotic representation theory and Riemann-Hilbert problem

We show how the Riemann-Hilbert problem can be used to compute correlation kernels for determinantal point processes arising in different models of asymptotic combinatorics and representation theory. The Whittaker kernel and the discrete Bessel kernel are computed as examples.

math.RT↗

Duality of orthogonal polynomials on a finite set

We prove a certain duality relation for orthogonal polynomials defined on a finite set. The result is used in a direct proof of the equivalence of two different ways of computing the correlation functions of a discrete orthogonal polynomial ensemble.

math.CA↗

Infinite random matrices and ergodic measures

We introduce and study a 2-parameter family of unitarily invariant probability measures on the space of infinite Hermitian matrices. We show that the decomposition of a measure from this family on ergodic components is described by a determinantal point process on the real line. The correlation kernel for this process is explicitly computed. At certain values of parameters the kernel turns into the well-known sine kernel which describes the local correlation in Circular and Gaussian Unitary Ensembles. Thus, the random point configuration of the sine process is interpreted as the random set of ``eigenvalues'' of infinite Hermitian matrices distributed according to the corresponding measure.

math-ph↗

Riemann-Hilbert problem and the discrete Bessel kernel

We use discrete analogs of Riemann-Hilbert problem's methods to derive the discrete Bessel kernel which describes the poissonized Plancherel measures for symmetric groups. To do this we define discrete analogs of a Riemann-Hilbert problem and of an integrable integral operator and show that computing the resolvent of a discrete integrable operator can be reduced to solving a corresponding discrete Riemann-Hilbert problem. We also give an example, explicitly solvable in terms of classical special functions, when a discrete Riemann-Hilbert problem converges in a certain scaling limit to a conventional one; the example originates from the representation theory of the infinite symmetric group.

math.CO↗

Harmonic functions on multiplicative graphs and interpolation polynomials

We construct examples of nonnegative harmonic functions on certain graded graphs: the Young lattice and its generalizations. Such functions first emerged in harmonic analysis on the infinite symmetric group. Our method relies on multivariate interpolation polynomials associated with Schur's S and P functions and with Jack symmetric functions. As a by-product, we compute certain Selberg-type integrals.

math.CO↗

Asymptotics of Plancherel measures for symmetric groups

We consider the asymptotics of the Plancherel measures on partitions of $n$ as $n$ goes to infinity. We prove that the local structure of a Plancherel typical partition (which we identify with a Young diagram) in the middle of the limit shape converges to a determinantal point process with the discrete sine kernel. On the edges of the limit shape, we prove that the joint distribution of suitably scaled 1st, 2nd, and so on rows of a Plancherel typical diagram converges to the corresponding distribution for eigenvalues of random Hermitian matrices (given by the Airy kernel). This proves a conjecture due to Baik, Deift, and Johansson by methods different from the Riemann-Hilbert techniques used in their original papers math.CO/9810105 and math.CO/9901118 and from the combinatorial approach proposed by Okounkov in math.CO/9903176. Our approach is based on an exact determinantal formula for the correlation functions of the poissonized Plancherel measures involving a new kernel on the 1-dimensional lattice. This kernel is expressed in terms of Bessel functions and we obtain it as a degeneration of the hypergeometric kernel from the paper math.RT/9904010 by Borodin and Olshanski. Our asymptotic analysis relies on the classical asymptotic formulas for the Bessel functions and depoissonization techniques.

math.CO↗

A Fredholm determinant formula for Toeplitz determinants

We prove a formula expressing a general n by n Toeplitz determinant as a Fredholm determinant of an operator 1-K acting on l_2({n,n+1,...}), where the kernel K admits an integral representation in terms of the symbol of the original Toeplitz matrix. The proof is based on the results of one of the authors, see math.RT/9907127, and a formula due to Gessel which expands any Toeplitz determinant into a series of Schur functions. We also consider 3 examples where the kernel involves the Gauss hypergeometric function and its degenerations.

math.CA↗

Z-Measures on partitions, Robinson-Schensted-Knuth correspondence, and beta=2 random matrix ensembles

We suggest an hierarchy of all the results known so far about the connection of the asymptotics of combinatorial or representation theoretic problems with ``beta=2 ensembles'' arising in the random matrix theory. We show that all such results are, essentially, degenerations of one general situation arising from so-called generalized regular representations of the infinite symmetric group.

math.CO↗