Balanced Incomplete Block Designs with Block Size 7

The object of this paper is the construction of balanced incomplete block designs with k=7. This paper continues the work begun by Hanani, who solved the construction problem for designs with a block size of 7, and with =6, 7, 21 and 42. The construction problem is solved here for designs with > 2 except for v=253, = 4,5 ; also for = 2, the number of unconstructed designs is reduced to 9 (1 nonexistent, 8 unknown).     

Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications

Generalized balanced tournament packings (GBTPs) extend the concept of generalized balanced tournament designs introduced by Lamken and Vanstone (1989). In this paper, we establish the connection between GBTPs and a class of codes called equitable symbol weight codes (ESWCs). The latter were recently demonstrated to optimize the performance against narrowband noise in a general coded modulation scheme for power line communications. By constructing classes of GBTPs, we establish infinite families of optimal ESWCs with code lengths greater than alphabet size and whose narrowband noise error‐correcting capability to code length ratios do not diminish to zero as the length grows.     

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

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

��ٷ�Ѱ������ƽ���������

对试验次数较小的情形, 我们可以运用穷举法来寻找其可能存在的正交平衡区组设计. 这样做一方面可以尽可能多地找到正交平衡区组设计, 另一方面也可以为今后我们构造试验次数较大的正交平衡区组设计奠定基础. 本文最后给出了试验次数n=9以内的部分正交平衡区组设计.     

正交平衡区组设计统计分析模型参数估计的分布特征研究

正交平衡区组设计(或者广义正交表)是一种类似于正交拉丁方(或者正交表)的新设计,但试验次数大幅减少.通过对正交平衡区组设计统计分析模型参数估计的分布特征进行了深入研究.研究发现,在试验数据正态性的情况下,各种参数估计也服从正态分布,并且各种参数的最小二乘估计都是无偏的,得到了各种参数估计的方差和独立性性质.     

正交平衡区组设计统计分析模型的参数估计

正交平衡区组设计(或者广义正交表)的数据分析类似于正交拉丁方(或者正交表)的数据分析,但试验次数大幅减少.引入了相遇平衡区组设计矩阵象的概念,定义了一种基于正交相遇平衡区组设计(或者广义正交表)的统计分析模型,根据这个模型,推导得到了参数的最小二乘估计.     

分块矩阵[A B]中一块的广义逆

给出矩阵[A B]的广义逆,其中A∈Cm×k,B∈Cm×(n-k),本文得到子块A的相关广义逆的计算公式.     

正交平衡区组设计统计分析模型参数估计的矩阵表达

正交平衡区组设计(或者广义正交表)是一种类似于正交拉丁方(或者正交表)的新设计,但试验次数大幅减少.定义了一种基于正交相遇平衡区组设计(或者广义正交表)的统计分析模型,根据这个模型,给出了参数的最小二乘估计的矩阵形式.     

The Existence of BIB Designs

Abstract Given any positive integers k≥ 3 and λ, let c(k, λ) denote the smallest integer such that v∈B(k, λ) for every integer v≥c(k, λ) that satisfies the congruences λv(v− 1) ≡ 0(mod k(k− 1)) and λ(v− 1) ≡ 0(mod k− 1). In this article we make an improvement on the bound of c(k, λ) provided by Chang in [4] and prove that . In particular, . Supported by NSFC Grant No. 19701002 and Huo Yingdong Foundation     

Generalized Bhaskar Rao Designs with Block Size 3 over Finite Abelian Groups

We show that if G is a finite Abelian group and the block size is 3, then the necessary conditions for the existence of a (v,3,λ;G) GBRD are sufficient. These necessary conditions include the usual necessary conditions for the existence of the associated (v,3,λ) BIBD plus λ≡ 0 (mod|G|), plus some extra conditions when |G| is even, namely that the number of blocks be divisible by 4 and, if v = 3 and the Sylow 2-subgroup of G is cyclic, then also λ≡ 0 (mod2|G|).     

Self-Converse Directed BIBDs with Block Size Four

