Constructions for rotational near resolvable block designs

A (ν, k, k?1) near resolvable block design (NRBD) is r‐rotational over a group G if it admits G as an automorphism group of order (ν?1)/r fixing exactly one point and acting semiregularly on the others. We give direct and recursive constructions for rotational NRBDs with particular attention to 1‐rotational ones. © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 157–181, 2001     

Class-uniformly resolvable designs with block sizes 2 and 3

In this article we consider restricted resolvable designs (RRP) with block sizes 2 and 3 that are class uniform. A characterization scheme is developed, based on the ratio a:b of pairs to triples, and necessary conditions are provided for the existence of these designs based on this characterization. We show asymptotic existence results when (a,b) = (1, 2n), n ≥ 1 and when (a,b) = (9, 2). We also study the specific cases when (a,b) = (1, 2n), 1 ≤ n ≤ 5, (a,b) = (3, 6u−2), u ≥ 1 and when (a,b) E {(1, 1), (3, 1), (7, 2), (3, 4), (9, 2)}. © 1996 John Wiley & Sons, Inc.     

Some results on resolvable incomplete block designs

This paper is concerned with the uniformity of a certain kind of resolvable incomplete block (RIB for simplicity) design which is called the PRIB design here. A sufficient and necessary condition is obtained, under which a PRIB design is the most uniform in the sense of a discrete discrepancy measure, and the uniform PRIB design is shown to be connected. A construction method for such designs via a kind of U-type designs is proposed, and an existence result of these designs is given. This method sets up an important bridge between PRIB designs and U-type designs.     

Embeddings of resolvable group divisible designs with block size 3

It is proved in this paper that an RGD(3, g;v) can be embedded in an RGD(3, g;u) if and only if , , , v ≥ 3g, u ≥ 3v, and (g,v) ≠ (2,6),(2,12),(6,18).     

Maximum uniformly resolvable designs with block sizes 2 and 4

A central question in design theory dating from Kirkman in 1850 has been the existence of resolvable block designs. In this paper we will concentrate on the case when the block size k=4. The necessary condition for a resolvable design to exist when k=4 is that v≡4mod12; this was proven sufficient in 1972 by Hanani, Ray-Chaudhuri and Wilson [H. Hanani, D.K. Ray-Chaudhuri, R.M. Wilson, On resolvable designs, Discrete Math. 3 (1972) 343-357]. A resolvable pairwise balanced design with each parallel class consisting of blocks which are all of the same size is called a uniformly resolvable design, a URD. The necessary condition for the existence of a URD with block sizes 2 and 4 is that v≡0mod4. Obviously in a URD with blocks of size 2 and 4 one wishes to have the maximum number of resolution classes of blocks of size 4; these designs are called maximum uniformly resolvable designs or MURDs. So the question of the existence of a MURD on v points has been solved for by the result of Hanani, Ray-Chaudhuri and Wilson cited above. In the case this problem has essentially been solved with a handful of exceptions (see [G. Ge, A.C.H. Ling, Asymptotic results on the existence of 4-RGDDs and uniform 5-GDDs, J. Combin. Des. 13 (2005) 222-237]). In this paper we consider the case when and prove that a exists for all u≥2 with the possible exception of u∈{2,7,9,10,11,13,14,17,19,22,31,34,38,43,46,47,82}.     

On uniformly resolvable designs with block sizes 3 and 4

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 r _k . In this paper we consider the case of block sizes 3 and 4. The cases r ₃ = 1 and r ₄ = 1 correspond to Resolvable Group Divisible Designs (RGDD). We prove that if a 4-RGDD of type h ^u exists then all admissible {3, 4}-URDs with 12hu points exist. In particular, this gives existence for URD with v ≡ 0 (mod 48) points. We also investigate the case of URDs with a fixed number of k -pc. In particular, we show that URDs with r ₃ = 4 exist, and that those with r ₃ = 7, 10 exist, with 11 and 12 possible exceptions respectively, this covers all cases with 1 < r ₃ ≤ 10. Furthermore, we prove that URDs with r ₄ = 7 exist and that those with r ₄ = 9 exist, except when v = 12, 24 and possibly when v = 276. In addition, we prove that there exist 4-RGDDs of types 2 ¹⁴², 2 ³⁴⁶ and 6 ⁵⁴. Finally, we provide four {3,5}-URDs with 105 points.     

Frame difference families and resolvable balanced incomplete block designs

