论点和块基元设计在置换群下的不变性

Amin Saeidi
{"title":"论点和块基元设计在置换群下的不变性","authors":"Amin Saeidi","doi":"arxiv-2409.09730","DOIUrl":null,"url":null,"abstract":"In this paper, we present a method for constructing point primitive block\ntransitive $t$-designs invariant under finite groups. Furthermore, we\ndemonstrate that every point and block primitive $G$-invariant design can be\ngenerated using this method. Additionally, we establish the theoretical possibility of identifying all\nblock transitive $G$-invariant designs. However, in practice, the feasibility\nof enumerating all designs for larger groups may be limited by the\ncomputational complexity involved.","PeriodicalId":501407,"journal":{"name":"arXiv - MATH - Combinatorics","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On point and block primitive designs invariant under permutation groups\",\"authors\":\"Amin Saeidi\",\"doi\":\"arxiv-2409.09730\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a method for constructing point primitive block\\ntransitive $t$-designs invariant under finite groups. Furthermore, we\\ndemonstrate that every point and block primitive $G$-invariant design can be\\ngenerated using this method. Additionally, we establish the theoretical possibility of identifying all\\nblock transitive $G$-invariant designs. However, in practice, the feasibility\\nof enumerating all designs for larger groups may be limited by the\\ncomputational complexity involved.\",\"PeriodicalId\":501407,\"journal\":{\"name\":\"arXiv - MATH - Combinatorics\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.09730\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.09730","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们提出了一种构建有限群下不变的点基元块过渡 $t$ 设计的方法。此外,我们还证明了每一个点和块基元 $G$ 不变设计都可以用这种方法生成。此外,我们还从理论上确定了识别所有块反式$G$不变设计的可能性。然而,在实践中,枚举较大组的所有设计的可行性可能会受到所涉及的计算复杂性的限制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On point and block primitive designs invariant under permutation groups
In this paper, we present a method for constructing point primitive block transitive $t$-designs invariant under finite groups. Furthermore, we demonstrate that every point and block primitive $G$-invariant design can be generated using this method. Additionally, we establish the theoretical possibility of identifying all block transitive $G$-invariant designs. However, in practice, the feasibility of enumerating all designs for larger groups may be limited by the computational complexity involved.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信