{"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>\\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}
引用次数: 0
Abstract
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.
秩为 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 足够大。证明基于库珀伯格、洛维特和佩莱德的概率方法,因此是非结构性的。
期刊介绍:
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.