SearcharxivSearch

arXiv · 1105.4078

Proportions of Cyclic Matrices in Maximal Reducible Matrix Groups and Algebras

Abstract

A matrix is said to be {\it cyclic} if its characteristic polynomial is equal to its minimal polynomial. Cyclic matrices play an important role in some algorithms for matrix group computation, such as the Cyclic Meataxe developed by P. M. Neumann and C. E. Praeger in 1999. In that year also, G. E. Wall and J. E. Fulman independently found the limiting proportion of cyclic matrices in general linear groups over a finite field of fixed order q as the dimension n approaches infinity, namely $(1-q^{-5}) \prod_{i=3}^\infty (1-q^{-i}) = 1 - q^{-3} + O(q^{-4}).$ We study cyclic matrices in a maximal reducible matrix group or algebra, that is, in the largest subgroup or subalgebra that leaves invariant some proper nontrivial subspace. We modify Wall's generating function approach to determine the limiting proportions of cyclic matrices in maximal reducible matrix groups and algebras over a field of order q, as the dimension of the underlying vector space increases while that of the invariant subspace remains fixed. The limiting proportion in a maximal reducible group is proved to be $1 - q^{-2} + O(q^{-3})$; note the change of the exponent of q in the second term of the expansion. Moreover, we exhibit in each maximal reducible matrix group a family of noncyclic matrices whose proportion is $q^{-2} + O(q^{-3})$.

Explore related subjects

Keep this discovery

BibTeXRIS

Scott Brown, Cheryl E. Praeger, Michael Giudici. 2011-05-20. Proportions of Cyclic Matrices in Maximal Reducible Matrix Groups and Algebras. https://arxiv.org/abs/1105.4078

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR