Uniformly resolvable designs with block sizes 3 and 4

Hengjia Wei, Gennian Ge

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

A uniformly resolvable design (URD) is a resolvable design in which each parallel class contains blocks of only one block size k. Such a class is denoted k-pc and for a given k the number of k-pcs is denoted rk. Let v denote the number of points of the URD. For the case of block sizes 3 and 4 (both existing), the necessary conditions imply that v ≡ 0(mod12). It has been shown that almost all URDs with permissible r3 and r4 exist for v ≡ 0(mod24), v ≡ 0(mod60), v ≡ 36(mod144) or v ≡ 36(mod108). In this paper, we prove that the necessary conditions for the existence of a URD with block sizes 3 and 4 are also sufficient, except when v=12, r3=1 and r4=3.

Original languageEnglish
Pages (from-to)1069-1085
Number of pages17
JournalDiscrete Mathematics
Volume339
Issue number3
DOIs
StatePublished - 6 Mar 2016
Externally publishedYes

Keywords

  • Frame
  • Resolvable group divisible design
  • Uniformly resolvable design

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Uniformly resolvable designs with block sizes 3 and 4'. Together they form a unique fingerprint.

Cite this