A directed balanced incomplete block design (or D B(k,;v)) (X,) is called self-converse if there is an isomorphic mapping f from (X,) to (X,^–1), where ^–1={B ^–1:B} and B ^–1=(x _k ,x _{k –1},,x ₂,x ₁) for B=(x ₁,x ₂,,x _{k –1},x _k ). In this paper, we give the existence spectrum for self-converse D B(4,1;v). AMS Classification:05BResearch supported in part by NSFC Grant 10071002 and SRFDP under No. 20010004001     

Decomposable super‐simple NRBIBDs with block size 4 and index 6

Necessary conditions for the existence of a super‐simple, decomposable, near‐resolvable ‐balanced incomplete block design (BIBD) whose 2‐component subdesigns are both near‐resolvable ‐BIBDs are (mod ) and . In this paper, we show that these necessary conditions are sufficient. Using these designs, we also establish that the necessary conditions for the existence of a super‐simple near‐resolvable ‐RBIBD, namely (mod ) and , are sufficient. A few new pairwise balanced designs are also given.     

Semiframes with Block Size Three and Odd Group Size

A ‐semiframe of type is a ‐GDD of type , , in which the collection of blocks can be written as a disjoint union where is partitioned into parallel classes of and is partitioned into holey parallel classes, each holey parallel class being a partition of for some . A ‐SF is a ‐semiframe of type in which there are p parallel classes in and d holey parallel classes with respect to . In this paper, we shall show that there exists a (3, 1)‐SF for any if and only if , , , and .     

平衡区组正交表与正交表的比较及应用

对平衡区组正交表和正交表进行的数据分析作了比较,表现出平衡区组正交表的优良性.给出了平衡区组正交表的应用实例,且对试验结果进行了分析.同时得出,分别用平衡区组正交表GL6(3221)和正交表L9(34)处理同一个问题时,所得试验结果一致.     

On the Enumeration of ‐Optimal and Minimax‐Optimal k‐Circulant Supersaturated Designs

In recent years, several methods have been proposed for constructing ‐optimal and minimax‐optimal supersaturated designs (SSDs). However, until now the enumeration problem of such designs has not been yet considered. In this paper, ‐optimal and minimax‐optimal k‐circulant SSDs with 6, 10, 14, 18, 22, and 26 runs, factors and are enumerated in a computer search. We have also enumerated all ‐optimal and minimax‐optimal k‐circulant SSDs with (mod 4) and . The computer search utilizes the fact that theses designs are equivalent to certain 1‐rotational resolvable balanced incomplete block designs. Combinatorial properties of these resolvable designs are used to restrict the search space.     

On the Existence of Simple BIBDs with Number of Elements a Prime Power

We show that, when the number of elements is a prime power q, in many situations the necessary conditions

相似文献   

广义正交表正交性的等价条件

广义正交表是一种类似于正交表的新设计.正交平衡性是广义正交表必须满足的基本要求之一,它是正交表正交性的推广,它能够使得试验因子在方差分析中保持柯赫伦定理成立,因而可以像正交表一样进行试验设计和方差分析,从而不但保证其数据分析模型符合"不自生"逻辑,而且也可以保证试验因子的各种关系比较的数据分析结论具有客观一致性和可重复再现性,但试验次数大幅减少.利用矩阵象技术,提出并证明了广义正交表的组合正交性不但等价于其矩阵象的正交性,而且也等价于其广义关联矩阵的正交性.借助于SAS软件可以方便快速的验证某些区组设计相应的行列设计是否为广义正交表.     

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     

Realizations for direct constructions of resolvable Steiner 2‐designs with block size 5

We consider direct constructions due to R. J. R. Abel and M. Greig, and to M. Buratti, for ({ν},5,1) balanced incomplete block designs. These designs are defined using the prime fields F_p for certain primes p, are 1‐rotational over G ⊕ F_p where G is a group of order 4, and are also resolvable under certain conditions. We introduce specifications to the constructions and, by means of character sum arguments, show that the constructions yield resolvable designs whenever p is sufficiently large. © 2000 John Wiley & Sons, Inc. J Combin Designs 8:207–217, 2000     

A construction of resolvable nested 3‐designs

A method of constructing resolvable nested 3‐designs from an affine resolvable 3‐design is proposed with one example. © 2004 Wiley Periodicals, Inc.