论离散值域上超对称正交集的最大尺寸

IF 1.4 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Designs, Codes and Cryptography Pub Date : 2024-08-16 DOI:10.1007/s10623-024-01480-0
Noy Soffer Aranov, Angelot Behajaina
{"title":"论离散值域上超对称正交集的最大尺寸","authors":"Noy Soffer Aranov, Angelot Behajaina","doi":"10.1007/s10623-024-01480-0","DOIUrl":null,"url":null,"abstract":"<p>Let <span>\\({\\mathcal {K}}\\)</span> be a discrete valued field with finite residue field. In analogy with orthogonality in the Euclidean space <span>\\({\\mathbb {R}}^n\\)</span>, there is a well-studied notion of “ultrametric orthogonality” in <span>\\({\\mathcal {K}}^n\\)</span>. In this paper, motivated by a question of Erdős in the real case, given integers <span>\\(k \\ge \\ell \\ge 2\\)</span>, we investigate the maximum size of a subset <span>\\(S \\subseteq {\\mathcal {K}}^n {\\setminus }\\{\\textbf{0}\\}\\)</span> satisfying the following property: for any <span>\\(E \\subseteq S\\)</span> of size <i>k</i>, there exists <span>\\(F \\subseteq E\\)</span> of size <span>\\(\\ell \\)</span> such that any two distinct vectors in <i>F</i> are orthogonal. Other variants of this property are also studied.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"58 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the maximum size of ultrametric orthogonal sets over discrete valued fields\",\"authors\":\"Noy Soffer Aranov, Angelot Behajaina\",\"doi\":\"10.1007/s10623-024-01480-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Let <span>\\\\({\\\\mathcal {K}}\\\\)</span> be a discrete valued field with finite residue field. In analogy with orthogonality in the Euclidean space <span>\\\\({\\\\mathbb {R}}^n\\\\)</span>, there is a well-studied notion of “ultrametric orthogonality” in <span>\\\\({\\\\mathcal {K}}^n\\\\)</span>. In this paper, motivated by a question of Erdős in the real case, given integers <span>\\\\(k \\\\ge \\\\ell \\\\ge 2\\\\)</span>, we investigate the maximum size of a subset <span>\\\\(S \\\\subseteq {\\\\mathcal {K}}^n {\\\\setminus }\\\\{\\\\textbf{0}\\\\}\\\\)</span> satisfying the following property: for any <span>\\\\(E \\\\subseteq S\\\\)</span> of size <i>k</i>, there exists <span>\\\\(F \\\\subseteq E\\\\)</span> of size <span>\\\\(\\\\ell \\\\)</span> such that any two distinct vectors in <i>F</i> are orthogonal. Other variants of this property are also studied.</p>\",\"PeriodicalId\":11130,\"journal\":{\"name\":\"Designs, Codes and Cryptography\",\"volume\":\"58 1\",\"pages\":\"\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2024-08-16\",\"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-01480-0\",\"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-01480-0","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

让 \({\mathcal {K}}\) 是一个具有有限残差域的离散值域。与欧几里得空间 \({\mathbb {R}}^n\) 中的正交性类似,在 \({\mathcal {K}}^n\) 中存在一个研究得很透彻的 "超对称正交性 "概念。在本文中,受厄多(Erdős)在实数情况下提出的一个问题的启发,在给定整数 (k \ge \ell \ge 2\ )的情况下,我们研究了满足以下性质的子集 (S \subseteq {\mathcal {K}}^n {setminus }\{textbf{0}\} )的最大大小:对于任何大小为k的E子集,都存在大小为(ell)的F子集,这样F中任何两个不同的向量都是正交的。我们还研究了这一性质的其他变体。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On the maximum size of ultrametric orthogonal sets over discrete valued fields

Let \({\mathcal {K}}\) be a discrete valued field with finite residue field. In analogy with orthogonality in the Euclidean space \({\mathbb {R}}^n\), there is a well-studied notion of “ultrametric orthogonality” in \({\mathcal {K}}^n\). In this paper, motivated by a question of Erdős in the real case, given integers \(k \ge \ell \ge 2\), we investigate the maximum size of a subset \(S \subseteq {\mathcal {K}}^n {\setminus }\{\textbf{0}\}\) satisfying the following property: for any \(E \subseteq S\) of size k, there exists \(F \subseteq E\) of size \(\ell \) such that any two distinct vectors in F are orthogonal. Other variants of this property are also studied.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
期刊最新文献
Quantum rectangle attack and its application on Deoxys-BC Almost tight security in lattices with polynomial moduli—PRF, IBE, all-but-many LTF, and more Breaking the power-of-two barrier: noise estimation for BGV in NTT-friendly rings A new method of constructing $$(k+s)$$ -variable bent functions based on a family of s-plateaued functions on k variables Further investigation on differential properties of the generalized Ness–Helleseth function
×
引用
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