<p>In this paper, respectively 8, 10 and 9 mutually orthogonal Latin squares (MOLS) of sizes <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10623_2025_1629_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="50" /> </InlineMediaObject> <EquationSource Format="TEX">\(n=54\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>=</mo> <mn>54</mn> </mrow> </math></EquationSource> </InlineEquation>, 96 and 108 are obtained (previously, only 5, 9 and 8 MOLS were respectively known for these values). The cases <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10623_2025_1629_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="50" /> </InlineMediaObject> <EquationSource Format="TEX">\(n=54\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>=</mo> <mn>54</mn> </mrow> </math></EquationSource> </InlineEquation> and 96 are obtained by constructing separable permutation codes consisting of <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10623_2025_1629_Article_IEq3.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="46" /> </InlineMediaObject> <EquationSource Format="TEX">\(8 \times 54\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>8</mn> <mo>×</mo> <mn>54</mn> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10623_2025_1629_Article_IEq4.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="54" /> </InlineMediaObject> <EquationSource Format="TEX">\(10 \times 96\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>10</mn> <mo>×</mo> <mn>96</mn> </mrow> </math></EquationSource> </InlineEquation> codewords, respectively; in addition, these codes respectively have lengths 54, 96 and minimum distances 53, 95. This construction method was used in an earlier paper to obtain 6, 10 and 8 MOLS of sizes <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10623_2025_1629_Article_IEq5.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="50" /> </InlineMediaObject> <EquationSource Format="TEX">\(n=35\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>=</mo> <mn>35</mn> </mrow> </math></EquationSource> </InlineEquation>, 54 and 63, respectively. The case <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10623_2025_1629_Article_IEq6.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="57" /> </InlineMediaObject> <EquationSource Format="TEX">\(n=108\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>=</mo> <mn>108</mn> </mrow> </math></EquationSource> </InlineEquation> is obtained by constructing a (108,&#xa0;10,&#xa0;1) difference matrix. Also, a previous error when constructing 6 MOLS of size <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10623_2025_1629_Article_IEq7.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="50" /> </InlineMediaObject> <EquationSource Format="TEX">\(n=45\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>=</mo> <mn>45</mn> </mrow> </math></EquationSource> </InlineEquation> is corrected.</p>

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

Improvements for lower bounds of mutually orthogonal Latin squares of sizes 54, 96 and 108

  • R. Julian R. Abel,
  • Ingo Janiszczak,
  • Reiner Staszewski

摘要

In this paper, respectively 8, 10 and 9 mutually orthogonal Latin squares (MOLS) of sizes \(n=54\) n = 54 , 96 and 108 are obtained (previously, only 5, 9 and 8 MOLS were respectively known for these values). The cases \(n=54\) n = 54 and 96 are obtained by constructing separable permutation codes consisting of \(8 \times 54\) 8 × 54 and \(10 \times 96\) 10 × 96 codewords, respectively; in addition, these codes respectively have lengths 54, 96 and minimum distances 53, 95. This construction method was used in an earlier paper to obtain 6, 10 and 8 MOLS of sizes \(n=35\) n = 35 , 54 and 63, respectively. The case \(n=108\) n = 108 is obtained by constructing a (108, 10, 1) difference matrix. Also, a previous error when constructing 6 MOLS of size \(n=45\) n = 45 is corrected.