A prospect for a general method of constructing \(t\)-designs
type: Item
instance of: scholarly article
title: A prospect for a general method of constructing \(t\)-designs
zbMATH Open document ID: 0774.05017
DOI: 10.1016/0166-218X(93)90177-P
author: Dibyen Majumdar
author: A. S. Hedayat
author: Gholamreza Khosrovshahi
published in: Discrete Applied Mathematics
publication date: 1993-05-16T00:00:00Z
review text: By a \(t\)-design we mean a collection of sets \(S=S(\lambda;t,k,v)\) so that each set in \(S\) is a \(k\)-element subset of a fixed \(v\)-element set \(X\) and so that each \(t\)-element subset of \(X\) is a subset of exactly \(\lambda\) of the sets in \(S\). If \(S\) is a design then the numbers \[ \lambda_ i={{v-i\choose t-i}\over{k-i\choose t-i}} \] must be integers for \(0\leq i\leq t\). Thus, the requirement that these numbers are integers is a necessary condition for the existence of a \(t\)-design with parameters \((\lambda;t,k,v)\). This requirement is not sufficient; but it is sufficient for the existence of a signed \(t\)-design, i.e. one in which the sets in \(S\) are assigned integers multiplicities and the condition on \(t\)-element subsets is altered to read: the multiplicities of the sets in \(S\) which contain a \(t\)-set must sum to \(\lambda\). Signed \(t\)-designs were invented to aid in the construction of (unsigned) \(t\)-designs. The authors review the theoretical knowledge of \(t\)-designs and signed \(t\)-designs and produce two algorithms: one for constructing signed \(t\)- designs and one for altering these signed \(t\)-designs to get (unsigned) \(t\)-designs with the same set of parameters.
Mathematics Subject Classification ID: 05B05
Mathematics Subject Classification ID: 05B30
zbMATH DE Number: 167438
zbMATH Keywords: \(t\)-design
zbMATH Keywords: algorithms
reviewed by: Jack E. Graver
MaRDI profile type: Publication
cites work: On the Structure oft-Designs
cites work: The module structure of integral designs
cites work: Q3784080
cites work: Q5752579
cites work: A New Basis for Trades
cites work: Q4724649
cites work: On Existence of t-Designs with Large $v $ and $\lambda $
cites work: Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
cites work: Q4774057
description: scientific article; zbMATH DE number 167438