由交易或设计的排列组合产生的向量空间

Pub Date : 2024-11-06 DOI:10.1016/j.jcta.2024.105969
E. Ghorbani , S. Kamali , G.B. Khosrovshahi
{"title":"由交易或设计的排列组合产生的向量空间","authors":"E. Ghorbani ,&nbsp;S. Kamali ,&nbsp;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":"{\"title\":\"The vector space generated by permutations of a trade or a design\",\"authors\":\"E. Ghorbani ,&nbsp;S. Kamali ,&nbsp;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}","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

摘要

受 Graver 和 Jurkat(1973 年)以及 Graham、Li 和 Li(1980 年)在组合设计理论中的一个经典结果(即 t-(v,k)最小交易的排列组合产生所有 t-(v,k)交易的向量空间)的启发,我们研究了任意交易的排列组合所跨越的向量空间。我们证明,这个向量空间可以分解为由特定的所谓总交易系列以相同方式形成的子空间的直接和。换句话说,任何 t-(v,k,λ)设计,甚至任何 t 交易,都可以表示为固定 t 设计的排列组合的线性组合。这大大扩展了 Ghodrati(2019)的一个结果,他为斯坦纳设计证明了同样的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
分享
查看原文
The vector space generated by permutations of a trade or a design
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-(v,k) minimal trades generate the vector space of all t-(v,k) 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-(v,k,λ) design, its permutations can span the vector space generated by all t-(v,k,λ) designs for sufficiently large values of v. In other words, any t-(v,k,λ) 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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信