Frame difference families, which can be obtained via a careful use of cyclotomic conditions attached to strong difference families, play an important role in direct constructions for resolvable balanced incomplete block designs. We establish asymptotic existences for several classes of frame difference families. As corollaries new infinite families of 1-rotational \((pq+1,p+1,1)\)-RBIBDs over \({\mathbb {F}}_{p}^+ \times {\mathbb {F}}_{q}^+\) are derived, and the existence of \((125q+1,6,1)\)-RBIBDs is discussed. We construct (v, 8, 1)-RBIBDs for \(v\in \{624,\) \(1576,2976,5720,5776,10200,14176,24480\}\), whose existence were previously in doubt. As applications, we establish asymptotic existences for an infinite family of optimal constant composition codes and an infinite family of strictly optimal frequency hopping sequences.     

区组大小为 4 的二重超单可分解的可分组设计

自 1992 年 Gronau 和 Mullin 提出超单设计的概念以来, 很多研究者参与了超单设计的研究. 超单设计在编码等方面也有广泛的应用. 超单可分组设计是超单设计的重要组成部分. 本文我们主要研究区组大小为4 的二重超单可分解的可分组设计, 并基本解决了此类设计的存在性问题.     

Super‐simple resolvable balanced incomplete block designs with block size 4 and index 2

The necessary conditions for the existence of a super‐simple resolvable balanced incomplete block design on v points with block size k = 4 and index λ = 2, are that v ≥ 16 and . These conditions are shown to be sufficient. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 341–356, 2007     

Super‐simple resolvable balanced incomplete block designs with block size 4 and index 3

The necessary conditions for the existence of a super‐simple resolvable balanced incomplete block design on v points with k = 4 and λ = 3, are that v ≥ 8 and v ≡ 0 mod 4. These conditions are shown to be sufficient except for v = 12. © 2003 Wiley Periodicals, Inc.     

The existence of resolvable Steiner quadruple systems

A Steiner quadruple system of order v is a set X of cardinality v, and a set Q, of 4-subsets of X, called blocks, with the property that every 3-subset of X is contained in a unique block. A Steiner quadruple system is resolvable if Q can be partitioned into parallel classes (partitions of X). A necessary condition for the existence of a resolvable Steiner quadruple system is that v≡4 or 8 (mod 12). In this paper we show that this condition is also sufficient for all values of v, with 24 possible exceptions.     

ContributionsThe existence of perfect Mendelsohn designs with block size 7

Necessary conditions for existence of a (v,k,λ) perfect Mendelsohn design (or PMD) are v k and λv(v − 1) ≡ 0 mod k. When k = 7, this condition is satisfied if v ≡ 0 or 1 mod 7 and v 7 when λ 0 mod 7 and for all v 7 when λ ≡ 0 mod 7. Bennett, Yin and Zhu have investigated the existence problem for k = 7, λ = 1 and λ even; here we provide several improvements on their results and also investigate the situation for λ odd. We reduce the total number of unknown (v,7,λ)-PMDs to 36,31 for λ = 1 and 5 for λ > 1. In particular, v = 294 is the largest unknown case for λ = 1, and the only unknown cases for λ > 1 are for v = 42, λ [2,3,5,9] and v = 18, λ = 7.     

On the existence of super-simple designs with block size 4

Summary We prove that forv = 1 and for allv 1 (mod 3),v 10, there is a (v, 4, 4) design with the property that no triple appears in more than one block. The proof of this result is made more difficult by the non-existence of a GDD (4, 4, 3; 15) with no triple appearing in more than one block. We also show that forv = 1 and for allv 1, 4 (mod 12),v 13, there is a (v, 4, 2) design with this property, and with the additional property that the design is the union of two (v, 4, 1) designs.     

The spectrum of α‐resolvable designs with block size four

Abstact: An α‐resolvable BIBD is a BIBD with the property that the blocks can be partitioned into disjoint classes such that every class contains each point of the design exactly α times. In this paper, we show that the necessary conditions for the existence of α‐resolvable designs with block size four are sufficient, with the exception of (α, ν, λ) = (2, 10, 2). © 2000 John Wiley & Sons, Inc. J Combin Designs 9: 1–16, 2001     

Classification of resolvable balanced incomplete block designs — the unitals on 28 points

Approaches for classifying resolvable balanced incomplete block designs (RBIBDs) are surveyed. The main approaches can roughly be divided into two types: those building up a design parallel class by parallel class and those proceeding point by point. With an algorithm of the latter type — and by refining ideas dating back to 1917 and the doctoral thesis by Pieter Mulder — it is shown that the list of seven known resolutions of 2-(28, 4, 1) designs is complete; these objects are also known as the resolutions of unitals on 28 points. This research was supported in part by the Academy of Finland, Grants No. 107493, 110196, and 117499.