Search arXivSearch

arXiv · math/0010135

Integrable Lattices: Random Matrices and Random Permutations

Abstract

These lectures present a survey of recent developments in the area of random matrices (finite and infinite) and random permutations. These probabilistic problems suggest matrix integrals (or Fredholm determinants), which arise very naturally as integrals over the tangent space to symmetric spaces, as integrals over groups and finally as integrals over symmetric spaces. An important part of these lectures is devoted to showing that these matrix integrals, upon apropriately adding time-parameters, are natural tau-functions for integrable lattices, like the Toda, Pfaff and Toeplitz lattices, but also for integrable PDE's, like the KdV equation. These matrix integrals or Fredholm determinants also satisfy Virasoro constraints, which combined with the integrable equations lead to (partial) differential equations for the original probabilities.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pierre van Moerbeke. 2000-10-13. Integrable Lattices: Random Matrices and Random Permutations. https://arxiv.org/abs/math/0010135

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO