{"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}
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 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.