On the existence of orthogonal arrays OA(3,5,4n+2)

Journal of Combinatorial Theory, Series A(2011)

引用 16|浏览0
暂无评分
摘要
By an OA(3,5,v) we mean an orthogonal array (OA) of order v, strength t=3, index unity and 5 constraints. The existence of such an OA implies the existence of a pair of mutually orthogonal Latin squares (MOLSs) of side v. After Bose, Shrikhande and Parker (1960) [2] disproved the long-standing Euler conjecture in 1960, one has good reason to believe that an OA(3,5,4n+2) exists for any integer n=2. So far, however, no construction of an OA(3,5,4n+2) for any value of n has been given. This paper tries to fill this gap in the literature by presenting an OA(3,5,4n+2) for infinitely many values of n=62.
更多
查看译文
关键词
existence,orthogonal array,constructions,orthogonal arrays oa,orthogonal arrays,side v,integer n,order v,long-standing euler conjecture,orthogonal latin square,index unity,good reason,indexation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要