Advanced Search

It is well known that given a Steiner triple system one can define a quasigroup operation $·$ upon its base set by assigning $x·x=x$ for all $x$ and $x·y=z$, where $z$ is the third point in the block containing the pair $\{x,y\}$. The same can be done for Mendelsohn triple systems, where $(x,y)$ is considered to be ordered. But this is not necessarily the case for directed triple systems. However there do exist directed triple systems, which induce a quasigroup under this operation and these are called Latin directed triple systems....

A binary operation “$·$” which satisfies the identities $x·e=x$, $x·x=e$, $(x·y)·x=y$ and $x·y=y·x$ is called a Steiner loop. This paper revisits the proof of the necessary and sufficient conditions for the existence of a Steiner loop of order $n$ with centre of order $m$ and discusses the connection of this problem to the question of the maximum number of Pasch configurations which can occur in a Steiner triple system (STS) of a given order. An STS which attains this maximum for a given order is said to be . We show that loop factorization...