M_(12)作用在396个点上的SPBIB设计的分类

研究Mathieu群M_(12)作用在396个点上所构成的对称的部分平衡不完全区组设计(即SPBIB设计)的分类情况.首先,证明了以M_(12)作为自同构群的非平凡的2-(396,k,λ)对称设计是不存在的.然后,得到了同构意义下的3个点数为396且区组长度为80的SPBIB设计.最后,给出了396个点上以M_(12)作为自同构群的SPBIB设计的完全分类.     

Partially balanced incomplete block designs from weakly divisible nearrings

In [[6] Riv. Mat. Univ. Parma 11 (2) (1970) 79-96] Ferrero demonstrates a connection between a restricted class of planar nearrings and balanced incomplete block designs. In this paper, bearing in mind the links between planar nearrings and weakly divisible nearrings (wd-nearrings), first we show the construction of a family of partially balanced incomplete block designs from a special class of wd-nearrings; consequently, we are able to give some formulas for calculating the design parameters.     

Optimal balanced 27 fractional factorial designs of resolutionV,withN≦42

Summary In this paper, we present a class of fractional factorial designs of the 2⁷ series, which are of resolutionV. Such designs allow the estimation of the general mean, the main effects and the two factors interactions (29 parameters in all for the 2⁷ factorial) assuming that the higher order effects are negligible. For every value ofN (the number of runs) such that 29≦N≦42, we give a resolutionV design that is optimal (with respect to the trace criterion) within the subclass of balanced designs. Also, for convenience of analysis, we present for each design, the covariance matrix of the estimates of the various parameters. As a by product, we establish many interesting combinatorial theorems concerning balanced arrays of strength four (which are generalizations of orthogonal arrays of strength four, and also of balanced incomplete block designs with block sizes not necessarily equal).     

Robustness of connected balanced block designs

Summary It is well known that the connected incomplete block designs with the highest intrablock efficiency factors are balanced. In a connected balanced block (BB) design, every elementary contrast is estimated with the same variance. If a treatment is lost in a connected BB design, then the residual design is not balanced for the most part. In this paper, an upper bound and a lower bound for efficiency of a residual design are derived with some illustrations. Moreover, from these discussions it is conceivable that the loss of efficiency even in the unbalanced case is, in general, small.     

Small Box-Behnken design

Box-Behnken design has been popularly used for the second-order response surface model. It is formed by combining two-level factorial designs with incomplete block designs in a special manner—the treatments in each block are replaced by an identical design. In this paper, we construct small Box-Behnken design. These designs can fit the second-order response surface model with reasonably high efficiencies but with only a much smaller run size. The newly constructed designs make use of balanced incomplete block design (BIBD) or partial BIBD, and replace treatments partly by 2_III³⁻¹ designs and partly by full factorial designs. It is shown that the orthogonality properties in the original Box and Behnken designs will be kept in the new designs. Furthermore, we classify the parameters into groups and introduce Group Moment Matrix (GMM) to estimate all the parameters in each group. This allows us to significantly reduce the amount of computational costs in the construction of the designs.     

A class of pbib-designs obtained from projective geometries

In this paper, a new class of partially balanced incomplete block designs is constructed over an association scheme obtained from a finite projective geometry. Further, a general method for deriving a balanced incomplete block design from another one is given.     

Partial geometric designs and two-class partially balanced designs

It is shown that a partial geometric design with parameters (r, k, t, c) satisfying certain conditions is equivalent to a two-class partially balanced incomplete block design. This generalizes a result concerning partial geometric designs and balanced incomplete block designs.     

Double Arrays,Triple Arrays and Balanced Grids

Triple arrays are a class of designs introduced by Agrawal in 1966 for two-way elimination of heterogeneity in experiments. In this paper we investigate their existence and their connection to other classes of designs, including balanced incomplete block designs and balanced grids.AMS Classification:05B05, 05B30     

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.     

Super-simple (ν, 5, 5) Designs

Super-simple designs are useful in constructing codes and designs such as superimposed codes and perfect hash families. In this article, we investigate the existence of a super-simple (ν, 5, 5) balanced incomplete block design and show that such a design exists if and only if ν ≡ 1 (mod 4) and ν ≥ 17 except possibly when ν = 21. Applications of the results to optical orthogonal codes are also mentioned. Research supported by NSERC grant 239135-01.     

Balanced nested designs and balanced arrays

Balanced nested designs are closely related to other combinatorial structures such as balanced arrays and balanced n-ary designs. In particular, the existence of symmetric balanced nested designs is equivalent to the existence of some balanced arrays. In this paper, various constructions for symmetric balanced nested designs are provided. They are used to determine the spectrum of symmetric balanced nested balanced incomplete block designs with block size 3 and 4.     

