Related papers: GL(n,q) and Increasing Subsequences in Nonuniform …
We improve lower bounds on the $k$th-order nonlinear complexity of pseudorandom sequences over finite fields and we establish a probabilistic result on the behavior of the $k$th-order nonlinear complexity of random sequences over finite…
We study numerically the distributions of the length $L$ of the longest increasing subsequence (LIS) for the two cases of random permutations and of one-dimensional random walks. Using sophisticated large-deviation algorithms, we are able…
Answering a question of Geoff Robinson, we compute the large n limiting proportion of i(n,q)/q^[n^2/2], where i(n,q) denotes the number of involutions in GL(n,q). We give similar results for the finite unitary, symplectic, and orthogonal…
The eigenvalue probability density function of the Gaussian unitary ensemble permits a $q$-extension related to the discrete $q$-Hermite weight and corresponding $q$-orthogonal polynomials. A combinatorial counting method is used to specify…
Seemingly unrelated linear regression models are introduced in which the distribution of the errors is a finite mixture of Gaussian components. Identifiability conditions are provided. The score vector and the Hessian matrix are derived.…
We study the behavior of eigenvalues of matrix P_N + Q_N where P_N and Q_N are two N -by-N random orthogonal projections. We relate the joint eigenvalue distribution of this matrix to the Jacobi matrix ensemble and establish the universal…
Let q be a power of a prime and n a positive integer. Let P(q) be a parabolic subgroup of the finite general linear group GL(n,q). We show that the number of P(q)-conjugacy classes in GL(n,q) is, as a function of q, a polynomial in q with…
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…
Given several number sequences, determining the longest common subsequence is a classical problem in computer science. This problem has applications in bioinformatics, especially determining transposable genes. Nevertheless, related works…
The longest increasing subsequence of a random walk with mean zero and finite variance is known to be $n^{1/2 + o(1)}$. We show that this is not universal for symmetric random walks. In particular, the symmetric Ultra-fat tailed random walk…
We consider irreversible Markov chains on finite commutative rings randomly generated using both addition and multiplication. We restrict ourselves to the case where the addition is uniformly random and multiplication is arbitrary. We first…
We compute the limiting eigenvalue statistics at the edge of the spectrum of large Hermitian random matrices perturbed by the addition of small rank deterministic matrices. To be more precise, we consider random Hermitian matrices with…
We start with a (q,t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is…
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…
It is described the group of arrowy permutations (that is extension of symmetric group) and the consequent process of generation of GL(n) and some its subgroups by this combinatoric group and its subgroups.
This paper reformulates the problem of finding a longest common increasing subsequence of the two given input sequences in a very succinct way. An extremely simple linear space algorithm based on the new formula can find a longest common…
The maximum correlation of functions of a pair of random variables is an important measure of stochastic dependence. It is known that this maximum nonlinear correlation is identical to the absolute value of the Pearson correlation for a…
Let $A$ be a fixed complex matrix and let $u,v$ be two vectors. The eigenvalues of matrices $A+\tau uv^\top $ $(\tau\in\mathbb{R})$ form a system of intersecting curves. The dependence of the intersections on the vectors $u,v$ is studied.
Let $A$ be an integer matrix, and let $f_A$ be the associated monomial map. We give a connection between the eigenvalues of $A$ and existence of a linear recurrence relation in the sequence of degrees.
We study the upper tail of the number of arithmetic progressions of a given length in a random subset of {1,...,n}, establishing exponential bounds which are best possible up to constant factors in the exponent. The proof also extends to…