Results 1 
3 of
3
ON STEINER LOOPS AND POWER ASSOCIATIVITY 217
"... Abstract. In this paper we investiagte Steiner loops introduced by N.S. Mendelsohn [Aeq. Math. 6 (1991), 228–230] and provide six (seven) equivalent identities to characterize it. We also prove the power associativity of Bol loops by using closure (Hexagonal) conditions. 1. Steiner loops In [9] Me ..."
Abstract
 Add to MetaCart
] Mendelsohn has defined the concept of a generalized triple system as follows. Let S be a set of ν elements. Let T be a collection of b subsets of S, each of which contains three elements arranged cyclically, and such that any ordered pair of elements of S appears in exactly a cyclic triplet (note the cyclic
Antipodal Triple Systems
 AUSTRALASIAN JOURNAL OF COMBINATORICS 9(1994). NN. B71&;1
, 1994
"... An antipodal triple system of order v is a triple (V, B, 1), where 1 V 1 = v, B is a set of cyclically oriented 3subsets of V, and f: V+ V is an involution with one fixed point such that: (i) (V, B U f(B)) is a Mendelsohn triple system. Oi) B n f(B) = 0. (iii) f is an isomorphism between the Stei ..."
Abstract
 Add to MetaCart
An antipodal triple system of order v is a triple (V, B, 1), where 1 V 1 = v, B is a set of cyclically oriented 3subsets of V, and f: V+ V is an involution with one fixed point such that: (i) (V, B U f(B)) is a Mendelsohn triple system. Oi) B n f(B) = 0. (iii) f is an isomorphism between
Construction of extended Steiner systems for information retrieval
 Revista Matemática Complutense
, 2008
"... A multiset batch code is a variation of information retrieval where a tmultiset of items can be retrieved by reading at most one bit from each server. We study a problem at the other end of the spectrum, namely that of retrieving a tmultiset of items by accessing exactly one server. Our solution t ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
to the problem is a combinatorial notion called an extended Steiner system, which was first studied by Johnson and Mendelsohn [11]. An extended Steiner system ES(t, k, v) is a collection of kmultisets (thus, allowing repetition of elements in a block) of a vset such that every tmultiset belongs to exactly one