A method to construct generalized balanced tournament designs

A method to construct generalized balanced tournament designs

A generalized balanced tournament design, or a GBTD(k, m) in short, is a (km, k, k-1)-BIBD defined on a km-set V . Its blocks can be arranged into an m\times(km-1) array in such a way that (1) every element of V is contained in exactly one cell of each column, and (2) every element of V is contained...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Kim, Songchol, Rim, Changil
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A generalized balanced tournament design, or a GBTD(k, m) in short, is a (km, k, k-1)-BIBD defined on a km-set V . Its blocks can be arranged into an m\times(km-1) array in such a way that (1) every element of V is contained in exactly one cell of each column, and (2) every element of V is contained in at most k cells of each row. In this paper, we present a new construction for GBTDs and show that a GBTD(p,p) exists for any prime number p \geq 3.
DOI:10.48550/arxiv.1208.1920