A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs

DOI10.1016/J.DISC.2014.02.009zbMATH Open1288.05034arXiv1310.0992OpenAlexW2075223139MaRDI QIDQ2449136FDOQ2449136

Authors: Tran van Trung, D. R. Stinson, Colleen M. Swanson 

Publication date: 6 May 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: In 1963, Shrikhande and Raghavarao published a recursive construction for designs that starts with a resolvable design (the "master design") and then uses a second design (the "indexing design") to take certain unions of blocks in each parallel class of the master design. Several variations of this construction have been studied by different authors. We revisit this construction, concentrating on the case where the master design is a resolvable BIBD and the indexing design is a 3-design. We show that this construction yields a 3-design under certain circumstances. The resulting 3-designs have block size k = v/2 and they are resolvable. We also construct some previously unknown simple designs by this method.

Full work available at URL: https://arxiv.org/abs/1310.0992

Recommendations

• On simple 3-designs having 2-resolutions
• A Construction of a Resolvable 3-Design
• Recursive constructions for \(s\)-resolvable \(t\)-designs
• Recursive constructions for 3-designs and resolvable 3-designs
• A recursive construction for 2-designs

zbMATH Keywords

3-designresolvable design

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Cites Work

• Title not available (Why is that?)
• On resolvable designs \(S_ 3(3;4,v)\)
• The existence of simple \(S_ 3(3,4,\nu)\)
• Unifying some known infinite families of combinatorial 3-designs
• Title not available (Why is that?)
• Recursive constructions for 3-designs and resolvable 3-designs

Cited In (8)

• Additional constructions to solve the generalized Russian cards problem using combinatorial designs
• Title not available (Why is that?)
• A Construction of a Resolvable 3-Design
• A recursive method for construction of designs
• Construction of 3-designs using \((1,\sigma)\)-resolution
• On simple 3-designs having 2-resolutions
• A recursive construction for simple \(t\)-designs using resolutions
• Unifying some known infinite families of combinatorial 3-designs

This page was built for publication: A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs

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