有限域上切环格式的可分性

arXiv: Combinatorics Pub Date : 2020-06-01 DOI:10.1090/SPMJ/1684

Ilia N. Ponomarenko

{"title":"有限域上切环格式的可分性","authors":"Ilia N. Ponomarenko","doi":"10.1090/SPMJ/1684","DOIUrl":null,"url":null,"abstract":"It is proved that with finitely many possible exceptions, each cyclotomic scheme over finite field is determined up to isomorphism by the tensor of 2-dimensional intersection numbers; for infinitely many schemes, this result cannot be improved. As a consequence, the Weisfeiler-Leman dimension of a Paley graph or tournament is at most 3 with possible exception of several small graphs.","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":"37 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"On the separability of cyclotomic schemes over finite field\",\"authors\":\"Ilia N. Ponomarenko\",\"doi\":\"10.1090/SPMJ/1684\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is proved that with finitely many possible exceptions, each cyclotomic scheme over finite field is determined up to isomorphism by the tensor of 2-dimensional intersection numbers; for infinitely many schemes, this result cannot be improved. As a consequence, the Weisfeiler-Leman dimension of a Paley graph or tournament is at most 3 with possible exception of several small graphs.\",\"PeriodicalId\":8442,\"journal\":{\"name\":\"arXiv: Combinatorics\",\"volume\":\"37 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv: Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/SPMJ/1684\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/SPMJ/1684","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

证明了在有限多个可能的例外情况下，有限域上的每一个环切方案都是由二维交数张量确定为同构的;对于无穷多方案，这个结果不能改进。因此，除了几个小图之外，Paley图或锦标赛的Weisfeiler-Leman维数最多为3。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the separability of cyclotomic schemes over finite field

It is proved that with finitely many possible exceptions, each cyclotomic scheme over finite field is determined up to isomorphism by the tensor of 2-dimensional intersection numbers; for infinitely many schemes, this result cannot be improved. As a consequence, the Weisfeiler-Leman dimension of a Paley graph or tournament is at most 3 with possible exception of several small graphs.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv: Combinatorics

自引率

0.00%

发文量