Irreducible linear subgroups generated by pairs of matrices with large irreducible submodules.

DOI10.1007/S00013-012-0359-1zbMATH Open1260.20068arXiv1903.07083OpenAlexW2009640192WikidataQ56987578 ScholiaQ56987578MaRDI QIDQ766089FDOQ766089

Authors: Alice C. Niemeyer, Sabina B. Pannek, Cheryl E. Praeger 

Publication date: 23 March 2012

Published in: Archiv der Mathematik (Search for Journal in Brave)

Abstract: We call an element of a finite general linear group $extrmGL(d,q)$ emph{fat} if it leaves invariant, and acts irreducibly on, a subspace of dimension greater than $d/2$. Fatness of an element can be decided efficiently in practice by testing whether its characteristic polynomial has an irreducible factor of degree greater than $d/2$. We show that for groups $G$ with $extrmSL(d,q)leqGleqextrmGL(d,q)$ most pairs of fat elements from $G$ generate irreducible subgroups, namely we prove that the proportion of pairs of fat elements generating a reducible subgroup, in the set of all pairs in $GimesG$, is less than $q^{-d+1}$. We also prove that the conditional probability to obtain a pair $(g_1,g_2)$ in $GimesG$ which generates a reducible subgroup, given that $g_1,g_2$ are fat elements, is less than $2q^{-d+1}$. Further, we show that any reducible subgroup generated by a pair of fat elements acts irreducibly on a subspace of dimension greater than $d/2$, and in the induced action the generating pair corresponds to a pair of fat elements.

Full work available at URL: https://arxiv.org/abs/1903.07083

Recommendations

• A theorem on random matrices and some applications
• The probability of generating a finite linear group.
• A polynomial-time reduction algorithm for groups of semilinear or subfield class.
• A Recognition Algorithm for Special Linear Groups
• Asymptotic results for primitive permutation groups and irreducible linear groups.

zbMATH Keywords

general linear groupsirreducible subgroupsproportions of elementsgenerating pairsfat elementslarge irreducible subspaces

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Linear algebraic groups over finite fields (20G40) Probabilistic methods in group theory (20P05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The computational matrix group project.
• A Recognition Algorithm for Special Linear Groups
• A Recognition Algorithm For Classical Groups Over Finite Fields

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Irreducible linear subgroups generated by pairs of matrices with large irreducible submodules.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q766089)