Results 81 to 90 of about 137 (119)

Sharp Characters of Quasigroups

open access: yesEuropean Journal of Combinatorics, 1993
The idea of a sharp permutation character of a group arises from combinatorial considerations. Recent work, founded on early results of H. F. Blichfeldt published in 1904, has shown that the definition of sharpness can be extended to arbitrary group characters, and in fact it has emerged that the natural object to define is a sharp triple.
openaire   +2 more sources

Parastrophes of quasigroups

open access: yes, 2015
Parastrophes (conjugates) of a quasigroup can be divided into separate classes containing isotopic parastrophes. We prove that the number of such classes is always 1, 2, 3 or 6. Next we characterize quasigroups having a fixed number of such classes.
openaire   +4 more sources

Varieties of Hexagonal Quasigroups

open access: yesJournal of Algebra, 1993
The decomposition of a complete graph into disjoint cycles can be used to define a binary operation \(\star\) on the vertices of the graph -- if a cycle is \((\dots, a, b, c, \dots)\) then \(a \star b = c\) and \(c \star b = a\). In general the groupoid thus obtained is not a quasigroup, but when the decomposition satisfies an extra condition, known as
openaire   +2 more sources

Abelian quasigroups and T-quasigroups

open access: yes, 1994
By means of known results with respect to algebras of a congruence modular variety it is proved that abelian in the sense of McKenzie quasigroups, i.e. quasigroups coinciding with their centre, are T-quasigroups and conversely.
openaire   +1 more source

Homogeneous quasigroups [PDF]

open access: yesPacific Journal of Mathematics, 1964
openaire   +2 more sources

On the use of pairwise balanced designs and closure spaces in the construction of structures of degree at least 3

open access: yesLe Matematiche, 1990
We prove that a set of v-2 symmetric idempotent latin squares of order v, such that no two of them agree in a off-diagonal position, exists for all odd v>>0.
Luc Teirlinck
doaj  

Home - About - Disclaimer - Privacy