A construction for resolvable designs and its generalizations

DOI10.1007/PL00007217MaRDI QIDQ1385296zbMATH OpenOpenAlexFDO

Authors Sanpei Kageyama, Ying Miao

Publication date 14 September 1998

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00007217

zbMATH Keywords

framesfree difference familiesgroup divisible designsresolvable designsresolvable perfect Mendelsohn designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Review text

The authors generalize a technique to construct resolvable designs as given by \textit{D. K. Ray-Chaudhuri} and \textit{R. M. Wilson} [Survey Combin. Theory, Sympos. Colorado State Univ., Colorado 1971, 361-375 (1973; Zbl 0274.05010)] using free difference families in finite fields. The generalized techniques require free difference families over rings in which there are some units such that their differences are still units. The new techniques are used to construct resolvable designs, frames, and resolvable (modified) group divisible designs with index not less than unity. The construction technique developed is then applied to construct resolvable perfect Mendelsohn designs and other related designs. Furthermore, the results of this paper are used to obtain some bounds on the largest cardinality of subsets of \(U(R)\), the set of the units of a ring \(R\), in which the differences among elements are still units. Finally, composition theorems for free difference families via difference matrices are stated which can be used to construct new resolvable designs.

Recommendations

• Difference families with applications to resolvable designs
• On resolvable difference families
• Difference families from rings
• scientific article; zbMATH DE number 4110699
• On resolvable designs

Cited in

(18)

• New product theorems for \(Z\)-cyclic whist tournaments
• Difference families with applications to resolvable designs
• The first families of highly symmetric Kirkman triple systems whose orders fill a congruence class
• Doubly resolvable canonical Kirkman packing designs and its applications
• Recursive constructions for s-resolvable t-designs
• A combinatorial structure of affine \((\alpha _1,\dots ,\alpha _t)\)-resolvable \((r,\lambda )\)-designs.
• scientific article; zbMATH DE number 5901468 (Why is no real title available?)
• scientific article; zbMATH DE number 6000652 (Why is no real title available?)
• scientific article; zbMATH DE number 5127213 (Why is no real title available?)
• CONSTRUCTION OF RESOLVABLE ROW-COLUMN DESIGNS BASED ON CONTRACTIONS
• scientific article; zbMATH DE number 3954931 (Why is no real title available?)
• Additional constructions to solve the generalized Russian cards problem using combinatorial designs
• scientific article; zbMATH DE number 2061147 (Why is no real title available?)
• scientific article; zbMATH DE number 2149825 (Why is no real title available?)
• Ring-valud assignments, t-designs and difference families
• On resolvable difference families
• Complete sets of disjoint difference families and their applications
• Resolvable designs of finite geometry and related designs

This page was built for publication: A construction for resolvable designs and its generalizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1385296)