Theory of optimal blocking for fractional factorial split-plot designs

The issue of optimal blocking for fractional factorial split-plot (FFSP) designs is considered under the two criteria of minimum aberration and maximum estimation capacity. The criteria of minimum secondary aberration (MSA) and maximum secondary estimation capacity (MSEC) are developed for discriminating among rival nonisomorphic blcoked FFSP designs. A general rule for identifying MSA or MSEC blocked FFSP designs through their blocked consulting designs is established.     

Bounds on the maximum numbers of clear two-factor interactions for 2^{(n_1 + n_2 ) - (k_1 + k_2 )} fractional factorial split-plot designs

Fractional factorial split-plot (FFSP) designs have an important value of investigation for their special structures. There are two types of factors in an FFSP design: the whole-plot (WP) factors and sub-plot (SP) factors, which can form three types of two-factor interactions: WP2fi, WS2fi and SP2fi. This paper considers FFSP designs with resolution III or IV under the clear effects criterion. It derives the upper and lower bounds on the maximum numbers of clear WP2fis and WS2fis for FFSP designs, and gives some methods for constructing the desired FFSP designs. It further examines the performance of the construction methods.     

Minimum secondary aberration fractional factorial split-plot designs in terms of consulting designs

It is very powerful for constructing nearly saturated factorial designs to characterize fractional factorial (FF) designs through their consulting designs when the consulting designs are small. Mukerjee and Fang employed the projective geometry theory to find the secondary wordlength pattern of a regular symmetrical fractional factorial split-plot (FFSP) design in terms of its complementary subset, but not in a unified form. In this paper, based on the connection between factorial design theory and coding theory, we obtain some general and unified combinatorial identities that relate the secondary wordlength pattern of a regular symmetrical or mixed-level FFSP design to that of its consulting design. According to these identities, we further establish some general and unified rules for identifying minimum secondary aberration, symmetrical or mixed-level, FFSP designs through their consulting designs.     

BOUND ON THE MAXIMUM NUMBER OF CLEAR TWO-FACTOR INTERACTIONS FOR 2^n-（n-k） DESIGNS

Clear effects criterion is an important criterion for selecting fractional factorial designs[1].Tang et al.[2]derived upper and lower bounds on the maximum number of clear two-factor interactions（2fi＇s）in 2^n-（n-k）designs of resolution Ⅲ and Ⅳ by constructing 2^n-（n-k）designs.But the method in[2]does not perform well sometimes when the resolution is Ⅲ.This article modifies the construction method for 2^n-（n-k） designs of resolution Ⅲ in[2].The modified method is a great improvement on that used in[2].     

Weak minimum aberration and maximum number of clear two-factor interactions in 2_(IV)~(m-p) designs

Both the clear effects and minimum aberration criteria are the important rules for the design selection. In this paper, it is proved that some 2IVm-p designs have weak minimum aberration, by considering the number of clear two-factor interactions in the designs. And some conditions are provided, under which a 2IVm-p design can have the maximum number of clear two-factor interactions and weak minimum aberration at the same time. Some weak minimum aberration 2IVm-p designs are provided for illustrations and two non-isomorphic weak minimum aberration 2IV13-6 designs are constructed at the end of this paper.     

Weak minimum aberration and maximum number of clear two-factor interactions in 2m-p Ⅳ designs

Both the clear effects and minimum aberration criteria are the important rules for the design selection. In this paper, it is proved that some 2m-p Ⅳ designs have weak minimum aberration, by considering the number of clear two-factor interactions in the designs.And some conditions are provided, under which a 2m-p Ⅳ design can have the maximum number of clear two-factor interactions and weak minimum aberration at the same time.Some weak minimum aberration 2m-p Ⅳ designs are provided for illustrations and two nonisomorphic weak minimum aberration 213-6 Ⅳ designs are constructed at the end of this paper.     

Weak minimum aberration and maximum number of clear two-factor interactions in $$2_{IV}^{m - p} $$ designs

Both the clear effects and minimum aberration criteria are the important rules for the design selection. In this paper, it is proved that some designs have weak minimum aberration, by considering the number of clear two-factor interactions in the designs. And some conditions are provided, under which a design can have the maximum number of clear two-factor interactions and weak minimum aberration at the same time. Some weak minimum aberration designs are provided for illustrations and two nonisomorphic weak minimum aberration designs are constructed at the end of this paper.     

Optimal partially balanced fractional 2 m 1+m 2 factorial designs of resolution IV

Summary This paper investigates some partially balanced fractional 2 ^m ₁+m ₂ factorial designs of resolution IV derived from partially balanced arrays, which permit estimation of the general mean, all main effects, all two-factor interactions within each set of them _k factors (k=1, 2) and some linear combinations of the two-factor interactions between the sets of them _k ones. In addition, optimal designs with respect to the generalized trace criterion defined by Shirakura (1976,Ann. Statist.,4, 723–735) are presented for each pair (m ₁,m ₂) with 2≦m ₁≦m ₂ andm ₁+m ₂≦6, and for values ofN (the number of observations) in a reasonable range. Partially supported in part by Grants 56530009 (C) and 57530010 (C).     

Steinberg triality groups acting on 2 - (v, k, 1) designs

