If \(G\) is a loop then we say that the smallest number of subloops needed to cover \(G\) is the covering number of \(G\). It was shown by \textit{M. J. Tomkinson} [in Math. Scand. 81, No. 2, 191-198 (1997; Zbl 0905.20014)] that there does not exist a group with a covering number of seven. He also conjectured that there are no groups with a covering number of eleven. Coverings of groups have been broadly explored and some results have been shown by \textit{T. Foguel} and \textit{L.-C. Kappe} [in Expo. Math. 23, No. 3, 255-270 (2005; Zbl 1103.20064)] to also hold for loops. The author proves in this paper that even though there does not exist a group with a covering number of seven, there does exist a finite simple Moufang loops, namely a Paige loop, that has seven as its covering number. Moreover, its automorphism group permutes all such coverings, with seven proper subloops, transitively.
- Diagram geometry. Related to classical groups and buildings
- Generalized quadrangles associated with \(G_ 2(\)q)
- Groups as the union of proper subgroups.
- scientific article; zbMATH DE number 3171516 (Why is no real title available?)
- scientific article; zbMATH DE number 5150166 (Why is no real title available?)
- scientific article; zbMATH DE number 5498828 (Why is no real title available?)
- Moufang Loops of Small Order. I
- On generalized hexagons and a near octagon whose lines have three points
- On loops covered by subloops.
- Sur la trialité et certains groupes qui s'en déduisent
- The classification of finite simple Moufang loops
- The development of Sylow \(p\)-subloops in finite Moufang loops.
- The Number of Sylowp-Subloops in Finite Moufang Loops
This page was built for publication: Coverings of the smallest Paige loop.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644694)