Commutative subloop-free loops
We describe, in a constructive way, a family of commutative loops of odd order, , which have no nontrivial subloops and whose multiplication group is isomorphic to the alternating group .
We describe, in a constructive way, a family of commutative loops of odd order, , which have no nontrivial subloops and whose multiplication group is isomorphic to the alternating group .
We review results for the embedding of orthogonal partial Latin squares in orthogonal Latin squares, comparing and contrasting these with results for embedding partial Latin squares in Latin squares. We also present a new construction that uses the existence of a set of mutually orthogonal Latin squares of order to construct a set of mutually orthogonal Latin squares of order .
Our purpose is to determine the complete set of mutually orthogonal squares of order d, which are not necessary Latin. In this article, we introduce the concept of supersquare of order d, which is defined with the help of its generating subgroup in . We present a method of construction of the mutually orthogonal supersquares. Further, we investigate the orthogonality of extraordinary supersquares, a special family of squares, whose generating subgroups are extraordinary. The extraordinary subgroups...
We give a short account of the construction and properties of left neofields. Most useful in practice seem to be neofields based on the cyclic group and particularly those having an additional divisibility property, called D-neofields. We shall give examples of applications to the construction of orthogonal latin squares, to the design of tournaments balanced for residual effects and to cryptography.
Let and be two groups of finite order , and suppose that they share a normal subgroup such that if or . Cases when is cyclic or dihedral and when for exactly pairs have been shown to be of crucial importance when studying pairs of 2-groups with the latter property. In such cases one can describe two general constructions how to get all possible from a given . The constructions, denoted by and , respectively, depend on a coset (or two cosets and ) modulo , and on an...