<p>An orthogonal array of index unity, or order <i>v</i>, degree <i>k</i> and strength <i>t</i>, denoted by OA(<i>t</i>,&#xa0;<i>k</i>,&#xa0;<i>v</i>), is a <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(k\times v^t\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo>×</mo> <msup> <mi>v</mi> <mi>t</mi> </msup> </mrow> </math></EquationSource> </InlineEquation> array with entries from a set <i>V</i> of <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(v\ge 2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>v</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation> symbols such that each of its <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(t\times v^t\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>t</mi> <mo>×</mo> <msup> <mi>v</mi> <mi>t</mi> </msup> </mrow> </math></EquationSource> </InlineEquation> subarrays contains every <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(t\times 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>t</mi> <mo>×</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> column vector over <i>V</i> exactly once. The construction of orthogonal arrays OA(3,&#xa0;6,&#xa0;<i>v</i>) remains a longstanding open problem, particularly for values of <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(v \equiv 2\pmod {4}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>v</mi> <mo>≡</mo> <mn>2</mn> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>4</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> or <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(v \equiv 3,15 \pmod {18}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>v</mi> <mo>≡</mo> <mn>3</mn> <mo>,</mo> <mn>15</mn> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>18</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>. In this paper, we extend the framework of three dimensional orthogonal large sets of disjoint incomplete Latin squares, and develop new algebraic constructions over finite fields. As a result, we establish new infinite families of OA(3,&#xa0;6,&#xa0;<i>v</i>), significantly expanding the known parameter spectrum for these arrays.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

New progress on orthogonal arrays OA(3, 6, v)

  • Dongliang Li,
  • Haitao Cao

摘要

An orthogonal array of index unity, or order v, degree k and strength t, denoted by OA(tkv), is a \(k\times v^t\) k × v t array with entries from a set V of \(v\ge 2\) v 2 symbols such that each of its \(t\times v^t\) t × v t subarrays contains every \(t\times 1\) t × 1 column vector over V exactly once. The construction of orthogonal arrays OA(3, 6, v) remains a longstanding open problem, particularly for values of \(v \equiv 2\pmod {4}\) v 2 ( mod 4 ) or \(v \equiv 3,15 \pmod {18}\) v 3 , 15 ( mod 18 ) . In this paper, we extend the framework of three dimensional orthogonal large sets of disjoint incomplete Latin squares, and develop new algebraic constructions over finite fields. As a result, we establish new infinite families of OA(3, 6, v), significantly expanding the known parameter spectrum for these arrays.