{"title":"Doubly Orthogonal Equi-Squares and Sliced Orthogonal Arrays","authors":"John Lorch","doi":"10.1002/jcd.21982","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>We introduce doubly orthogonal equi-squares. Using linear algebra over finite fields, we produce large families of mutually <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <msup>\n <mi>q</mi>\n \n <mi>s</mi>\n </msup>\n </mrow>\n </mrow>\n </semantics></math>-doubly orthogonal equi-<span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <msup>\n <mi>q</mi>\n \n <mrow>\n <mi>r</mi>\n \n <mo>+</mo>\n \n <mi>s</mi>\n </mrow>\n </msup>\n </mrow>\n </mrow>\n </semantics></math> squares, and show these are of maximal size when <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>s</mi>\n \n <mo>≤</mo>\n \n <mi>r</mi>\n \n <mo>+</mo>\n \n <mn>1</mn>\n </mrow>\n </mrow>\n </semantics></math>. These results specialize to the results of Xu, Haaland, and Qian when <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>r</mi>\n \n <mo>=</mo>\n \n <mi>s</mi>\n \n <mo>=</mo>\n \n <mn>1</mn>\n </mrow>\n </mrow>\n </semantics></math> and the equi-squares are Sudoku Latin squares of order <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <msup>\n <mi>q</mi>\n \n <mn>2</mn>\n </msup>\n </mrow>\n </mrow>\n </semantics></math>. Further, we show how a collection of mutually <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <msup>\n <mi>q</mi>\n \n <mi>s</mi>\n </msup>\n </mrow>\n </mrow>\n </semantics></math>-doubly orthogonal equi-<span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <msup>\n <mi>q</mi>\n \n <mrow>\n <mi>r</mi>\n \n <mo>+</mo>\n \n <mi>s</mi>\n </mrow>\n </msup>\n </mrow>\n </mrow>\n </semantics></math> squares can be used to construct sliced orthogonal arrays of strength two. These orthogonal arrays have important applications in statistical designs.</p>\n </div>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 7","pages":"275-283"},"PeriodicalIF":0.5000,"publicationDate":"2025-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Designs","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jcd.21982","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
We introduce doubly orthogonal equi-squares. Using linear algebra over finite fields, we produce large families of mutually -doubly orthogonal equi- squares, and show these are of maximal size when . These results specialize to the results of Xu, Haaland, and Qian when and the equi-squares are Sudoku Latin squares of order . Further, we show how a collection of mutually -doubly orthogonal equi- squares can be used to construct sliced orthogonal arrays of strength two. These orthogonal arrays have important applications in statistical designs.
期刊介绍:
The Journal of Combinatorial Designs is an international journal devoted to the timely publication of the most influential papers in the area of combinatorial design theory. All topics in design theory, and in which design theory has important applications, are covered, including:
block designs, t-designs, pairwise balanced designs and group divisible designs
Latin squares, quasigroups, and related algebras
computational methods in design theory
construction methods
applications in computer science, experimental design theory, and coding theory
graph decompositions, factorizations, and design-theoretic techniques in graph theory and extremal combinatorics
finite geometry and its relation with design theory.
algebraic aspects of design theory.
Researchers and scientists can depend on the Journal of Combinatorial Designs for the most recent developments in this rapidly growing field, and to provide a forum for both theoretical research and applications. All papers appearing in the Journal of Combinatorial Designs are carefully peer refereed.