Related papers: The Expected Order of a Random Unitary Matrix

For any irreducible quadratic polynomial f(x) in Z[x] we obtain the estimate log l.c.m.(f(1),...,f(n))= n log n + Bn + o(n) where B is a constant depending on f.

We prove uniform estimates for the expected value of averages of order statistics of matrices in terms of their largest entries. As an application, we obtain similar probabilistic estimates for $\ell_p$ norms via real interpolation.

For every positive integer $n$ and for every $\alpha \in [0, 1]$, let $\mathcal{B}(n, \alpha)$ denote the probabilistic model in which a random set $\mathcal{A} \subseteq \{1, \dots, n\}$ is constructed by picking independently each element…

In the paper, a regenerative process $\{X_n:n\in\mathbb{N}\}$ with finite mean cycle length is considered. For~$M_n^{(q)}$ denoting the $q$-th largest value in $\{X_k : 1\leqslant k \leqslant n\}$, we prove that \begin{equation*}…

We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…

We study the distribution of the order of a random permutation of $[n]$ through the lens of R\'enyi entropy. In particular, we obtain an asymptotic for the R\'enyi $q$-entropy of the order in the full range $1 \leq q \leq \infty$. For $q >…

Given a finitely generated multiplicative subgroup of rational numbers $\Gamma$, assuming the Generalized Riemann Hypothesis, we determine an asymptotic formula for average over prime numbers, powers of the order of the reduction group…

We establish new estimates for the number of $m$-smooth polynomials of degree $n$ over a finite field $\mathbb{F}_q$, where the main term involves the number of $m$-smooth permutations on $n$ elements. Our estimates imply that the…

Define a random variable $\xi_n$ by choosing a conjugacy class $C$ of the Sylow $p$-subgroup of $S_{p^n}$ by random, and let $\xi_n$ be the logarithm of the order of an element in $C$. We show that $\xi_n$ has bounded variance and mean…

Let $l$ and $m$ be two integers with $l>m\ge 0$, and let $a$ and $b$ be integers with $a\ge 1$ and $a+b\ge 1$. In this paper, we prove that $\log {\rm lcm}_{mn<i\le ln}\{ai+b\} =An+o(n)$, where $A$ is a constant depending on $l, m$ and $a$.

It is well known that the proportion of pairs of elements of $\operatorname{SL}(n,q)$ which generate the group tends to $1$ as $q^n\to \infty$. This was proved by Kantor and Lubotzky using the classification of finite simple groups. We give…

We prove that $d(G) \log |G| = O(n^2 \log q)$ for irreducible subgroups $G$ of GL$(n,q)$, and estimate the associated constants. The result is motivated by attempts to bound the complexity of computing the automorphism groups of various…

In this paper we consider the density of maximal order elements in $\mathrm{GL}_n(q)$. Fixing any of the rank $n$ of the group, the characteristic $p$ or the degree $r$ of the extension of the underlying field $\mathbb{F}_q$ of size…

An ordered set-partition (or preferential arrangement) of n labeled elements represents a single ``hierarchy''; these are enumerated by the ordered Bell numbers. In this note we determine the number of ``hierarchical orderings'' or…

A random graph order is a partial order achieved by independently sprinkling relations on a vertex set (each with probability $p$) and adding relations to satisfy the requirement of transitivity. A \textit{post} is an element in a partially…

Let $l$ and $m$ be two integers with $l>m\ge 0$, and let $f(x)$ be the product of two linear polynomials with integer coefficients. In this paper, we show that $\log {\rm lcm}_{mn<i\le ln}\{f(i)\}=An+o(n)$, where $A$ is a constant depending…

Let $r > 0$ be an integer, let $\mathbb{F}_q$ be a finite field of $q$ elements, and let $\mathcal{A}$ be a nonempty proper subset of $\mathbb{F}_q$. Moreover, let $\mathbf{M}$ be a random $m \times n$ rank-$r$ matrix over $\mathbb{F}_q$…

Consider an i.i.d. sequence of random variables whose distribution f* lies in one of a nested family of models M_q, q>=1. The smallest index q* such that M_{q*} contains f* is called the model order. We establish strong consistency of the…

In many data analysis pipelines, a basic and time-consuming process is to produce join results and feed them into downstream tasks. Numerous enumeration algorithms have been developed for this purpose. To be a statistically meaningful…

We find a two term asymptotic expansion for the optimal expected value of a sequentially selected monotone subsequence from a random permutation of length n. A striking feature of this expansion is that tells us that the expected value of…