5-sparse Steiner triple systems of order exist for almost all admissible .
A Characterization of Designs Related to the Witt System S(5, 8, 24).
A recursive construction of 1-rotational Steiner 2-designs.
Another product construction for large sets of resolvable directed triple systems.
Antiflexible Latin directed triple systems
It is well known that given a Steiner triple system one can define a quasigroup operation upon its base set by assigning for all and , where is the third point in the block containing the pair . The same can be done for Mendelsohn triple systems, where 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....
Avoidance in triple systems.
Bicoloring Steiner triple systems.
Circulants and the chromatic index of Steiner triple systems
Codes, lattices, and Steiner systems.
Compatible factorizations and three-fold triple systems.
Es gibt keine 4-affine Ebene der Ordnung 4.
Faithful enclosing of triple systems: Doubling the index.
Generalizations of Cole's Systems
There are four resolvable Steiner triple systems on fifteen elements. Some generalizations of these systems are presented here.
Generating sets in Steiner triple systems
Isols and balanced block designs with
Kikkawa loops and homogeneous loops
In H. Kiechle's publication ``Theory of K-loops'' [3], the name Kikkawa loops is given to symmetric loops introduced by the author in 1973. This concept started from an analogical imagination of sum of vectors in Euclidean space brought up on a sphere. In 1975, this concept was extended by him to the more general concept of homogeneous loops, and it led us to a non-associative generalization of the theory of Lie groups. In this article, the backstage of finding these concepts will be disclosed from...
Klassisches und Modernes über Steiner Tripelsysteme.
Leaves, excesses and neighborhoods
Locally Truncated Buildings and M.... .
Matematika za karetní hrou dobble
V tomto článku se zabýváme návazností populární karetní hry dobble na kombinatorické struktury. Ukazujeme, že existence dokonalých balíčků karet souvisí s existencí konečných projektivních rovin a systémů ortogonálních latinských čtverců. Dále pomocí obecnější struktury, blokových schémat, diskutujeme možnosti vytváření balíčků karet pro hry s modifikovanými pravidly. Výklad, příklady i přílohy jsou uzpůsobeny tomu, aby si čtenář mohl relativně jednoduše vytvořit vlastní karetní systémy.