共查询到18条相似文献,搜索用时 39 毫秒
1.
杜北梁 《高校应用数学学报(A辑)》1996,(1):113-120
对角拉丁方是主对角线和反对角线均为截态的拉丁方。本文推广了朱烈[1]中关于正交对角拉丁方的主要构作。作为这些构作的应用,作者改进了Wallis和朱烈[1,2]中关于正交对角拉丁方的结果。 相似文献
2.
3.
1 引言 一个n阶拉丁方是含n个相异元素的集合N上的一个n阶方阵,其每一行和每一列都是N的一个置换.n阶拉丁方的一条截态是位于不同行不同列的n个位置使得其中的n个元素两两相异.n阶对角拉丁方是一个n阶拉丁方,其主对角线(位置()与反对角线(位置()均为截态. 两个n阶拉丁方A和B称为正交的(简记作A上B),如果把它们迭合在一起时,拉丁方A的每一个记号与拉丁方B的每一个记号相遇一次且仅相遇一次.如果一个n阶拉丁方L和它自己的转置正交,则称L为一个自正交的拉丁方,简记为SOLS(n). n阶自正交对角拉… 相似文献
4.
当m和n为同奇或同偶的正整数且m,n≠1,2,3,6时,用m和n阶正交对角拉丁方及{0,1,…,mn-1)上的m×n幻矩与和阵,构作了mn阶标准二次幻方. 相似文献
5.
用线性取余变换造正交拉丁方和幻方 总被引:15,自引:0,他引:15
本文利用线性取余变换造正交拉丁方、幻方和泛对角线幻方。文[1]造奇数阶正交拉丁方的方法,文[2]的方法都本文方法的特例。 相似文献
6.
将对角占优矩阵的性质与矩阵的直积结合起来,给出了两矩阵的直积是对角占优矩阵的一些充分和必要条件,推广了近期的一些结果.最后用相应的数值例子说明了所得结果的有效性. 相似文献
7.
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.
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. 相似文献
12.
Let be a prime and let be the -fold direct product of the cyclic group of order . Rédei conjectured if is the direct product of subsets and , each of which contains the identity element of , then either or does not generate all of . The paper verifies Rédei's conjecture for .
13.
14.
15.
The connections between some countability properties of a topological space (X, ) and its generated fuzzy topological space (X, ω()) are investigated. 相似文献
16.
关于环上矩阵的群逆与Drazin逆 总被引:4,自引:2,他引:4
本文给出了环上一类方阵有群逆,{1,5}-道的充要条件及其它们的表式,推广了体(域)上关于群逆的Cline定理.此外还首次得到了矩阵有Drazin逆的判别准则及其它的表式. 相似文献
17.
Large sets of disjoint group‐divisible designs with block size three and type 2n41 have been studied by Schellenberg, Chen, Lindner and Stinson. These large sets have applications in cryptography in the construction of perfect threshold schemes. It is known that such large sets can exist only for n ≡ 0 (mod 3) and do exist for n = 6 and for all n = 3k, k ≥ 1. In this paper, we present new recursive constructions and use them to show that such large sets exist for all odd n ≡ 0 (mod 3) and for even n = 24m, where m odd ≥ 1. © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 285–296, 2001 相似文献
18.
In this article we give several results and problems on the permutation groups, having an interest for cryptography.
The abstract of the talk at the international conference Algebra and its applications (Krasnoyarsk, August 5–9, 2002).Mathematics Subject Classifications (2000) 05E20, 20B05, 20F05. 相似文献