EMBEDDINGS OF SIMPLE TWO-FOLD BALANCED INCOMPLETE BLOCK DESIGNS WITH BLOCK SIZE FOUR

The necessary and sufficient conditions for the existence of simple incomplete block design (v, w; 4,2)-IPBDs are determined. As a consequence, the necessary and sufficient conditions for the embeddings of simple two-fold balanced incomplete block designs with block size 4 are also determined.     

某些可分解平衡不完全区组设计

本文证明存在某些可分解平衡不完全区组设计RB(k,λ;v)。例如,存在RB(6,5;42)及RB(5,2;55)。     

The 2-adjugate mod 2 class of designs

In this paper we define a 2-adjugate mod 2 class of designs obtained by application of process of 2-adjugation to the incidence matrix of given design and subsequently reducing to modulo 2. General properties of such designs are discussed and its application to the class of unreduced Balanced Incomplete Block Designs is investigated in detail. It is found that in this case we obtain a class of generalized partially balanced incomplete block designs with 2 associate classes and with triangular association scheme, but with unequal block sizes.     

Construction of nested balanced block designs, rectangular designs andq-ary codes

Construction of nested balanced incomplete block (BIB) designs, nested balanced ternary designs and rectangular designs from given nested BIB designs and resolvable BIB designs are described. New constructions ofq-ary codes from nested BIB designs and balanced bipartite weighing designs are also given.     

Block designs with v = 10, k = 5, λ = 4

It was shown by Singhi that there are 21 nonisomorphic block designs BD (10, 5; 18, 9, 4) which are residual designs of (19, 9, 4) Hadamard designs. In this paper we show that there are no other block designs with these parameters, i.e., each such design is embeddable in a symmetric design. We give a complete list of these designs and their automorphism groups.     

On the block structure of BIB designs with parameters v = 22, b = 33, r = 12, k = 8, and λ = 4

It is unknown whether a BIB design with parameters (22, 33, 12, 8, 4) exists or not. In this paper, a necessary condition for the block structure of BIB designs is given. Using this necessary condition, it is shown that the intersection numbers {n_i} for any block in any BIB design with parameters (22, 33, 12, 8, 4) must be one of the four types shown in Table I if the BIB design exists. It is also shown that if there exists a BIB design with parameters (22, 33, 12, 8, 4), the BIB design must contain at least one block of Type 1 or 3 in Table I.     

On the incomplete block designs derivable from the association schemes

Blackwelder (1969) has given two methods of constructing balanced incomplete block (BIB) designs from the association matrices of association schemes with two and three associate classes. In this note these two methods are incorporated in a general method, and the existence of a series of BIB designs is shown by the generalized method. In addition, a remark about partially balanced incomplete block (PBIB) designs with respect to the method is made.     

Inner balance of symmetric designs

A triple array is a row-column design which carries two balanced incomplete block designs (BIBDs) as substructures. McSorley et al. (Des Codes Cryptogr 35: 21–45, 2005), Section 8, gave one example of a triple array that also carries a third BIBD, formed by its row-column intersections. This triple array was said to be balanced for intersection, and they made a search for more such triple arrays among all potential parameter sets up to some limit. No more examples were found, but some candidates with suitable parameters were suggested. We define the notion of an inner design with respect to a block for a symmetric BIBD and present criteria for when this inner design can be balanced. As triple arrays in the canonical case correspond to SBIBDs, this in turn yields new existence criteria for triple arrays balanced for intersection. In particular, we prove that the residual design of the related SBIBD with respect to the defining block must be quasi-symmetric, and give necessary and sufficient conditions on the intersection numbers. This, together with our parameter bounds enable us to exclude the suggested triple array candidates in McSorley et al. (Des Codes Cryptogr 35: 21–45, 2005) and many others in a wide search. Further we investigate the existence of SBIBDs whose inner designs are balanced with respect to every block. We show as a key result that such SBIBDs must possess the quasi-3 property, and we answer the existence question for all known classes of these designs.     

New designs from circular nearrings

Nearrings are generalized rings in which addition is not in general abelian and only one distributive law holds. Some interesting combinatorial structures, as tactical configurations and balanced incomplete block designs (BIBDs) naturally arise when considering the class of planar and circular nearrings. We define the concept of disk and prove that in the case of field-generated planar circular nearrings it yields a BIBD. Such designs can be used in the construction of some classes of codes for which we are able to calculate the parameters.