共查询到20条相似文献，搜索用时 15 毫秒
1.
本文讨论型为２＾ｎｕ＾１的有对称正交侣的带洞自正交拉丁方（ＨＳＯＬＳＳＯＭ（２＾ｎｕ＾１））的谱。证明当ｎ≤９时,ＨＳＯＬＳＳＯＭ（２＾ｎｕ＾１）存在的充分必要条件是ｕ为偶数且ｎ≥３ｕ／２＋１;当ｎ≥２６３时,若ｕ为偶数且ｎ≥２（ｕ－２）,则ＨＳＯＬＳＳＯＭ（２＾ｎｕ＾１）存在。 相似文献
2.
Judith Egan 《组合设计杂志》2011,19(4):304-312
In a latin square of order n , a k ‐plex is a selection of kn entries in which each row, column, and symbol occurs k times. A 1 ‐plex is also called a transversal. A k ‐plex is indivisible if it contains no c ‐plex for 0 < c < k . We prove that, for all n ≥ 4 , there exists a latin square of order n that can be partitioned into an indivisible ? n / 2 ?‐plex and a disjoint indivisible ? n / 2 ?‐plex. For all n ≥ 3 , we prove that there exists a latin square of order n with two disjoint indivisible ? n / 2 ?‐plexes. We also give a short new proof that, for all odd n ≥ 5 , there exists a latin square of order n with at least one entry not in any transversal. Such latin squares have no orthogonal mate. Copyright © 2011 Wiley Periodicals, Inc. J Combin Designs 19:304‐312, 2011 相似文献
3.
Ryser conjectured that the number of transversals of a latin square of order n is congruent to n modulo 2. Balasubramanian has shown that the number of transversals of a latin square of even order is even. A 1‐factor of a latin square of order n is a set of n cells no two from the same row or the same column. We prove that for any latin square of order n, the number of 1‐factors with exactly n ? 1 distinct symbols is even. Also we prove that if the complete graph K2n, n ≥ 8, is edge colored such that each color appears on at most edges, then there exists a multicolored perfect matching. © 2004 Wiley Periodicals, Inc. 相似文献
4.
R. J. R. Abel Charles J. Colbourn Jianxing Yin Hantao Zhang 《Designs, Codes and Cryptography》1997,10(3):275-307
The basic necessary condition for the existence of a TD(5, ; v)-TD(5, ; u), namely v 4u, is shown to be sufficient for any 1, except when (v, u) = (6, 1) and = 1, and possibly when (v, u) = (10, 1) or (52, 6) and = 1. For the case = 1, 86 new incomplete transversal designs are constructed. Several construction techniques are developed, and some new incomplete TDs with block size six and seven are also presented. 相似文献
5.
遗传算法作为一种随机化优化搜索方法,已经在很多领域得到了成功应用,但其存在控制参数多且配置困难的问题.本文采用一类最新试验设计方法-计算机试验设计,对遗传算法的参数配置进行优化.结果表明,基于正交拉丁超立方设计的参数配置,其算法的计算精度和速度表现最佳.模拟结果进一步讨论了不同试验设计方案在遗传算法中的差别. 相似文献
6.
In this paper, we study collections of mutually nearly orthogonal Latin squares (MNOLS), which come from a modification of the orthogonality condition for mutually orthogonal Latin squares. In particular, we find the maximum such that there exists a set of cyclic MNOLS of order for , as well as providing a full enumeration of sets and lists of cyclic MNOLS of order under a variety of equivalences with . This resolves in the negative a conjecture that proposed that the maximum for which a set of cyclic MNOLS of order exists is . 相似文献
7.
Charles J. Colbourn Sosina S. Martirosyan Gary L. Mullen Dennis Shasha George B. Sherwood Joseph L. Yucas 《组合设计杂志》2006,14(2):124-138
A covering array CA(N;t,k, v is an N × k array such that every N × t subarray contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006 相似文献
8.
Vladimir N. Potapov 《组合设计杂志》2020,28(8):604-613
A pair of orthogonal latin cubes of order is equivalent to a maximum distance separable code with distance 3 or to an orthogonal array. We construct pairs of orthogonal latin cubes for sequences of previously unknown orders and . The minimal new obtained parameters of orthogonal arrays are . 相似文献
9.
We prove that for all odd m ≥ 3 there exists a latin square of order 3 m that contains an ( m ? 1 ) × m latin subrectangle consisting of entries not in any transversal. We prove that for all even n ≥ 10 there exists a latin square of order n in which there is at least one transversal, but all transversals coincide on a single entry. A corollary is a new proof of the existence of a latin square without an orthogonal mate, for all odd orders n ≥ 11 . Finally, we report on an extensive computational study of transversal‐free entries and sets of disjoint transversals in the latin squares of order n ? 9 . In particular, we count the number of species of each order that possess an orthogonal mate. © 2011 Wiley Periodicals, Inc. J Combin Designs 20:124‐141, 2012 相似文献
10.
Nicholas J. Cavenagh 《Mathematica Slovaca》2008,58(6):691-718
A latin bitrade is a pair of partial latin squares which are disjoint, occupy the same set of non-empty cells, and whose corresponding rows and columns contain the same sets of symbols. This survey paper summarizes the theory of latin bitrades, detailing their applications to critical sets, random latin squares and existence constructions for latin squares. 相似文献
11.
A gerechte framework is a partition of an n × n array into n regions of n cells each. A realization of a gerechte framework is a latin square of order n with the property that when its cells are partitioned by the framework, each region contains exactly one copy of each symbol. A gerechte design is a gerechte framework together with a realization. We investigate gerechte frameworks where each region is a rectangle. It seems plausible that all such frameworks have realizations, and we present some progress toward answering this question. In particular, we show that for all positive integers s and t, any gerechte framework where each region is either an s × t rectangle or a t × s rectangle is realizable. © 2011 Wiley Periodicals, Inc. J Combin Designs 20:112‐123, 2012 相似文献
12.
A k‐plex in a Latin square of order n is a selection of kn entries in which each row, column, and symbol is represented precisely k times. A transversal of a Latin square corresponds to the case k = 1. We show that for all even n > 2 there exists a Latin square of order n which has no k‐plex for any odd but does have a k‐plex for every other . © 2008 Wiley Periodicals, Inc. J Combin Designs 16: 477–492, 2008 相似文献
13.
《组合设计杂志》2018,26(5):219-236
Let and . The integer partition of n is said to be realized if there is a latin square of order n with pairwise disjoint subsquares of order for each . In this paper, we construct latin squares realizing partitions of the form ; that is, partitions with s parts of size a and t parts of size b, where . Heinrich (1982) showed that (1) if and , then there is a latin square realizing , (2) is realized if and only if , and (3) is realized if and only if . In this paper, we resolve the open cases. We show that is realized if and only if and is realized if and only if . 相似文献
14.
An idempotent Latin square of order v is called resolvable and denoted by RILS(v) if the off‐diagonal cells can be resolved into disjoint transversals. A large set of resolvable idempotent Latin squares of order v, briefly LRILS(v), is a collection of RILS(v)s pairwise agreeing on only the main diagonal. In this paper, it is established that there exists an LRILS(v) for any positive integer , except for , and except possibly for . 相似文献
15.
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 相似文献
16.
Nicholas J. Cavenagh 《组合设计杂志》2007,15(4):269-282
A critical set is a partial latin square that has a unique completion to a latin square, and is minimal with respect to this property. Let scs(n) denote the smallest possible size of a critical set in a latin square of order n. We show that for all n, . Thus scs(n) is superlinear with respect to n. We also show that scs(n) ≥ 2n?32 and if n ≥ 25, . © 2007 Wiley Periodicals, Inc. J Combin Designs 15: 269–282, 2007 相似文献
17.
用线性取余变换造正交拉丁方和幻方 总被引：15，自引：0，他引：15
本文利用线性取余变换造正交拉丁方、幻方和泛对角线幻方。文［１］造奇数阶正交拉丁方的方法，文［２］的方法都本文方法的特例。 相似文献
18.
In a latin square of order n, a near transversal is a collection of n ?1 cells which intersects each row, column, and symbol class at most once. A longstanding conjecture of Brualdi, Ryser, and Stein asserts that every latin square possesses a near transversal. We show that this conjecture is true for every latin square that is main class equivalent to the Cayley table of a finite group. 相似文献
19.
Yanxun Chang 《组合设计杂志》2007,15(1):84-89
In this note, a golf design of order 41 is constructed. Combined Colbourn and Nonay's result, the existence spectrum of golf design of order υ is the set {υ: υ≡1 (mod 2), υ ≥ 3, υ ≠ 5}. © 2005 Wiley Periodicals, Inc. J Combin Designs 15: 84–89, 2007 相似文献
20.
The original article to which this erratum refers was correctly published online on 1 December 2011. Due to an error at the publisher, it was then published in Journal of Combinatorial Designs 20: 124–141, 2012 without the required shading in several examples. To correct this, the article is here reprinted in full. The publisher regrets this error. We prove that for all odd there exists a latin square of order 3m that contains an latin subrectangle consisting of entries not in any transversal. We prove that for all even there exists a latin square of order n in which there is at least one transversal, but all transversals coincide on a single entry. A corollary is a new proof of the existence of a latin square without an orthogonal mate, for all odd orders . Finally, we report on an extensive computational study of transversal‐free entries and sets of disjoint transversals in the latin squares of order . In particular, we count the number of species of each order that possess an orthogonal mate. © 2012 Wiley Periodicals, Inc. J. Combin. Designs 20: 344–361, 2012 相似文献