相关论文: GL(n,q) and Increasing Subsequences in Nonuniform …

Random matrix theory allows one to deduce the eigenvalue spectrum of a large matrix given only statistical information about its elements. Such results provide insight into what factors contribute to the stability of complex dynamical…

We present some Markovian approaches to prove universality results for some functions on the symmetric group. Some of those statistics are already studied in [Kammoun, 2018, 2020] but not the general case. We prove, in particular, that the…

Correlation function of complex eigenvalues of N by N random matrices drawn from non-Hermitean random matrix ensemble of symplectic symmetry is given in terms of a quaternion determinant. Spectral properties of Gaussian ensembles are…

Let $\pi$ be a permutation of $[n]=\{1,\dots,n\}$ and denote by $\ell(\pi)$ the length of a longest increasing subsequence of $\pi$. Let $\ell_{n,k}$ be the number of permutations $\pi$ of $[n]$ with $\ell(\pi)=k$. Chen conjectured that the…

We compute the limit distribution for (centered and scaled) length of the longest increasing subsequence of random colored permutations. The limit distribution function is a power of that for usual random permutations computed recently by…

A known result for the finite general linear group $\GL(n,\FF_q)$ and for the finite unitary group $\U(n,\FF_{q^2})$ posits that the sum of the irreducible character degrees is equal to the number of symmetric matrices in the group. Fulman…

We study multiplicities of unipotent characters in tensor products of unipotent characters of GL(n,q). We prove that these multiplicities are polynomials in q with non-negative integer coefficients. We study the degree of these polynomials…

Motivated by the importance ascribed to correlations in random matrices used to model phenomena in various scientific disciplines, we report how algebraic correlations between matrix elements affect the eigenvalue statistics and spectral…

We extend our previous study of Markov chains on finite commutative rings (arXiv:1605.05089) to arbitrary finite rings with identity. At each step, we either add or multiply by a randomly chosen element of the ring, where the addition…

We introduce the new concept of joint nonlinear complexity for multisequences over finite fields and we analyze the joint nonlinear complexity of two families of explicit inversive multisequences. We also establish a probabilistic result on…

We consider the distribution of the length of the longest subsequence avoiding a given pattern in a random permutation of length n. The well-studied case of a longest increasing subsequence corresponds to avoiding the pattern 21. We show…

We construct explicit formulae for the eigenvalues of certain invariants of the Lie superalgebra gl(m|n) using characteristic identities. We discuss how such eigenvalues are related to reduced Wigner coefficients and the reduced matrix…

Statistical properties of eigenvectors in non-Hermitian random matrix ensembles are discussed, with an emphasis on correlations between left and right eigenvectors. Two approaches are described. One is an exact calculation for Ginibre's…

The order sequence of a finite group $G$ is a non-decreasing finite sequence formed of the element orders of $G$. Several properties of order sequences were studied by P. J. Cameron and H. K. Dey in a recent paper that concludes with a list…

I present here some results on the statistical behaviour of large random matrices in an ensemble where the probability distribution is not a function of the eigenvalues only. The perturbative expansion can be cast in a closed form and the…

We study higher order convexity properties of random point sets in the unit square. Given $n$ uniform i.i.d random points, we derive asymptotic estimates for the maximal number of them which are in $k$-monotone position, subject to mild…

Frequent pattern mining is widely used to find ``important'' or ``interesting'' patterns in data. While it is not easy to mathematically define such patterns, maximal frequent patterns are promising candidates, as frequency is a natural…

The length is(w) of the longest increasing subsequence of a permutation w in the symmetric group S_n has been the object of much investigation. We develop comparable results for the length as(w) of the longest alternating subsequence of w,…

We consider large random matrices with a general slowly decaying correlation among its entries. We prove universality of the local eigenvalue statistics and optimal local laws for the resolvent away from the spectral edges, generalizing the…

Consider a deterministic self-adjoint matrix X_n with spectral measure converging to a compactly supported probability measure, the largest and smallest eigenvalues converging to the edges of the limiting measure. We perturb this matrix by…