{"title":"The vector space generated by permutations of a trade or a design","authors":"E. Ghorbani , S. Kamali , G.B. Khosrovshahi","doi":"10.1016/j.jcta.2024.105969","DOIUrl":null,"url":null,"abstract":"<div><div>Motivated by a classical result of Graver and Jurkat (1973) and Graham, Li, and Li (1980) in combinatorial design theory, which states that the permutations of <em>t</em>-<span><math><mo>(</mo><mi>v</mi><mo>,</mo><mi>k</mi><mo>)</mo></math></span> minimal trades generate the vector space of all <em>t</em>-<span><math><mo>(</mo><mi>v</mi><mo>,</mo><mi>k</mi><mo>)</mo></math></span> trades, we investigate the vector space spanned by permutations of an arbitrary trade. We prove that this vector space possesses a decomposition as a direct sum of subspaces formed in the same way by a specific family of so-called total trades. As an application, we demonstrate that for any <em>t</em>-<span><math><mo>(</mo><mi>v</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>λ</mi><mo>)</mo></math></span> design, its permutations can span the vector space generated by all <em>t</em>-<span><math><mo>(</mo><mi>v</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>λ</mi><mo>)</mo></math></span> designs for sufficiently large values of <em>v</em>. In other words, any <em>t</em>-<span><math><mo>(</mo><mi>v</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>λ</mi><mo>)</mo></math></span> design, or even any <em>t</em>-trade, can be expressed as a linear combination of permutations of a fixed <em>t</em>-design. This substantially extends a result by Ghodrati (2019), who proved the same result for Steiner designs.</div></div>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0097316524001080","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Motivated by a classical result of Graver and Jurkat (1973) and Graham, Li, and Li (1980) in combinatorial design theory, which states that the permutations of t- minimal trades generate the vector space of all t- trades, we investigate the vector space spanned by permutations of an arbitrary trade. We prove that this vector space possesses a decomposition as a direct sum of subspaces formed in the same way by a specific family of so-called total trades. As an application, we demonstrate that for any t- design, its permutations can span the vector space generated by all t- designs for sufficiently large values of v. In other words, any t- design, or even any t-trade, can be expressed as a linear combination of permutations of a fixed t-design. This substantially extends a result by Ghodrati (2019), who proved the same result for Steiner designs.