共查询到20条相似文献,搜索用时 15 毫秒
1.
E. R. Lamken 《Designs, Codes and Cryptography》1997,11(1):37-71
A generalized balanced tournament design, GBTD(n, k), defined on a kn-set V, is an arrangement of the blocks of a (kn, k, k – 1)-BIBD defined on V into an n × (kn – 1) array such that (1) every element of V is contained in precisely one cell of each column, and (2) every element of V is contained in at most k cells of each row. Suppose we can partition the columns of a GBTD(n, k) into k + 1 sets B1, B2,..., Bk + 1 where |Bi| = n for i = 1, 2,..., k – 2, |Bi| = n–1 for i = k – 1, k and |Bk+1| = 1 such that (1) every element of V occurs precisely once in each row and column of Bi for i = 1, 2,..., k – 2, and (2) every element of V occurs precisely once in each row and column of Bi Bk+1 for i = k – 1 and i = k. Then the GBTD(n, k) is called partitioned and we denote the design by PGBTD(n, k). The spectrum of GBTD(n, 3) has been completely determined. In this paper, we determine the spectrum of PGBTD(n,3) with, at present, a fairly small number of exceptions for n. This result is then used to establish the existence of a class of Kirkman squares in diagonal form. 相似文献
2.
Multi‐layered Youden rectangles are introduced. These new designs include double and triple Youden rectangles as subdesigns. Though many double Youden rectangles are known, the triples, introduced in 1994, have to now yielded few nontrivial examples. Two infinite series of multi‐layered Youden rectangles are constructed, and so also many new triple Youden rectangles. 相似文献
3.
4.
Summary Saha [6] has shown the equivalence between a ‘tactical system’ (or at-design) and a 2-symbol balanced array (BA) of strengtht. The implicit method of construction of BA in that paper has been generalized herein to that of ans-symbol BA of strengtht. Some BIB and PBIB designs are also constructed from these arrays. Majindar [2], Vanstone [8] and Saha [6] have all shown
that the existence of a symmetrical BIBD forv treatments implies the existence of six more BIBD's forv treatments in (v/2) blocks. An analogue of this result has been obtained for a large class of PBIB designs in this paper. 相似文献
5.
In this paper we consider experimental situations requiring usage of a row-column design where v treatments are to be applied to experimental units arranged in b
1 rows and b
2 columns where row i has size k
1i
, i=1,..., b
1 and column j has size k
2j
, j=1,..., b
2. Conditions analogous to those given in Kunert (1983, Ann. Statis., 11, 247–257) and Cheng (1978, Ann. Statist., 6, 1262–1272) are given which can often be used to establish the optimality of a given row-column design from the optimality of an associated block design. In addition, sufficient conditions are derived which guarantee the existence of an optimal row-column design which can be constructed by appropriately arranging treatments within blocks of an optimal block design.Visiting from the Indian Statistical Institute. 相似文献
6.
Marco Buratti 《组合设计杂志》1998,6(3):165-182
We present a new recursive construction for difference matrices whose application allows us to improve some results by D. Jungnickel. For instance, we prove that for any Abelian p-group G of type (n1, n2, …, nt) there exists a (G, pe, 1) difference matrix with e = Also, we prove that for any group G there exists a (G, p, 1) difference matrix where p is the smallest prime dividing |G|. Difference matrices are then used for constructing, recursively, relative difference families. We revisit some constructions by M. J. Colbourn, C. J. Colbourn, D. Jungnickel, K. T. Phelps, and R. M. Wilson. Combining them we get, in particular, the existence of a multiplier (G, k, λ)-DF for any Abelian group G of nonsquare-free order, whenever there exists a (p, k, λ)-DF for each prime p dividing |G|. Then we focus our attention on a recent construction by M. Jimbo. We improve this construction and prove, as a corollary, the existence of a (G, k, λ)-DF for any group G under the same conditions as above. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 165–182, 1998 相似文献
7.
Hsin-Min Sun 《组合设计杂志》2013,21(2):47-59
We show that, when the number of elements is a prime power q, in many situations the necessary conditions
- ,
- , and
8.
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
2,x
1) for B=(x
1,x
2,,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 相似文献
9.
Jeff Higham 《组合设计杂志》1998,6(1):63-77
A construction for a row-complete latin square of order n, where n is any odd composite number other than 9, is given in this article. Since row-complete latin squares of order 9 and of even order have previously been constructed, this proves that row-complete latin squares of every composite order exist. © 1998 John Wiley & Sons, Inc. J Combin Designs 6:63–77, 1998 相似文献
10.
正交平衡区组设计(或者广义正交表)是一种类似于正交拉丁方(或者正交表)的新设计,但试验次数大幅减少.通过对正交平衡区组设计统计分析模型参数估计的分布特征进行了深入研究.研究发现,在试验数据正态性的情况下,各种参数估计也服从正态分布,并且各种参数的最小二乘估计都是无偏的,得到了各种参数估计的方差和独立性性质. 相似文献
11.
We propose a technique for constructing two infinite families of non‐embeddable quasi‐residual designs as soon as one such design satisfying certain conditions exists. The main tools are generalized Hadamard matrices and balanced generalized weighing matrices. Starting with a specific non‐embeddable quasi‐residual 2‐(27,9,4) design, we construct for every positive integer m a non‐embeddable 2‐(3m,3m?1,(3m?1?1)/2)‐design, and, if rm=(3m?1)/2 is a prime power, we construct for every positive integer n a non‐embeddable design. For each design in these families, a symmetric design with the corresponding parameters is known to exist. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 160–172, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.900 相似文献
12.
超饱和设计在搜索试验中有重要应用.自上世纪九十年代迄今, 超饱和设计的研究取得了丰硕成果,研究的设计从二水平发展到多水平, 进而到混合水平;构造方法从巧妙的构思到利用组合理论进行系统构造,进而到各种算法的开发; 对于超饱和设计的评优准则也有更深入的认识.本文介绍一种构造多水平超饱和设计的新方法. 这种方法简单易行,很容易构造出具有优良性质的多水平超饱和设计, 有很强的实用性. 相似文献
13.
Marco Buratti 《Designs, Codes and Cryptography》1999,16(2):117-120
We give the explicit construction of a regular (17q, 17, 2)-BIBD for any prime power q 17 (mod 32) such that 2 is not a 4th power in GF(q) and the explicit construction of a regular (25q, 25, 3)-BIBD for any prime power q 25 (mod 48) such that
and
+3 are non-squares in GF(q). 相似文献
14.
正交平衡区组设计(或者广义正交表)是一种类似于正交拉丁方(或者正交表)的新设计,但试验次数大幅减少.定义了一种基于正交相遇平衡区组设计(或者广义正交表)的统计分析模型,根据这个模型,给出了参数的最小二乘估计的矩阵形式. 相似文献
15.
Uniform supersaturated design and its construction 总被引:6,自引:0,他引:6
Supersaturated designs are factorial designs in which the number of main effects is greater than the number of experimental
runs. In this paper, a discrete discrepancy is proposed as a measure of uniformity for supersaturated designs, and a lower
bound of this discrepancy is obtained as a benchmark of design uniformity. A construction method for uniform supersaturated
designs via resolvable balanced incomplete block designs is also presented along with the investigation of properties of the
resulting designs. The construction method shows a strong link between these two different kinds of designs 相似文献
16.
Yury J. Ionin 《Designs, Codes and Cryptography》1998,13(2):147-158
Let M be a set of incidence matrices of symmetric (v,k,)-designs and G a group of mappings M M. We give a sufficient condition for the matrix W M, where M M and W is a balanced generalized weighing matrix over G, to be the incidence matrix of a larger symmetric design. This condition is then applied to the designs corresponding to McFarland and Spence difference sets, and it results in four families of symmetric (v,k, )-designs with the following parameters k and (m and d are positive integers, p and q are prime powers): (i)
; (ii)
; (iii)
; (iv)
. 相似文献
17.
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. 相似文献
18.
In this paper we study a generalization of symmetric latin squares. A symmetric balanced square of order v, side s and blocksize k is an s×s symmetric array of k-element subsets of {1,2,..., v} such that every element occurs in ks/v or ks/v cells of each row and column. every element occurs in ks2/v or ks
2
v cells of the array. Depending on the values s, k and v, the problem naturally divides into three subproblems: (1) vks (2) s < v < ks (3) v s. We completely solve the first problem and we recursively reduce the third problem to the first two. For s 4 we provide direct constructions for the second problem. Moreover, we provide a general construction method for the second problem utilizing flows in a network. We have been able to show the correctness of this construction for k 3. For k4, the problem remains open. 相似文献
19.
Given a BIBD S = (V, B), its 1-block-intersection graph Gs has as vertices the elements of B; two vertices B1, B2 ∈ B are adjacent in Gs if |B1 ∩ B2| = 1. If S is a triple system of arbitrary index λ, it is shown that GS is hamiltonian. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 243-246, 1999 相似文献
20.
广义正交表是一种类似于正交表的新设计.正交平衡性是广义正交表必须满足的基本要求之一,它是正交表正交性的推广,它能够使得试验因子在方差分析中保持柯赫伦定理成立,因而可以像正交表一样进行试验设计和方差分析,从而不但保证其数据分析模型符合"不自生"逻辑,而且也可以保证试验因子的各种关系比较的数据分析结论具有客观一致性和可重复再现性,但试验次数大幅减少.利用矩阵象技术,提出并证明了广义正交表的组合正交性不但等价于其矩阵象的正交性,而且也等价于其广义关联矩阵的正交性.借助于SAS软件可以方便快速的验证某些区组设计相应的行列设计是否为广义正交表. 相似文献