205 research outputs found

    Distributive and trimedial quasigroups of order 243

    Full text link
    We enumerate three classes of non-medial quasigroups of order 243=35243=3^5 up to isomorphism. There are 1700417004 non-medial trimedial quasigroups of order 243243 (extending the work of Kepka, B\'en\'eteau and Lacaze), 9292 non-medial distributive quasigroups of order 243243 (extending the work of Kepka and N\v{e}mec), and 66 non-medial distributive Mendelsohn quasigroups of order 243243 (extending the work of Donovan, Griggs, McCourt, Opr\v{s}al and Stanovsk\'y). The enumeration technique is based on affine representations over commutative Moufang loops, on properties of automorphism groups of commutative Moufang loops, and on computer calculations with the \texttt{LOOPS} package in \texttt{GAP}

    Code loops in dimension at most 8

    Full text link
    Code loops are certain Moufang 22-loops constructed from doubly even binary codes that play an important role in the construction of local subgroups of sporadic groups. More precisely, code loops are central extensions of the group of order 22 by an elementary abelian 22-group VV in the variety of loops such that their squaring map, commutator map and associator map are related by combinatorial polarization and the associator map is a trilinear alternating form. Using existing classifications of trilinear alternating forms over the field of 22 elements, we enumerate code loops of dimension d=dim(V)8d=\mathrm{dim}(V)\le 8 (equivalently, of order 2d+15122^{d+1}\le 512) up to isomorphism. There are 767767 code loops of order 128128, and 8082680826 of order 256256, and 937791557937791557 of order 512512

    3-nets realizing a diassociative loop in a projective plane

    Get PDF
    A \textit{33-net} of order nn is a finite incidence structure consisting of points and three pairwise disjoint classes of lines, each of size nn, such that every point incident with two lines from distinct classes is incident with exactly one line from each of the three classes. The current interest around 33-nets (embedded) in a projective plane PG(2,K)PG(2,K), defined over a field KK of characteristic pp, arose from algebraic geometry. It is not difficult to find 33-nets in PG(2,K)PG(2,K) as far as 0<pn0<p\le n. However, only a few infinite families of 33-nets in PG(2,K)PG(2,K) are known to exist whenever p=0p=0, or p>np>n. Under this condition, the known families are characterized as the only 33-nets in PG(2,K)PG(2,K) which can be coordinatized by a group. In this paper we deal with 33-nets in PG(2,K)PG(2,K) which can be coordinatized by a diassociative loop GG but not by a group. We prove two structural theorems on GG. As a corollary, if GG is commutative then every non-trivial element of GG has the same order, and GG has exponent 22 or 33. We also discuss the existence problem for such 33-nets

    Interval Algebraic Bistructures

    Get PDF
    This book has four chapters. In the first chapter interval bistructures (biinterval structures) such as interval bisemigroup, interval bigroupoid, interval bigroup and interval biloops are introduced. Throughout this book we work only with the intervals of the form [0, a] where a \in Zn or Z+ \cup {0} or R+ \cup {0} or Q+ \cup {0} unless otherwise specified. Also interval bistructures of the form interval loop-group, interval groupgroupoid so on are introduced and studied. In chapter two n-interval structures are introduced. n-interval groupoids, n-interval semigroups, n-interval loops and so on are introduced and analysed. Using these notions n-interval mixed algebraic structure are defined and described. Some probable applications are discussed. Only in due course of time several applications would be evolved by researchers as per their need. The final chapter suggests around 295 problems of which some are simple exercises, some are difficult and some of them are research problems.Comment: 208 page
    corecore