A 2 - (v,k,1) design D = (P, B) is a system consisting of a finite set P of v points and a collection B of k-subsets of P, called blocks, such that each 2-subset of P is contained in precisely one block. Let G be an automorphism group of a 2- (v,k,1) design. Delandtsheer proved that if G is block-primitive and D is not a projective plane, then G is almost simple, that is, T ≤ G ≤ Aut(T), where T is a non-abelian simple group. In this paper, we prove that T is not isomorphic to 3D4(q). This paper is part of a project to classify groups and designs where the group acts primitively on the blocks of the design.     

A note on the proportion of singular (0, 1)-matrices in a class associated with fractional 2n factorial designs

Let the set T = {(x₁, x₂,…, x_n): x_i = 0, 1}. Since the elements of T can be seen as binary representations of integers, we order them with their corresponding integer values. Let $\text{Γ}{}^1$ be the set of (n + 1) × (n + 1) matrices of the form [1 … D], where the n + 1 rows of D are distinct ordered elements of T. We show that the proportion of singular matrices in $\text{Γ}{}^1$ approaches 0 as n → ∞.     

8×4×2~n设计纯净两因子交互作用成分最大数的界

混水平部分因析设计在各类试验中有广泛应用.纯净效应准则是用于选取最优部分因析设计的重要准则之一.本文考虑含有一个八水平因子、一个四水平因子和若干二水平因子的8×4×2~n混水平设计,给出了分辨度为Ⅲ和Ⅳ的该类混水平设计包含纯净两因子交互作用成分最大数的上界和下界.下界通过构造特定设计而得到.     

On the robustness of balanced fractional 2m factorial designs of resolution 2l+1 in the presence of outliers

Summary By use of the algebraic structure, we obtain a simplified expression for the outlier-insensitivity factor for balanced fractional 2^m factorial (2^m-BFF) designs of resolution 2l+1 derived from simple arrays (S-arrays), whose measure has been introduced by Ghosh and Kipnegeno (1985,J. Statist. Plann. Inference,11, 119–129). It is defined by use of the measure suggested by Box and Draper (1975,Biometrika, 62 (2), 347–352). As examples, we study the sensitivity ofA-optimal 2^m-BFF designs of resolution VII (i.e.,l=3) given by Shirakura (1976,Ann. Statist.,4, 515–531; 1977,Hiroshima Math. J.,7, 217–285). We observe that these designs are robust in the sense that they have low sensitivities. Research supported in part by Grant 59530012 (C) and 60530014 (C), Japan.     

猜想M(2k,k+1)=3k-1+[(k-1)/2]的反例

Brualdi与Jung在[1]中研究了一类具有固定线和k的n×n矩阵上的最大跳跃数M(n,k),并提出猜想M(2k, k + 1) = 3k - 1 + [(k-1)/2].本文给出了这一猜想的两个反例．     

On the maximum number of fixed points in automorphisms of prime order of 2-(v,k,1) designs

In this paper, we study 2-(v, k, 1) designs with automorphisms of prime orderp, having the maximum possible number of fixed points. We prove an upper bound on the number of fixed points, and we study the structure of designs in which this bound is met with equality (such a design is called ap-MFP(v, k)). Several characterizations and asymptotic existence results forp-MFP(v, k) are obtained. For (p, k)=(3,3), (5,5), (2,3) and (3,4), necessary and sufficient conditions onv are obtained for the existence of ap-MFP(v, k). Further, for 3≤k≤5 and for any primep≡1 modk(k−1), we establish necessary and sufficient conditions onv for the existence of ap-MFP(v, k).     

On the equationx(x +d 1)…(x + (k - 1)d 1) =y(y +d 2)…(y + (mk - 1)d 2)

For given positive integersm ≥ 2,d ₁ andd ₂, we consider the equation of the title in positive integersx, y andk ≥ 2. We show that the equation implies thatk is bounded. For a fixedk, we give conditions under which the equation implies that max(x, y) is bounded. Dedicated to the memory of Professor K G Ramanathan     

中立型方程x(t)+cx(t-ㄒ)+ax(t)+bx(t-ㄒ)=0零解渐近稳定的代数判据

本文建立了方程ｘ（ｔ）＋ｃｔ（ｔ－ｔ）＋ａｘ（ｔ）＋ｂｘ（ｔ－ｔ）＝０零解渐近稳定的充要条件,给出了其零解渐近稳定的代数判据,同时纠正了文［２］中出现的错误．     

Hadamard 2-(63,31,15) designs invariant under the dihedral group of order 10

All Hadamard 2-(63,31,15) designs invariant under the dihedral group of order 10 are constructed and classified up to isomorphism together with related Hadamard matrices of order 64. Affine 2-(64,16,5) designs can be obtained from Hadamard 2-(63,31,15) designs having line spreads by Rahilly’s construction [A. Rahilly, On the line structure of designs, Discrete Math. 92 (1991) 291-303]. The parameter set 2-(64,16,5) is one of two known sets when there exists several nonisomorphic designs with the same parameters and p-rank as the design obtained from the points and subspaces of a given dimension in affine geometry AG(n,p^m) (p a prime). It is established that an affine 2-(64,16,5) design of 2-rank 16 that is associated with a Hadamard 2-(63,31,15) design invariant under the dihedral group of order 10 is either isomorphic to the classical design of the points and hyperplanes in AG(3,4), or is one of the two exceptional designs found by Harada, Lam and Tonchev [M. Harada, C. Lam, V.D. Tonchev, Symmetric (4, 4)-nets and generalized Hadamard matrices over groups of order 4, Designs Codes Cryptogr. 34 (2005) 71-87].