Related papers: Random Words, Toeplitz Determinants and Integrable…
We consider the distributions of the lengths of the longest weakly increasing and strongly decreasing subsequences in words of length N from an alphabet of k letters. We find Toeplitz determinant representations for the exponential…
This paper, a continuation of math.CO/9909169, connects the analysis of the length of the longest weakly increasing subsequence of inhomogeneous random words to a Riemann-Hilbert problem and an associated system of integrable PDEs. In…
Consider the ensemble of Real Symmetric Toeplitz Matrices, each entry iidrv from a fixed probability distribution p of mean 0, variance 1, and finite higher moments. The limiting spectral measure (the density of normalized eigenvalues)…
We consider an $N \times N$ random symmetric Toeplitz matrix with an i.i.d. input sequence drawn from a distribution that lies in the domain of attraction of an $\alpha$-stable law for $0 < \alpha < 2$. We show that under an appropriate…
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…
In testing the independence of two Gaussian populations, one computes the distribution of the sample canonical correlation coefficients, given that the actual correlation is zero. The "Laplace transform" of this distribution is not only an…
Let $(X_n)_{n\ge 0}$ be an irreducible, aperiodic, and homogeneous binary Markov chain and let $LI_n$ be the length of the longest (weakly) increasing subsequence of $(X_k)_{1\le k \le n}$. Using combinatorial constructions and weak…
Let $(X_k)_{k\geq 1}$ and $(Y_k)_{k\geq 1}$ be two independent sequences of i.i.d. random variables, with values in a finite and totally ordered alphabet $\mathcal{A}_m:=\{1,\dots,m\}$, and having respective probability mass function…
Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we investigate the notion of uniform distribution of letters…
In the present paper we investigate the limiting behaviour of short incomplete Gauss sums at random argument as the number of terms goes to infinity. We prove that the limit distribution is given by the distribution of theta sums and…
Connections between longest increasing subsequences in random permutations and eigenvalues of random matrices with complex entries have been intensely studied. This note applies properties of random elements of the finite general linear…
It has been conjectured by W. Chen that the distribution of the length of the longest increasing subsequence in a uniformly random permutation is log-concave. We propose a stronger version of this conjecture which involves the Kronecker…
We study a tight Bennett-type concentration inequality for sums of heterogeneous and independent variables, defined as a one-dimensional minimization. We show that this refinement, which outperforms the standard known bounds, remains…
We relate the distribution of eigenvalues of a random symmetric matrix in the Gaussian Orthogonal Ensemble to the distribution of critical values of a random linear combination of eigenfunctions of the Laplacian on a compact Riemann…
Let $X=(X_i)_{i\ge 1}$ and $Y=(Y_i)_{i\ge 1}$ be two sequences of independent and identically distributed (iid) random variables taking their values, uniformly, in a common totally ordered finite alphabet. Let LCI$_n$ be the length of the…
Consider the ensemble of real symmetric Toeplitz matrices, each independent entry an i.i.d. random variable chosen from a fixed probability distribution p of mean 0, variance 1, and finite higher moments. Previous investigations showed that…
We derive simple linear, inhomogeneous recurrences for the variance of the index by utilising the fact that the generating function for the distribution of the number of positive eigenvalues of a Gaussian unitary ensemble is a…
Given an infinite linear group with a finite set of generators, we show that the shortest word length of an element of infinite order has an upper bound that depends only on the number of generators and the degree. This provides a…
Random matrices whose entries come from a stationary Gaussian process are studied. The limiting behavior of the eigenvalues as the size of the matrix goes to infinity is the main subject of interest in this work. It is shown that the…
Let $(X_i)_{i \geq 1}$ and $(Y_i)_{i\geq1}$ be two independent sequences of independent identically distributed random variables taking their values in a common finite alphabet and having the same law. Let $LC_n$ be the length of the…