On average orders of automorphism groups of bilinear maps over finite fields
Preprint
Abstract
Let $\varphi:V\times V\to W$ be a bilinear map of finite vector spaces $V$ and $W$ over a finite field $\mathbb{F}_q$. We present asymptotic bounds on the number of isomorphism classes of bilinear maps under the natural action of $\mathrm{GL}(V)$ and $\mathrm{GL}(W)$, when $\dim(V)$ and $\dim(W)$ are linearly related. As motivations and applications of the results, we present almost tight upper bounds on the number of $p$-groups of Frattini class $2$ as first studied by Higman (Proc. Lond. Math. Soc., 1960). Such bounds lead to answers for some open questions by Blackburn, Neumann, and Venkataraman (Cambridge Tracts in Mathematics, 2007). Further applications include sampling matrix spaces with the trivial automorphism group, and asymptotic bounds on the number of isomorphism classes of finite cube-zero commutative algebras.
Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Enumerating alternating matrix spaces over finite fields with explicit coordinatesDiscrete Mathematics, 2021
- Group-theoretic generalisations of vertex and edge connectivitiesProceedings of the American Mathematical Society, 2020
- Random matrix theory over finite fieldsBulletin of the American Mathematical Society, 2001
- Enumerating p-GroupsJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1999
- Some asymptotic results on finite vector spacesAdvances in Applied Mathematics, 1988
- Numbers of conjugacy classes in some finite classical groupsBulletin of the Australian Mathematical Society, 1981
- Graphs on unlabelled nodes with a given number of edgesActa Mathematica, 1971
- Kombinatorische Anzahlbestimmungen in RelationenMathematische Annalen, 1967
- Asymmetric graphsActa Mathematica Hungarica, 1963
- COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. IProceedings of the National Academy of Sciences, 1956