Incidence properties of cosets in loops. (Q2885147)

Let \((Q,S)\) be a pair where \((Q,\cdot)\) is a loop and \(S\) is a subloop of \(Q\). Given \((Q,S)\), for any \(x\in Q\) we can consider the left (right) coset \(xS:=\{xs\mid s\in S\}\) (\(Sx:=\{sx\mid s\in S\}\)). While cosets in groups are either disjoint or identical, in the nonassociative case the study of the cosets is richer though more complex.NEWLINENEWLINE In this very interesting paper the authors take up the study of the cosets of \((Q,S)\) following two different approaches. From the algebraic point of view they would like to find an elementary proof of Lagrange's theorem for Moufang loops. The other approach is aimed at studying the incidence properties of the cosets in view of associating to \((Q,S)\) a combinatorial design.NEWLINENEWLINE Regarding the first point of view the note presents an algorithm that, given an infinite Bol loop \(S\), can in some cases determine whether \(|S|\) divides \(|Q|\) for all Bol loops \(Q\) with \(S\leq Q\) or even whether there is a selection of left cosets of \(S\) that partitions \(Q\).NEWLINENEWLINE As for the second point of view, the authors prove that to any \((Q,S)\) is associated a symmetric design \(\mathcal{D(Q,S)}\) and conversely given a symmetric design \(\mathcal D\), then it can be realized by means of the left cosets of a subloop \(S\) of a loop \(Q\).NEWLINENEWLINE Several examples are discussed throughout the note, together with open problems and the paper can be viewed as a point of departure for a more systematic study of cosets in loops.