Association schemes and orthogonality graphs on anisotropic points of polar spaces

IF 1.4 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Designs, Codes and Cryptography Pub Date : 2024-10-24 DOI:10.1007/s10623-024-01514-7
Sam Adriaensen, Maarten De Boeck
{"title":"Association schemes and orthogonality graphs on anisotropic points of polar spaces","authors":"Sam Adriaensen, Maarten De Boeck","doi":"10.1007/s10623-024-01514-7","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we study association schemes on the anisotropic points of classical polar spaces. Our main result concerns non-degenerate elliptic and hyperbolic quadrics in <span>\\({{\\,\\textrm{PG}\\,}}(n,q)\\)</span> with <i>q</i> odd. We define relations on the anisotropic points of such a quadric that depend on the type of line spanned by the points and whether or not they are of the same “quadratic type”. This yields an imprimitive 5-class association scheme. We calculate the matrices of eigenvalues and dual eigenvalues of this scheme. We also use this result, together with similar results from the literature concerning other classical polar spaces, to exactly calculate the spectrum of orthogonality graphs on the anisotropic points of non-degenerate quadrics in odd characteristic and of non-degenerate Hermitian varieties. As a byproduct, we obtain a 3-class association scheme on the anisotropic points of non-degenerate Hermitian varieties, where the relation containing two points depends on the type of line spanned by these points, and whether or not they are orthogonal.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"48 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-10-24","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-01514-7","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

In this paper, we study association schemes on the anisotropic points of classical polar spaces. Our main result concerns non-degenerate elliptic and hyperbolic quadrics in \({{\,\textrm{PG}\,}}(n,q)\) with q odd. We define relations on the anisotropic points of such a quadric that depend on the type of line spanned by the points and whether or not they are of the same “quadratic type”. This yields an imprimitive 5-class association scheme. We calculate the matrices of eigenvalues and dual eigenvalues of this scheme. We also use this result, together with similar results from the literature concerning other classical polar spaces, to exactly calculate the spectrum of orthogonality graphs on the anisotropic points of non-degenerate quadrics in odd characteristic and of non-degenerate Hermitian varieties. As a byproduct, we obtain a 3-class association scheme on the anisotropic points of non-degenerate Hermitian varieties, where the relation containing two points depends on the type of line spanned by these points, and whether or not they are orthogonal.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
极空间各向异性点上的关联方案和正交图谱
本文研究经典极空间各向异性点上的关联方案。我们的主要结果涉及 q 为奇数的 \({{\,\textrm{PG}\,}}(n,q)\) 中的非退化椭圆和双曲二次元。我们定义了关于此类二次元各向异性点的关系,这些关系取决于点所跨直线的类型以及它们是否属于相同的 "二次元类型"。这就产生了一个隐含的 5 类关联方案。我们计算了该方案的特征值矩阵和对偶特征值矩阵。我们还利用这一结果以及其他经典极坐标空间的类似结果,精确地计算了奇特征非退化四元数和非退化赫米梯形的各向异性点上的正交图谱。作为副产品,我们得到了关于非退化赫米梯形各向异性点的三类关联方案,其中包含两点的关系取决于这些点所跨直线的类型,以及它们是否正交。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
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