对于所有 t

IF 1.4 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Charlene Weiß
{"title":"对于所有 t","authors":"Charlene Weiß","doi":"10.1007/s10623-024-01471-1","DOIUrl":null,"url":null,"abstract":"<p>A finite classical polar space of rank <i>n</i> consists of the totally isotropic subspaces of a finite vector space over <span>\\(\\mathbb {F}_q\\)</span> equipped with a nondegenerate form such that <i>n</i> is the maximal dimension of such a subspace. A <i>t</i>-<span>\\((n,k,\\lambda )\\)</span> design in a finite classical polar space of rank <i>n</i> is a collection <i>Y</i> of totally isotropic <i>k</i>-spaces such that each totally isotropic <i>t</i>-space is contained in exactly <span>\\(\\lambda \\)</span> members of <i>Y</i>. Nontrivial examples are currently only known for <span>\\(t\\le 2\\)</span>. We show that <i>t</i>-<span>\\((n,k,\\lambda )\\)</span> designs in polar spaces exist for all <i>t</i> and <i>q</i> provided that <span>\\(k&gt;\\frac{21}{2}t\\)</span> and <i>n</i> is sufficiently large enough. The proof is based on a probabilistic method by Kuperberg, Lovett, and Peled, and it is thus nonconstructive.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"152 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Nontrivial t-designs in polar spaces exist for all t\",\"authors\":\"Charlene Weiß\",\"doi\":\"10.1007/s10623-024-01471-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>A finite classical polar space of rank <i>n</i> consists of the totally isotropic subspaces of a finite vector space over <span>\\\\(\\\\mathbb {F}_q\\\\)</span> equipped with a nondegenerate form such that <i>n</i> is the maximal dimension of such a subspace. A <i>t</i>-<span>\\\\((n,k,\\\\lambda )\\\\)</span> design in a finite classical polar space of rank <i>n</i> is a collection <i>Y</i> of totally isotropic <i>k</i>-spaces such that each totally isotropic <i>t</i>-space is contained in exactly <span>\\\\(\\\\lambda \\\\)</span> members of <i>Y</i>. Nontrivial examples are currently only known for <span>\\\\(t\\\\le 2\\\\)</span>. We show that <i>t</i>-<span>\\\\((n,k,\\\\lambda )\\\\)</span> designs in polar spaces exist for all <i>t</i> and <i>q</i> provided that <span>\\\\(k&gt;\\\\frac{21}{2}t\\\\)</span> and <i>n</i> is sufficiently large enough. The proof is based on a probabilistic method by Kuperberg, Lovett, and Peled, and it is thus nonconstructive.</p>\",\"PeriodicalId\":11130,\"journal\":{\"name\":\"Designs, Codes and Cryptography\",\"volume\":\"152 1\",\"pages\":\"\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2024-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Designs, Codes and Cryptography\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10623-024-01471-1\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-024-01471-1","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

秩为 n 的有限经典极空间由 \(\mathbb {F}_q\) 上的有限向量空间的完全各向同性子空间组成,该子空间具有非enerate 形式,且 n 是该子空间的最大维数。秩为 n 的有限经典极空间中的 t-\((n,k,\lambda )\) 设计是完全各向同性 k 空间的集合 Y,使得每个完全各向同性的 t 空间都包含在 Y 的精确 \(\lambda \) 成员中。我们证明了极空间中的 t- ((n,k,\lambda))设计对于所有的 t 和 q 都是存在的,条件是 \(k>\frac{21}{2}t\) 和 n 足够大。证明基于库珀伯格、洛维特和佩莱德的概率方法,因此是非结构性的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Nontrivial t-designs in polar spaces exist for all t

A finite classical polar space of rank n consists of the totally isotropic subspaces of a finite vector space over \(\mathbb {F}_q\) equipped with a nondegenerate form such that n is the maximal dimension of such a subspace. A t-\((n,k,\lambda )\) design in a finite classical polar space of rank n is a collection Y of totally isotropic k-spaces such that each totally isotropic t-space is contained in exactly \(\lambda \) members of Y. Nontrivial examples are currently only known for \(t\le 2\). We show that t-\((n,k,\lambda )\) designs in polar spaces exist for all t and q provided that \(k>\frac{21}{2}t\) and n is sufficiently large enough. The proof is based on a probabilistic method by Kuperberg, Lovett, and Peled, and it is thus nonconstructive.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Designs, Codes and Cryptography
Designs, Codes and Cryptography 工程技术-计算机:理论方法
CiteScore
2.80
自引率
12.50%
发文量
157
审稿时长
16.5 months
期刊介绍: Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines. The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome. The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas. Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.
×
引用
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学术官方微信