Related papers: The Expected Order of a Random Unitary Matrix

Drmota and Stufler proved recently that the expected number of pattern occurrences of a given map is asymptotically linear when the number of edges goes to infinity. In this paper we improve their result by means of a different method. Our…

We consider a uniform distribution on the set $\mathcal{M}_k$ of moments of order $k \in \mathbb{N}$ corresponding to probability measures on the interval $[0,1]$. To each (random) vector of moments in $\mathcal{M}_{2n-1}$ we consider the…

Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refinement of this algorithm that is designed to output…

Averaging physical quantities over Lie groups appears in many contexts across the rapidly developing branches of physics like quantum information science or quantum optics. Such an averaging process can be always represented as averaging…

Given a finite group $G$ of order $n.$ Denote the sum of the inverse-power of element orders in $G$ by $m(G).$ Let $\mathbb{Z}_n$ be the cyclic group of order $n.$ Suppose $G$ is a non-cyclic group of order $n$ then we show that $m(G)\geq…

In order to study how well a finite group might be generated by repeated random multiplications, P. Diaconis suggested the following urn model. An urn contains some balls labeled by elements which generate a group G. Two are drawn at random…

We consider the problem of inserting a new item into an ordered list of N-1 items. The length of an algorithm is measured by the number of comparisons it makes between the new item and items already on the list. Classically, determining the…

We give estimates for the expectation of the norm of random matrices with independent but not necessarily identically distributed entries.

We prove a theorem giving the asymptotic number of binary quartic forms having bounded invariants; this extends, to the quartic case, the classical results of Gauss and Davenport in the quadratic and cubic cases, respectively. Our…

Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with decreasing probability of order $n^{-\alpha}$, $0 < \alpha < 1/2$. We prove that, almost surely, for every measure-preserving system…

Suppose the edges of the complete graph on $n$ vertices are assigned a uniformly chosen random ordering. Let $X$ denote the corresponding number of Hamiltonian paths that are increasing in this ordering. It was shown in a recent paper by…

If X is a non-empty subset of a finite group G, we denote by o(x) the order of x in G. Then we put The number o(X) is called the average order of X. Zapirain in 2011 , posed the following question: Let G be a finite (p-) group and N a…

Continuing the computations of the previous paper,[1], we calculate another approximation to the expectation value of the product of two permanents in the ensemble of 0-1 n x n matrices with like row and column sums equal r uniformly…

Let $\text{U}(n,\mathbb{F}_{q^2})$ denote the subgroup of unitary matrices of the general linear group $\text{GL}(n,\mathbb{F}_{q^2})$ which fixes a Hermitian form and $M\geq 2$ an integer. This is a companion paper to the previous works…

The probability that $m$ randomly chosen elements of a finite power associative loop $C$ have prescribed orders and generate $C$ is calculated in terms of certain constants related to the action of $Aut(C)$ on the subloop lattice of $C$. As…

Let $M$ be a random matrix chosen according to Haar measure from the unitary group $\mathrm{U}(n,\mathbb{C})$. Diaconis and Shahshahani proved that the traces of $M,M^2,\ldots,M^k$ converge in distribution to independent normal variables as…

We give an efficient algorithm for the enumeration up to isomorphism of the inverse semigroups of order n, and we count the number S(n) of inverse semigroups of order n<=15. This improves considerably on the previous highest-known value…

We consider a dominance order on positive vectors induced by the elementary symmetric polynomials. Under this dominance order we provide conditions that yield simple proofs of several monotonicity questions. Notably, our approach yields a…

Given positive integers $n$ and $m$, let $p_n(m)$ be the probability that a uniform random permutation of $[n]$ has order exactly $m$. We show that, as $n \to \infty$, the maximum of $p_n(m)$ over all $m$ is asymptotic to $1/n$, the…

We give an algorithm to solve the quantum hidden subgroup problem for maximal cyclic non-normal subgroups of the affine group of a finite field (if the field has order $q$ then the group has order $q(q-1)$) with probability $1-\varepsilon$…