Loops that are partitioned by groups. (Q741279): Difference between revisions

The authors study loops that are partitioned by groups and loops that are equally partitioned by groups. They construct a family of loops that are equally partitioned by groups that can have any exponent. The authors also show that for certain families of loops Isaacs' results extend to loops. Coverings of groups with subgroups that possess different properties have been widely studied. See the paper of \textit{G. A. Miller} [Amer. M. S. Bull. (2) 12, 446-449 (1906; JFM 37.0170.01)]; \textit{I. M. Isaacs} published a paper [Pac. J. Math. 49, 109-116 (1973; Zbl 0235.20021)], where he proved that the only finite groups which can be partitioned by subgroups of equal orders are the \(p\)-groups of exponent \(p\). In that paper he also proved that finite groups partitioned by pairwise permutable subgroups are Abelian. Recently analogous problems for loops covered by subloops and subgroups have been studied. See [\textit{T. Foguel} and \textit{L.-C. Kappe}, Expo. Math. 23, No. 3, 255-270 (2005; Zbl 1103.20064)].