共查询到20条相似文献,搜索用时 15 毫秒
2.
D. T. Todorov 《组合设计杂志》2012,20(8):363-367
The paper gives example of orthogonal array OA(6, 14) obtained from a difference matrix . The construction is equivalent to four mutually orthogonal Latin squares (MOLS) of order 14. © 2012 Wiley Periodicals, Inc. J. Combin. Designs 20: 363–367, 2012 相似文献
3.
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 相似文献
4.
Direct Constructions for General Families of Cyclic Mutually Nearly Orthogonal Latin Squares
下载免费PDF全文
![点击此处可从《组合设计杂志》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Two Latin squares and , of even order n with entries , are said to be nearly orthogonal if the superimposition of L on M yields an array in which each ordered pair , and , occurs at least once and the ordered pair occurs exactly twice. In this paper, we present direct constructions for the existence of general families of three cyclic mutually orthogonal Latin squares of orders , , and . The techniques employed are based on the principle of Methods of Differences and so we also establish infinite classes of “quasi‐difference” sets for these orders. 相似文献
5.
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 . 相似文献
6.
当m和n为同奇或同偶的正整数且m,n≠1,2,3,6时,用m和n阶正交对角拉丁方及{0,1,…,mn-1)上的m×n幻矩与和阵,构作了mn阶标准二次幻方. 相似文献
7.
讨论不完全自正交拉丁方ISOLS(v;3,3)的存在性问题.证明当v≥12,v{13,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,33,35,36}时,存在ISOLS(v;3,3). 相似文献
8.
We introduce a linear method for constructing factor‐pair Latin squares of prime‐power order and we identify criteria for determining whether two factor‐pair Latin squares constructed using this linear method are orthogonal. Then we show that families of pairwise mutually orthogonal diagonal factor‐pair Latin squares exist in all prime‐power orders. 相似文献
9.
We establish the non-existence of a maximal set of four mols (mutually orthogonal Latin squares) of order 8 and the non-existence of (8, 5) projective Hjelmslev planes. We present a maximal set of four mols of order 9. 相似文献
10.
本文讨论型为2^nu^1的有对称正交侣的带洞自正交拉丁方(HSOLSSOM(2^nu^1))的谱。证明当n≤9时,HSOLSSOM(2^nu^1)存在的充分必要条件是u为偶数且n≥3u/2+1;当n≥263时,若u为偶数且n≥2(u-2),则HSOLSSOM(2^nu^1)存在。 相似文献
11.
Multidimensional Permanents and an Upper Bound on the Number of Transversals in Latin Squares
下载免费PDF全文
![点击此处可从《组合设计杂志》网站下载免费的PDF全文](/ch/ext_images/free.gif)
A. A. Taranenko 《组合设计杂志》2015,23(7):305-320
The permanent of a multidimensional matrix is the sum of products of entries over all diagonals. A nonnegative matrix whose every 1‐dimensional plane sums to 1 is called polystochastic. A latin square of order n is an array of n symbols in which each symbol occurs exactly once in each row and each column. A transversal of such a square is a set of n entries such that no two entries share the same row, column, or symbol. Let T(n) be the maximum number of transversals over all latin squares of order n. Here, we prove that over the set of multidimensional polystochastic matrices of order n the permanent has a local extremum at the uniform matrix for whose every entry is equal to . Also, we obtain an asymptotic value of the maximal permanent for a certain set of nonnegative multidimensional matrices. In particular, we get that the maximal permanent of polystochastic matrices is asymptotically equal to the permanent of the uniform matrix, whence as a corollary we have an upper bound on the number of transversals in latin squares 相似文献
12.
Leonard H. Soicher 《组合设计杂志》2012,20(6):265-277
Let n and k be integers, with and . An semi‐Latin square S is an array, whose entries are k‐subsets of an ‐set, the set of symbols of S, such that each symbol of S is in exactly one entry in each row and exactly one entry in each column of S. Semi‐Latin squares form an interesting class of combinatorial objects which are useful in the design of comparative experiments. We say that an semi‐Latin square S is uniform if there is a constant μ such that any two entries of S, not in the same row or column, intersect in exactly μ symbols (in which case ). We prove that a uniform semi‐Latin square is Schur‐optimal in the class of semi‐Latin squares, and so is optimal (for use as an experimental design) with respect to a very wide range of statistical optimality criteria. We give a simple construction to make an semi‐Latin square S from a transitive permutation group G of degree n and order , and show how certain properties of S can be determined from permutation group properties of G. If G is 2‐transitive then S is uniform, and this provides us with Schur‐optimal semi‐Latin squares for many values of n and k for which optimal semi‐Latin squares were previously unknown for any optimality criterion. The existence of a uniform semi‐Latin square for all integers is shown to be equivalent to the existence of mutually orthogonal Latin squares (MOLS) of order n. Although there are not even two MOLS of order 6, we construct uniform, and hence Schur‐optimal, semi‐Latin squares for all integers . & 2012 Wiley Periodicals, Inc. J. Combin. Designs 00: 1–13, 2012 相似文献
13.
本文把a水平因子的平方和分解成相互正交的a-1个对照的平方和,这样总变差平方和就可以分解成a个部分(包括残差项),然后又将该分解方法推广到了多因子的情形,并通过因子平方和的分解找到了多因子交互效应对应的对照向量,这使得多水平因子交互效应的计算和解释更加容易,也为方差分析带来了更多的方便,最后给出了几个应用示例。 相似文献
14.
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. 相似文献
15.
Latin hypercube designs have been found very useful for designing computer experiments. In recent years, several methods of constructing orthogonal Latin hypercube designs have been proposed in the literature. In this article, we report some more results on the construction of orthogonal Latin hypercubes which result in several new designs. 相似文献
16.
Pooya Hatami 《Journal of Combinatorial Theory, Series A》2008,115(7):1103-1113
It is proved that every n×n Latin square has a partial transversal of length at least n−O(log2n). The previous papers proving these results (including one by the second author) not only contained an error, but were sloppily written and quite difficult to understand. We have corrected the error and improved the clarity. 相似文献
17.
Determination of Sizes of Optimal Three‐Dimensional Optical Orthogonal Codes of Weight Three with the AM‐OPP Restriction
下载免费PDF全文
![点击此处可从《组合设计杂志》网站下载免费的PDF全文](/ch/ext_images/free.gif)
In this paper, we further investigate the constructions on three‐dimensional optical orthogonal codes with the at most one optical pulse per wavelength/time plane restriction (briefly AM‐OPP 3D ‐OOCs) by way of the corresponding designs. Several new auxiliary designs such as incomplete holey group divisible designs and incomplete group divisible packings are introduced and therefore new constructions are presented. As a consequence, the exact number of codewords of an optimal AM‐OPP 3D ‐OOC is finally determined for any positive integers and . 相似文献
18.
Large sets of disjoint group‐divisible designs with block size three and type 2n41 were first studied by Schellenberg and Stinson because of their connection with perfect threshold schemes. It is known that such large sets can exist only for n ≡0 (mod 3) and do exist for all odd n ≡ (mod 3) and for even n=24m, where m odd ≥ 1. In this paper, we show that such large sets exist also for n=2k(3m), where m odd≥ 1 and k≥ 5. To accomplish this, we present two quadrupling constructions and two tripling constructions for a special large set called *LS(2n). © 2002 Wiley Periodicals, Inc. J Combin Designs 11: 24–35, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10032 相似文献
19.
20.
利用不同的序列作为波长跳频序列和时间扩频序列可以构造出不同的二维光正交码在众多文献中已有所报道.在经过正交拉丁方(OLS)与跳频序列的相关性研究之后.做了以下主要工作:首先,将正交拉丁方(OLS)序列作为波长跳频序列,结合一维时间扩频序列(OOC),构造了一种OLS/OOC二维光正交码.然后,本文对构造的OLS/OOC进行了多种性能仿真和分析.相对于PC/OOC、OCFHC/OOC等二维光正交码而言,OLS/OOC的波长数并不局限于素数,更能充分利用MWOCDMA系统中的有效波长数.仿真和分析表明:码字具有很好的相关性能,码字容量直逼理论极限,为一种渐近最优二维光正交码. 相似文献