Blocking sets of secant and tangent lines with respect to a quadric of $$\text{ PG }(n,q)$$

IF 1.4 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Designs, Codes and Cryptography Pub Date : 2025-01-17 DOI:10.1007/s10623-024-01559-8
Bart De Bruyn, Puspendu Pradhan, Binod Kumar Sahoo
{"title":"Blocking sets of secant and tangent lines with respect to a quadric of $$\\text{ PG }(n,q)$$","authors":"Bart De Bruyn, Puspendu Pradhan, Binod Kumar Sahoo","doi":"10.1007/s10623-024-01559-8","DOIUrl":null,"url":null,"abstract":"<p>For a set <span>\\({\\mathcal {L}}\\)</span> of lines of <span>\\(\\text{ PG }(n,q)\\)</span>, a set <i>X</i> of points of <span>\\(\\text{ PG }(n,q)\\)</span> is called an <span>\\({\\mathcal {L}}\\)</span>-blocking set if each line of <span>\\({\\mathcal {L}}\\)</span> contains at least one point of <i>X</i>. Consider a possibly singular quadric <i>Q</i> of <span>\\(\\text{ PG }(n,q)\\)</span> and denote by <span>\\({\\mathcal {S}}\\)</span> (respectively, <span>\\({\\mathcal {T}}\\)</span>) the set of all lines of <span>\\(\\text{ PG }(n,q)\\)</span> meeting <i>Q</i> in 2 (respectively, 1 or <span>\\(q+1\\)</span>) points. For <span>\\({\\mathcal {L}}\\in \\{{\\mathcal {S}},{\\mathcal {T}}\\cup {\\mathcal {S}}\\}\\)</span>, we find the minimal cardinality of an <span>\\({\\mathcal {L}}\\)</span>-blocking set of <span>\\(\\text{ PG }(n,q)\\)</span> and determine all <span>\\({\\mathcal {L}}\\)</span>-blocking sets of that minimal cardinality.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"43 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2025-01-17","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-01559-8","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

For a set \({\mathcal {L}}\) of lines of \(\text{ PG }(n,q)\), a set X of points of \(\text{ PG }(n,q)\) is called an \({\mathcal {L}}\)-blocking set if each line of \({\mathcal {L}}\) contains at least one point of X. Consider a possibly singular quadric Q of \(\text{ PG }(n,q)\) and denote by \({\mathcal {S}}\) (respectively, \({\mathcal {T}}\)) the set of all lines of \(\text{ PG }(n,q)\) meeting Q in 2 (respectively, 1 or \(q+1\)) points. For \({\mathcal {L}}\in \{{\mathcal {S}},{\mathcal {T}}\cup {\mathcal {S}}\}\), we find the minimal cardinality of an \({\mathcal {L}}\)-blocking set of \(\text{ PG }(n,q)\) and determine all \({\mathcal {L}}\)-blocking sets of that minimal cardinality.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于二次函数的正割线和切线的块集 $$\text{ PG }(n,q)$$
对于\({\mathcal {L}}\)的\(\text{ PG }(n,q)\)的线集合,如果\({\mathcal {L}}\)的每条线包含至少一个点X,则\(\text{ PG }(n,q)\)的点集合X称为\({\mathcal {L}}\) -blocking set,考虑\(\text{ PG }(n,q)\)的一个可能的奇异二次型Q,用\({\mathcal {S}}\)(分别为\({\mathcal {T}}\))表示\(\text{ PG }(n,q)\)的所有线的集合在2个(分别为1个或\(q+1\))点中与Q相遇。对于\({\mathcal {L}}\in \{{\mathcal {S}},{\mathcal {T}}\cup {\mathcal {S}}\}\),我们找到\(\text{ PG }(n,q)\)的\({\mathcal {L}}\)阻塞集的最小基数,并确定该最小基数的所有\({\mathcal {L}}\)阻塞集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
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.
期刊最新文献
The revised boomerang connectivity tables and their connection to the difference distribution table Improved Side Channel Attacks on TRIVIUM, GRAIN-128-AEAD, ACORN-128 v3 and ASCON-128a Efficient generation of odd order de Bruijn sequence with the same complement and reverse sequences Linear complementary pairs of skew constacyclic codes On vectorial functions with maximal number of bent components
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1