首页> 外文期刊>Journal of Combinatorial Theory, Series A >On the existence of orthogonal arrays OA(3,5,4n+2)
【24h】

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

机译:关于正交数组OA(3,5,4n + 2)的存在

获取原文
获取原文并翻译 | 示例
           

摘要

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.
机译:所谓OA(3,5,v)是指v阶,强度t = 3,索引统一和5个约束的正交数组(OA)。这种OA的存在意味着存在边v的一对相互正交的拉丁方(MOLS)。在Bose,Shrikhande和Parker(1960)[2]于1960年推翻了长期存在的Euler猜想之后,一个有充分的理由相信对于任何n≥2的整数,都存在OA(3,5,4n + 2)。但是,到目前为止,尚未给出任何n值的OA(3,5,4n + 2)的构造。本文试图通过为n≥62的无限多个值给出OA(3,5,4n + 2)来填补文献中的空白。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号