scholarly journals Permutations Without Long Decreasing Subsequences and Random Matrices

10.37236/929 ◽  
2007 ◽  
Vol 14 (1) ◽  
Author(s):  
Piotr Šniady
Keyword(s):  
Random Matrices ◽  
Young Diagram ◽  
Random Matrix ◽  
Random Permutation ◽  
Fixed Number ◽  
Plancherel Measure ◽  
Young Diagrams ◽  
Gaussian Unitary Ensemble ◽  
Longest Increasing Subsequence ◽  
Unitary Ensemble

We study the shape of the Young diagram $\lambda$ associated via the Robinson–Schensted–Knuth algorithm to a random permutation in $S_n$ such that the length of the longest decreasing subsequence is not bigger than a fixed number $d$; in other words we study the restriction of the Plancherel measure to Young diagrams with at most $d$ rows. We prove that in the limit $n\to\infty$ the rows of $\lambda$ behave like the eigenvalues of a certain random matrix (namely the traceless Gaussian Unitary Ensemble random matrix) with $d$ rows and columns. In particular, the length of the longest increasing subsequence of such a random permutation behaves asymptotically like the largest eigenvalue of the corresponding random matrix.

Introduction and guide to the handbook

2018 ◽  
Author(s):  
Gernot Akemann ◽  
Jinho Baik ◽  
Philippe Di Francesco
Keyword(s):  
Random Matrices ◽  
Random Matrix Theory ◽  
Random Matrix ◽  
Matrix Theory ◽  
The Other ◽  
Random Operators ◽  
New Developments ◽  
Gaussian Unitary Ensemble ◽  
Mathematical Properties ◽  
Unitary Ensemble

This article discusses random matrix theory (RMT) in a nutshell — what it is about, what its main features are, and why it is so successful in applications. It first considers the simplest and maybe most frequently used standard example, the Gaussian Unitary Ensemble (GUE) of random matrices, before looking at several types of applications of RMT, focusing on random operators, counting devices, and RMT without matrices. It then provides a guide to the handbook, explaining how the other forty-two articles on mathematical properties and applications of random matrices are related and built one upon the other. It also lists some topics that are not covered in detail in the book and reviews recent new developments since the first edition of this handbook before concluding with a brief survey of the existing introductory literature.

scholarly journals Replica approach in random matrix theory

2018 ◽  
Author(s):  
Thomas Guhr
Keyword(s):  
Partition Function ◽  
Random Matrix Theory ◽  
Random Matrix ◽  
Matrix Theory ◽  
Field Theories ◽  
Partition Functions ◽  
Gaussian Unitary Ensemble ◽  
Integrable Theory ◽  
Unitary Ensemble ◽  
Replica Approach

This article examines the replica method in random matrix theory (RMT), with particular emphasis on recently discovered integrability of zero-dimensional replica field theories. It first provides an overview of both fermionic and bosonic versions of the replica limit, along with its trickery, before discussing early heuristic treatments of zero-dimensional replica field theories, with the goal of advocating an exact approach to replicas. The latter is presented in two elaborations: by viewing the β = 2 replica partition function as the Toda lattice and by embedding the replica partition function into a more general theory of τ functions. The density of eigenvalues in the Gaussian Unitary Ensemble (GUE) and the saddle point approach to replica field theories are also considered. The article concludes by describing an integrable theory of replicas that offers an alternative way of treating replica partition functions.

scholarly journals Osculating Paths and Oscillating Tableaux

10.37236/731 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
Roger E. Behrend
Keyword(s):  
Young Diagram ◽  
Fixed Number ◽  
Lattice Points ◽  
Lattice Paths ◽  
Square Lattice ◽  
Vertex Model ◽  
Young Diagrams ◽  
Primary Interest ◽  
Alternating Sign Matrices ◽  
Positive Integers

The combinatorics of certain tuples of osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. The paths being considered have fixed start and end points on respectively the lower and right boundaries of a rectangle in the square lattice, each path can take only unit steps rightwards or upwards, and two different paths within a tuple are permitted to share lattice points, but not to cross or share lattice edges. Such path tuples correspond to configurations of the six-vertex model of statistical mechanics with appropriate boundary conditions, and they include cases which correspond to alternating sign matrices. Of primary interest here are path tuples with a fixed number $l$ of vacancies and osculations, where vacancies or osculations are points of the rectangle through which respectively no or two paths pass. It is shown that there exist natural bijections which map each such path tuple $P$ to a pair $(t,\eta)$, where $\eta$ is an oscillating tableau of length $l$ (i.e., a sequence of $l+1$ partitions, starting with the empty partition, in which the Young diagrams of successive partitions differ by a single square), and $t$ is a certain, compatible sequence of $l$ weakly increasing positive integers. Furthermore, each vacancy or osculation of $P$ corresponds to a partition in $\eta$ whose Young diagram is obtained from that of its predecessor by respectively the addition or deletion of a square. These bijections lead to enumeration formulae for tuples of osculating paths involving sums over oscillating tableaux.

