In this paper, the character matrix x n is studied, fast construction method of matrix X 2m is provided. And it is proved that the lower bound estimate of the number of an Latin squares matrix D[X m] is2m(2m)!+...In this paper, the character matrix x n is studied, fast construction method of matrix X 2m is provided. And it is proved that the lower bound estimate of the number of an Latin squares matrix D[X m] is2m(2m)!+∑mi=2[(2m)!] 2∏ij=1K j!∏rj=1b j!.展开更多
本文引入了强拉丁方和强拉丁矩的概念 ,证明了当 m≥ 2且为偶数时 ,强拉丁矩的数目是 (2 m) !·2 m ( m -1 ) / 2 ,如果我们不考虑同构 ,有 (2 m ) !· 2 m ( m -1 ) / 2 -(m-1)· 2 m -1 ) ( m -2 ) / 2 个竞赛图 ,且完全...本文引入了强拉丁方和强拉丁矩的概念 ,证明了当 m≥ 2且为偶数时 ,强拉丁矩的数目是 (2 m) !·2 m ( m -1 ) / 2 ,如果我们不考虑同构 ,有 (2 m ) !· 2 m ( m -1 ) / 2 -(m-1)· 2 m -1 ) ( m -2 ) / 2 个竞赛图 ,且完全图 k2 m +1 有 2 m ( m -1 ) /展开更多
In this paper, the character matrix x n is studied, fast construction method of matrix X 2m is provided. And it is proved that the lower bound estimate of the number of an Latin squares matrix D[X m] is2m(2m)!+...In this paper, the character matrix x n is studied, fast construction method of matrix X 2m is provided. And it is proved that the lower bound estimate of the number of an Latin squares matrix D[X m] is2m(2m)!+∑mi=2[(2m)!] 2∏ij=1K j!∏rj=1b j!.展开更多
文摘In this paper, the character matrix x n is studied, fast construction method of matrix X 2m is provided. And it is proved that the lower bound estimate of the number of an Latin squares matrix D[X m] is2m(2m)!+∑mi=2[(2m)!] 2∏ij=1K j!∏rj=1b j!.
文摘本文引入了强拉丁方和强拉丁矩的概念 ,证明了当 m≥ 2且为偶数时 ,强拉丁矩的数目是 (2 m) !·2 m ( m -1 ) / 2 ,如果我们不考虑同构 ,有 (2 m ) !· 2 m ( m -1 ) / 2 -(m-1)· 2 m -1 ) ( m -2 ) / 2 个竞赛图 ,且完全图 k2 m +1 有 2 m ( m -1 ) /
文摘In this paper, the character matrix x n is studied, fast construction method of matrix X 2m is provided. And it is proved that the lower bound estimate of the number of an Latin squares matrix D[X m] is2m(2m)!+∑mi=2[(2m)!] 2∏ij=1K j!∏rj=1b j!.