{"title":"高强度正交阵列示意图","authors":"Rong Yan, Shanqi Pang, Jing Wang, Mengqian Chen","doi":"10.1016/j.jspi.2024.106230","DOIUrl":null,"url":null,"abstract":"<div><p>Schematic orthogonal arrays are closely related to association schemes. And which orthogonal arrays are schematic orthogonal arrays and how to classify them is an open problem proposed by Hedayat et al. (1999). By using the Hamming distances, this paper presents some general methods for constructing schematic symmetric and mixed orthogonal arrays of high strength. As applications of these methods, we construct association schemes and many new schematic orthogonal arrays including several infinite classes of such arrays. Some examples are provided to illustrate the construction methods. The paper gives the partial solution of the problem by Hedayat et al. (1999) for symmetric and mixed orthogonal arrays of high strength.</p></div>","PeriodicalId":50039,"journal":{"name":"Journal of Statistical Planning and Inference","volume":"236 ","pages":"Article 106230"},"PeriodicalIF":0.8000,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On schematic orthogonal arrays of high strength\",\"authors\":\"Rong Yan, Shanqi Pang, Jing Wang, Mengqian Chen\",\"doi\":\"10.1016/j.jspi.2024.106230\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Schematic orthogonal arrays are closely related to association schemes. And which orthogonal arrays are schematic orthogonal arrays and how to classify them is an open problem proposed by Hedayat et al. (1999). By using the Hamming distances, this paper presents some general methods for constructing schematic symmetric and mixed orthogonal arrays of high strength. As applications of these methods, we construct association schemes and many new schematic orthogonal arrays including several infinite classes of such arrays. Some examples are provided to illustrate the construction methods. The paper gives the partial solution of the problem by Hedayat et al. (1999) for symmetric and mixed orthogonal arrays of high strength.</p></div>\",\"PeriodicalId\":50039,\"journal\":{\"name\":\"Journal of Statistical Planning and Inference\",\"volume\":\"236 \",\"pages\":\"Article 106230\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2024-09-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Statistical Planning and Inference\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0378375824000879\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"STATISTICS & PROBABILITY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Statistical Planning and Inference","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0378375824000879","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
Schematic orthogonal arrays are closely related to association schemes. And which orthogonal arrays are schematic orthogonal arrays and how to classify them is an open problem proposed by Hedayat et al. (1999). By using the Hamming distances, this paper presents some general methods for constructing schematic symmetric and mixed orthogonal arrays of high strength. As applications of these methods, we construct association schemes and many new schematic orthogonal arrays including several infinite classes of such arrays. Some examples are provided to illustrate the construction methods. The paper gives the partial solution of the problem by Hedayat et al. (1999) for symmetric and mixed orthogonal arrays of high strength.
期刊介绍:
The Journal of Statistical Planning and Inference offers itself as a multifaceted and all-inclusive bridge between classical aspects of statistics and probability, and the emerging interdisciplinary aspects that have a potential of revolutionizing the subject. While we maintain our traditional strength in statistical inference, design, classical probability, and large sample methods, we also have a far more inclusive and broadened scope to keep up with the new problems that confront us as statisticians, mathematicians, and scientists.
We publish high quality articles in all branches of statistics, probability, discrete mathematics, machine learning, and bioinformatics. We also especially welcome well written and up to date review articles on fundamental themes of statistics, probability, machine learning, and general biostatistics. Thoughtful letters to the editors, interesting problems in need of a solution, and short notes carrying an element of elegance or beauty are equally welcome.