Related papers: The Expected Order of a Random Unitary Matrix

We describe estimators $\chi_n(X_0,X_1,...,X_n)$, which when applied to an unknown stationary process taking values from a countable alphabet ${\cal X}$, converge almost surely to $k$ in case the process is a $k$-th order Markov chain and…

We compute the limit distribution of partial transposes (when both the number and the size of blocks tends to infinity) for a large class of ensembles of unitarily invariant random matrices. Furthermore, it is shown the asymptotic freeness…

In this paper, we present the asymptotic distribution of M-estimators for parameters in non-stationary AR(p) processes. The innovations are assumed to be in the domain of attraction of a stable law with index $0<\alpha\le2$. In particular,…

In this article, we consider the estimation of the marginal distributions for pairs of data are recorded, with unobserved order in each pair. New estimators are proposed and their asymptotic properties are established, by proving a…

We consider the group M of all polynomial matrices U(z) = U0 + U1*z + U2*z*z +...+Uk*z*...*z, k=0,1,... that satisfy equation U(z)*D*U(z)" = D with the diagonal n*n matrix D=diag{-1,1,1,...1}. Here n > 1, U(z)" = U0" + U1"*z + U2"*z*z +…

Many models for chaotic systems consist of joining two integrable systems with incompatible constants of motion. The quantum counterparts of such models have a propagator which factorizes into two integrable parts. Each part can be…

Using the Generalized Maximium Entropy Principle based on the nonextensive q entropy a new family of random matrix ensembles is generated. This family unifies previous extensions of Random Matrix Theory and gives rise to an orthogonal…

We obtain an asymptotic formula in q for the number of MDS codes of length n and dimension k over a finite field with q elements.

We prove an asymptotic estimate for the number of mxn non-negative integer matrices (contingency tables) with prescribed row and column sums and, more generally, for the number of integer feasible flows in a network. Similarly, we estimate…

Matrix completion algorithms recover a low rank matrix from a small fraction of the entries, each entry contaminated with additive errors. In practice, the singular vectors and singular values of the low rank matrix play a pivotal role for…

Let M be a compact smooth manifold of dimension n with or without boundary, and f : M $\rightarrow$ R be a smooth Gaussian random field. It is very natural to suppose that for a large positive real u, the random excursion set {f $\ge$ u} is…

We compute the asymptotics of matrix elements in canonical bases of irreducible representations of the unitary group as the highest weight goes to infinity, in terms of the symplectic geometry of the associated coadjoint orbit. This uses…

We point out an asymptotic formula for the power moments of the function $a(n)$, representing the number of non-isomorphic Abelian groups of order $n$. For the quadratic moment this improves an earlier result due to L. Zhang, M. L\"u and W.…

Let t[n] be a sequence that satisfies a first order homogeneous recurrence t[n] = Q[n]*t[n-1], where Q is a polynomial with integer coefficients. The asymptotic behavior of the p-adic valuation of t[n] is described under the assumption that…

Assuming the Riemann Hypothesis we obtain asymptotic estimates for the mean value of the number of representations of an integer as a sum of two primes. By proving a corresponding Omega-term, we prove that our result is essentially the best…

A weighted U-statistic based on a random sample X_1,...,X_n has the form U_n=\sum_{1\le i,j\le n}w_{i-j}K(X_i,X_j), where K is a fixed symmetric measurable function and the w_i are symmetric weights. A large class of statistics can be…

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…

We study asymptotic clustering of zeros of random polynomials, and show that the expected discrepancy of roots of a polynomial of degree $n$, with not necessarily independent coefficients, decays like $\sqrt{\log n/n}$. Our proofs rely on…

Multiplicative order of an element $a$ of group $G$ is the least positive integer $n$ such that $a^n=e$, where $e$ is the identity element of $G$. If the order of an element is equal to $|G|$, it is called generator or primitive root. This…

In this note we give a combinatorial and non-computational proof of the asymptotics of the integer moments of the moments of the characteristic polynomials of Haar distributed unitary matrices as the size of the matrix goes to infinity.…