相关论文: Permutations without long decreasing subsequences …
The work of Vershik and Kerov [1977], Logan and Shepp [1977] established that the shape of the scaled random young diagram in Russian notation, as determined by the Plancherel measure, converges to a deterministic shape. In this article, we…
The authors consider the length, $l_N$, of the length of the longest increasing subsequence of a random permutation of $N$ numbers. The main result in this paper is a proof that the distribution function for $l_N$, suitably centered and…
The Robinson-Schensted-Knuth (RSK) algorithm maps an integer matrix to a pair of semi-standard Young tableaux (SSYTs) whose underlying shape has the same integer partition. We study the set of matrices associated with a given partition…
It is known from the work of Baik, Deift, and Johansson [1999] that we have Tracy-Widom fluctuations for the longest increasing subsequence of uniform permutations. In this paper, we prove that this result holds also in the case of the…
We consider the Robinson-Schensted-Knuth algorithm applied to a random input and investigate the shape of the bumping route (in the vicinity of the $y$-axis) when a specified number is inserted into a large Plancherel-distributed tableau.…
Brualdi and Ma found a connection between involutions of length $n$ with $k$ descents and symmetric $k\times k$ matrices with non-negative integer entries summing to $n$ and having no row or column of zeros. From their main theorem they…
In this article, we consider a generalization of Young tableaux in which we allow some consecutive pairs of cells with decreasing labels. We show that this leads to a rich variety of combinatorial formulas, which suggest that these new…
We prove a limit shape theorem describing the asymptotic shape of bumping routes when the Robinson-Schensted algorithm is applied to a finite sequence of independent, identically distributed random variables with the uniform distribution…
Following [OW16], we continue our analysis of: (1) "Quantum tomography", i.e., learning a quantum state, i.e., the quantum generalization of learning a discrete probability distribution; (2) The distribution of Young diagrams output by the…
We investigate the evolution in time of the position of a fixed number in the insertion tableau when the Robinson-Schensted-Knuth algorithm is applied to a sequence of random numbers. When the length of the sequence tends to infinity, a…
We prove the conjecture of Baik, Deift, and Johansson which says that with respect to the Plancherel measure on the set of partitions of $n$, the 1st, 2nd, and so on, rows behave, suitably scaled, like the 1st, 2nd, and so on, eigenvalues…
We present a probabilistic generalization of the Robinson--Schensted correspondence in which a permutation maps to several different pairs of standard Young tableaux with nonzero probability. The probabilities depend on two parameters $q$…
The discrete distribution of the length of longest increasing subsequences in random permutations of $n$ integers is deeply related to random matrix theory. In a seminal work, Baik, Deift and Johansson provided an asymptotics in terms of…
In this work we are considering the behavior of the limit shape of Young diagrams associated to random permutations on the set $\{1,\dots,n\}$ under a particular class of multiplicative measures. Our method is based on generating functions…
We survey the theory of increasing and decreasing subsequences of permutations. Enumeration problems in this area are closely related to the RSK algorithm. The asymptotic behavior of the expected value of the length is(w) of the longest…
We consider the singular values of certain Young diagram shaped random matrices. For block-shaped random matrices, the empirical distribution of the squares of the singular eigenvalues converges almost surely to a distribution whose moments…
The exponential growth rate of non polynomially growing subgroups of $GL_d$ is conjectured to admit a uniform lower bound. This is known for non-amenable subgroups, while for amenable subgroups it is known to imply the Lehmer conjecture…
We are interested in two random matrix ensembles related to permutations: the ensemble of permutation matrices following Ewens' distribution of a given parameter $\theta >0$, and its modification where entries equal to $1$ in the matrices…
We study the Steinberg variety associated to matrix Schubert varieties, and develop a Robinson-Schensted type correspondence, $\tau\leftrightarrow(\Lambda,\mathsf Q,\mathsf P)$. Here $\tau$ is a partial permutation of size $p\times q$,…
We present equalities in law between the spectra of the minors of a GUE matrix and some maximal functionals of independent Brownian motions. In turn, these results allow to recover the limiting shape (properly centered and scaled) of the…