{"title":"非对称嵌套正交数组的界","authors":"Xiao Lin, Shanqi Pang, Guangzhou Chen","doi":"10.1016/j.disc.2025.114549","DOIUrl":null,"url":null,"abstract":"<div><div>Nested orthogonal arrays (NOAs) are more and more widely used in diverse experiments. An important problem in the study of NOAs is to determine the minimal number of runs, i.e., to find the bounds on the rows for NOAs. These bounds are quite powerful in proving nonexistence. Although the bounds for symmetric NOAs were derived over a decade, the bounds for asymmetric NOAs remain an open problem. This article presents the bounds for asymmetric NOAs.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 9","pages":"Article 114549"},"PeriodicalIF":0.7000,"publicationDate":"2025-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bounds for asymmetric nested orthogonal arrays\",\"authors\":\"Xiao Lin, Shanqi Pang, Guangzhou Chen\",\"doi\":\"10.1016/j.disc.2025.114549\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Nested orthogonal arrays (NOAs) are more and more widely used in diverse experiments. An important problem in the study of NOAs is to determine the minimal number of runs, i.e., to find the bounds on the rows for NOAs. These bounds are quite powerful in proving nonexistence. Although the bounds for symmetric NOAs were derived over a decade, the bounds for asymmetric NOAs remain an open problem. This article presents the bounds for asymmetric NOAs.</div></div>\",\"PeriodicalId\":50572,\"journal\":{\"name\":\"Discrete Mathematics\",\"volume\":\"348 9\",\"pages\":\"Article 114549\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2025-04-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0012365X25001578\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X25001578","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
Nested orthogonal arrays (NOAs) are more and more widely used in diverse experiments. An important problem in the study of NOAs is to determine the minimal number of runs, i.e., to find the bounds on the rows for NOAs. These bounds are quite powerful in proving nonexistence. Although the bounds for symmetric NOAs were derived over a decade, the bounds for asymmetric NOAs remain an open problem. This article presents the bounds for asymmetric NOAs.
期刊介绍:
Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory.
Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.