首页 | 本学科首页   官方微博 | 高级检索  
     检索      

相互正交F—方的完备组
引用本文:罗华.相互正交F—方的完备组[J].苏州科技学院学报(社会科学版),1992(Z2).
作者姓名:罗华
作者单位:苏州市交通局
摘    要:Heclayat与Seiden1970年提出了F—方及正交F—方的概念。有一种型的正交F—方完备组已由上述作者及其他人讨论过。本文目的在于讨论多种型的正交F—方完备组的存在性和构造方法。我们引进了正交均分组和直和子空间完备组的概念,并利用它们构造正交F—方的完备组,得到了某些情形下正交F—方完备组存在的充分必要条件。

关 键 词:拉丁方  正交拉丁方  频率方(F—方)  相互正交F—方  正交F—方完备组  正交均分组  直和子空间的完备组

Complete Sets of Mutually Orthogonal F-squares
Luo Hua.Complete Sets of Mutually Orthogonal F-squares[J].Journal of University of Science and Technology of Suzhou:Social Science,1992(Z2).
Authors:Luo Hua
Institution:Traffic Bureau of Suzhou
Abstract:The concepts of F- squares and orthogonal F-squares were first introduced by Hedayat and Seiden in 1970. The complete sets of mutually orthgonal F-squares with single type have been discussed by the above authors and others. The purpose of this paper is to investigate the existence and the construction of complete sets of mutually orthogonal F-squares with several types. We introduce the concepts of orthogonal equal patitions and complete sets of direct sum subspaces to construct complete sets of mutually orthogonal F-squares, and to obtain, in some cases: the necessary and sufficient condition for the existence of mutually orthogonal F-squares.
Keywords:latin squares  orthogonal latin square  F-square  orthogonal F-square  complete sets of mutually orthogonal F-square  orthogonal equal patitions  complete sets of direct sum subspaces
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号