从循环类的联合看伪帕利图中最大小群的子空间结构

IF 1.2 3区 数学 Q1 MATHEMATICS Finite Fields and Their Applications Pub Date : 2024-08-14 DOI:10.1016/j.ffa.2024.102492
Shamil Asgarli , Chi Hoi Yip
{"title":"从循环类的联合看伪帕利图中最大小群的子空间结构","authors":"Shamil Asgarli ,&nbsp;Chi Hoi Yip","doi":"10.1016/j.ffa.2024.102492","DOIUrl":null,"url":null,"abstract":"<div><p>Blokhuis showed that all maximum cliques in Paley graphs of square order have a subfield structure. Recently, it has been shown that in Peisert-type graphs, all maximum cliques are affine subspaces, and yet some maximum cliques do not arise from a subfield. In this paper, we investigate the existence of a clique of size <span><math><msqrt><mrow><mi>q</mi></mrow></msqrt></math></span> with a subspace structure in pseudo-Paley graphs of order <em>q</em> from unions of semi-primitive cyclotomic classes. We show that such a clique must have an equal contribution from each cyclotomic class and that most such pseudo-Paley graphs do not admit such cliques, suggesting that the Delsarte bound <span><math><msqrt><mrow><mi>q</mi></mrow></msqrt></math></span> on the clique number can be improved in general. We also prove that generalized Peisert graphs are not isomorphic to Paley graphs or Peisert graphs, confirming a conjecture of Mullin.</p></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"99 ","pages":"Article 102492"},"PeriodicalIF":1.2000,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The subspace structure of maximum cliques in pseudo-Paley graphs from unions of cyclotomic classes\",\"authors\":\"Shamil Asgarli ,&nbsp;Chi Hoi Yip\",\"doi\":\"10.1016/j.ffa.2024.102492\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Blokhuis showed that all maximum cliques in Paley graphs of square order have a subfield structure. Recently, it has been shown that in Peisert-type graphs, all maximum cliques are affine subspaces, and yet some maximum cliques do not arise from a subfield. In this paper, we investigate the existence of a clique of size <span><math><msqrt><mrow><mi>q</mi></mrow></msqrt></math></span> with a subspace structure in pseudo-Paley graphs of order <em>q</em> from unions of semi-primitive cyclotomic classes. We show that such a clique must have an equal contribution from each cyclotomic class and that most such pseudo-Paley graphs do not admit such cliques, suggesting that the Delsarte bound <span><math><msqrt><mrow><mi>q</mi></mrow></msqrt></math></span> on the clique number can be improved in general. We also prove that generalized Peisert graphs are not isomorphic to Paley graphs or Peisert graphs, confirming a conjecture of Mullin.</p></div>\",\"PeriodicalId\":50446,\"journal\":{\"name\":\"Finite Fields and Their Applications\",\"volume\":\"99 \",\"pages\":\"Article 102492\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2024-08-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Finite Fields and Their Applications\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S107157972400131X\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Finite Fields and Their Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S107157972400131X","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

布洛奎斯(Blokhuis)证明了平方阶佩利图中的所有最大簇都具有子域结构。最近的研究表明,在 Peisert 型图中,所有最大簇都是仿射子空间,但有些最大簇并不是由子场产生的。在本文中,我们研究了在阶数为 q 的伪佩利图中是否存在一个具有子空间结构的大小为 q 的簇,该簇来自半原初循环类的联合。我们证明了这样一个小群必须有来自每个环类的相等贡献,而大多数这样的伪帕利图不允许这样的小群存在,这表明小群数的德尔萨特约束 q 在一般情况下是可以改进的。我们还证明了广义 Peisert 图与 Paley 图或 Peisert 图不是同构的,从而证实了 Mullin 的猜想。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The subspace structure of maximum cliques in pseudo-Paley graphs from unions of cyclotomic classes

Blokhuis showed that all maximum cliques in Paley graphs of square order have a subfield structure. Recently, it has been shown that in Peisert-type graphs, all maximum cliques are affine subspaces, and yet some maximum cliques do not arise from a subfield. In this paper, we investigate the existence of a clique of size q with a subspace structure in pseudo-Paley graphs of order q from unions of semi-primitive cyclotomic classes. We show that such a clique must have an equal contribution from each cyclotomic class and that most such pseudo-Paley graphs do not admit such cliques, suggesting that the Delsarte bound q on the clique number can be improved in general. We also prove that generalized Peisert graphs are not isomorphic to Paley graphs or Peisert graphs, confirming a conjecture of Mullin.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.00
自引率
20.00%
发文量
133
审稿时长
6-12 weeks
期刊介绍: Finite Fields and Their Applications is a peer-reviewed technical journal publishing papers in finite field theory as well as in applications of finite fields. As a result of applications in a wide variety of areas, finite fields are increasingly important in several areas of mathematics, including linear and abstract algebra, number theory and algebraic geometry, as well as in computer science, statistics, information theory, and engineering. For cohesion, and because so many applications rely on various theoretical properties of finite fields, it is essential that there be a core of high-quality papers on theoretical aspects. In addition, since much of the vitality of the area comes from computational problems, the journal publishes papers on computational aspects of finite fields as well as on algorithms and complexity of finite field-related methods. The journal also publishes papers in various applications including, but not limited to, algebraic coding theory, cryptology, combinatorial design theory, pseudorandom number generation, and linear recurring sequences. There are other areas of application to be included, but the important point is that finite fields play a nontrivial role in the theory, application, or algorithm.
期刊最新文献
Complete description of measures corresponding to Abelian varieties over finite fields Repeated-root constacyclic codes of length kslmpn over finite fields Intersecting families of polynomials over finite fields Partial difference sets with Denniston parameters in elementary abelian p-groups Self-dual 2-quasi negacyclic codes over finite fields
×
引用
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