English
Related papers

Related papers: The Expected Order of a Random Unitary Matrix

200 papers

Let P_{n,m} denote the graph taken uniformly at random from the set of all planar graphs on {1,2,..., n} with exactly m(n) edges. We use counting arguments to investigate the probability that P_{n,m} will contain given components and…

Combinatorics · Mathematics 2011-01-27 Chris Dowden

Let s,t,m,n be positive integers such that sm=tn. Let M(m,s;n,t) be the number of m x n matrices over {0,1,2,...} with each row summing to s and each column summing to t. Equivalently, M(m,s;n,t) counts 2-way contingency tables of order m x…

Combinatorics · Mathematics 2009-06-12 E. Rodney Canfield , Brendan D. McKay

We compute the expected number of commutations appearing in a reduced word for the longest element in the symmetric group. The asymptotic behavior of this value is analyzed and shown to approach the length of the permutation, meaning that…

Combinatorics · Mathematics 2015-03-03 Bridget Eileen Tenner

Let $o(G)$ be the average order of the elements of $G$, where $G$ is a finite group. We show that there is no polynomial lower bound for $o(G)$ in terms of $o(N)$, where $N\trianglelefteq G$, even when $G$ is a prime-power order group and…

Group Theory · Mathematics 2020-09-18 E. I. Khukhro , A. Moretó , M. Zarrin

A simple method to produce a random order type is to take the order type of a random point set. We conjecture that many probability distributions on order types defined in this way are heavily concentrated and therefore sample inefficiently…

Computational Geometry · Computer Science 2020-06-05 Olivier Devillers , Philippe Duchon , Marc Glisse , Xavier Goaoc

We study semiorders induced by points drawn from a uniform random distribution. Of particular interest in this paper are the probabilities of generating specific semiorders and the equivalence classes they produce. We present a method for…

Combinatorics · Mathematics 2025-09-25 Csaba Biró , Caroline E. Boone

We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moore's state minimization algorithm is in O(n log n). Moreover this bound…

Data Structures and Algorithms · Computer Science 2009-02-09 Frédérique Bassino , Julien David , Cyril Nicaud

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…

Group Theory · Mathematics 2017-02-24 Jason Fulman , Robert Guralnick , Dennis Stanton

We prove uniform estimates for the expected value of averages of order statistics of bivariate functions in terms of their largest values by a direct analysis. As an application, uniform estimates for the expected value of averages of order…

Probability · Mathematics 2018-10-03 Richard Lechner , Markus Passenbrunner , Joscha Prochno

We obtain asymptotic results on the average numbers of Goldbach representations of an interger as the sum of two primes in different arithmetic progressions. We also prove an omega-result showing that the asymptotic result is essentially…

Number Theory · Mathematics 2025-05-02 Thi Thu Nguyen

We investigate the sums $\sum_{n\le X, (n,q)=1}\frac{\mu(n)}{n^s}\log^k\left(\frac{X}{n}\right)$, where $k\in\{0,1\}$, $s\in\mathbb{C}$, $\Re s>0$. Our goal is to obtain explicit asymptotic estimations for these quantities. To achieve this,…

Number Theory · Mathematics 2026-01-13 Olivier Ramaré , Sebastian Zuniga Alterman

An estimate of the order of approximation in the central limit theorem for strictly stationary associated random variables with finite moments of order q > 2 is obtained. A moderate deviation result is also obtained. We have a refinement of…

Probability · Mathematics 2017-09-19 M. Sreehari

Fix an arbitrary finite group $A$ of order $a$, and let $X(n,q)$ denote the set of homomorphisms from $A$ to the finite general linear group ${\rm GL}_n(q)$. The size of $X(n,q)$ is a polynomial in $q$. In this note it is shown that…

Group Theory · Mathematics 2016-07-13 Michael Bate , Alec Gullon

Let $G$ be a connected reductive group defined over $\mathbb F_q$. Fix an integer $M\geq 2$, and consider the power map $x\mapsto x^M$ on $G$. We denote the image of $G(\mathbb F_q)$ under this map by $G(\mathbb F_q)^M$ and estimate what…

Group Theory · Mathematics 2024-04-04 Amit Kulshrestha , Rijubrata Kundu , Anupam Singh

Appropriately normalized square random Vandermonde matrices based on independent random variables with uniform distribution on the unit circle are studied. It is shown that as the matrix sizes increases without bound, with respect to the…

Probability · Mathematics 2017-07-25 March Boedihardjo , Ken Dykema

Let $n$ be a positive integer and $\mathcal M$ a set of rational $n \times n$-matrices such that $\mathcal M$ generates a finite multiplicative semigroup. We show that any matrix in the semigroup is a product of matrices in $\mathcal M$…

Group Theory · Mathematics 2020-04-28 Georgina Bumpus , Christoph Haase , Stefan Kiefer , Paul-Ioan Stoienescu , Jonathan Tanner

Let $\{a_i\}_{i=1}^\ell$ be a strongly unimodal positive integer sequence with peak position $k$. The rank of such sequence is defined to be $\ell-2k+1$. Let $u(m,n)$ denote the number of sequences $\{a_i\}_{i=1}^\ell$ with rank $m$ and…

Combinatorics · Mathematics 2024-07-26 Wenston J. T. Zang

Let U(N) denote the maximal length of arithmetic progressions in a random uniform subset of {0,1}^N. By an application of the Chen-Stein method, we show that U(N)- 2 log(N)/log(2) converges in law to an extreme type (asymmetric)…

Probability · Mathematics 2012-05-22 Itai Benjamini , Ariel Yadin , Ofer Zeitouni

We compute averages of products and ratios of characteristic polynomials associated with Orthogonal, Unitary, and Symplectic Ensembles of Random Matrix Theory. The pfaffian/determinantal formulas for these averages are obtained, and the…

Mathematical Physics · Physics 2007-05-23 A. Borodin , E. Strahov

We show the expected order of RNA saturated secondary structures of size $n$ is $\log_4n(1+O(\frac{\log_2n}{n}))$, if we select the saturated secondary structure uniformly at random. Furthermore, the order of saturated secondary structures…

Combinatorics · Mathematics 2011-07-18 Emma Yu Jin , Markus E. Nebel