scholarly journals Spectral distributions of periodic random matrix ensembles

2019 ◽  
Vol 10 (01) ◽  
pp. 2150011
Author(s):  
Roger Van Peski
Keyword(s):  
Random Matrix ◽  
Spectral Distribution ◽  
Eigenvalue Distribution ◽  
Limiting Spectral Distribution ◽  
Gaussian Unitary Ensemble ◽  
Random Matrix Ensembles ◽  
Spectral Distributions ◽  
Matrix Ensembles ◽  
General Correspondence ◽  
Unitary Ensemble

Koloğlu, Kopp and Miller compute the limiting spectral distribution of a certain class of real random matrix ensembles, known as [Formula: see text]-block circulant ensembles, and discover that it is exactly equal to the eigenvalue distribution of an [Formula: see text] Gaussian unitary ensemble. We give a simpler proof that under very general conditions which subsume the cases studied by Koloğlu–Kopp–Miller, real-symmetric ensembles with periodic diagonals always have limiting spectral distribution equal to the eigenvalue distribution of a finite Hermitian ensemble with Gaussian entries which is a ‘complex version’ of a [Formula: see text] submatrix of the ensemble. We also prove an essentially algebraic relation between certain periodic finite Hermitian ensembles with Gaussian entries, and the previous result may be seen as an asymptotic version of this for real-symmetric ensembles. The proofs show that this general correspondence between periodic random matrix ensembles and finite complex Hermitian ensembles is elementary and combinatorial in nature.

Random growth models

2018 ◽  
Author(s):  
Satya N. Majumdar
Keyword(s):  
Random Matrices ◽  
Growth Model ◽  
Growth Models ◽  
Exclusion Process ◽  
Fixed Time ◽  
Gaussian Unitary Ensemble ◽  
The Family ◽  
Asymmetric Simple Exclusion ◽  
Largest Eigenvalues ◽  
Unitary Ensemble

This article discusses the connection between a particular class of growth processes and random matrices. It first provides an overview of growth model, focusing on the TASEP (totally asymmetric simple exclusion process) with parallel updating, before explaining how random matrices appear. It then describes multi-matrix models and line ensembles, noting that for curved initial data the spatial statistics for large time t is identical to the family of largest eigenvalues in a Gaussian Unitary Ensemble (GUE multi-matrix model. It also considers the link between the line ensemble and Brownian motion, and whether this persists on Gaussian Orthogonal Ensemble (GOE) matrices by comparing the line ensembles at fixed position for the flat polynuclear growth model (PNG) and at fixed time for GOE Brownian motions. Finally, it examines (directed) last passage percolation and random tiling in relation to growth models.

scholarly journals Distribution of the Dirac modes in QCD

2018 ◽  
Vol 175 ◽  
pp. 04005
Author(s):  
M. Catillo ◽  
L. Ya. Glozman
Keyword(s):  
Dirac Operator ◽  
Random Matrix Theory ◽  
Random Matrix ◽  
General Property ◽  
Matrix Theory ◽  
Spontaneous Breaking ◽  
Gaussian Unitary Ensemble ◽  
Zero Modes ◽  
Dynamical Simulations ◽  
Unitary Ensemble

It was established that distribution of the near-zero modes of the Dirac operator is consistent with the Chiral Random Matrix Theory (CRMT) and can be considered as a consequence of spontaneous breaking of chiral symmetry (SBCS) in QCD. The higherlying modes of the Dirac operator carry information about confinement physics and are not affected by SBCS. We study distributions of the near-zero and higher-lying modes of the overlap Dirac operator within NF = 2 dynamical simulations. We find that distributions of both near-zero and higher-lying modes are the same and follow the Gaussian Unitary Ensemble of Random Matrix Theory. This means that randomness, while consistent with SBCS, is not a consequence of SBCS and is related to some more general property of QCD in confinement regime.

Sign in / Sign up

Export Citation Format

Share Document