On the separability of cyclotomic schemes over finite field

2020/06/24 by Ilia Ponomarenko, Ponomarenko, Ilia · 1 citation
Computer Science · Mathematics · #05E30 #Coding theory and cryptography #Combinatorics (math.CO) #Cooperative Communication and Network Coding #FOS: Mathematics #Finite Group Theory Research

paper · pdf · doi:10.48550/arxiv.2006.13592

openalex publication_date 2020/06/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Identifiability of Graphs with Small Color Classes by the\n Weisfeiler-Leman Algorithm

Cited by

• The automorphism groups and identification of some Generalized Paley Graphs

Related

• Almost Difference Sets, Normally Regular Digraphs and Cyclotomic Schemes from Cyclotomy of Order Twelve
• Cyclotomy, difference sets, sequences with low correlation, strongly regular graphs, and related geometric substructures
• Explicit Representatives and Sizes of Cyclotomic Cosets and their Application to Cyclic Codes over Finite Fields
• Cycle reversions and dichromatic number in tournaments
• The Multiple Equal-Difference Structure of Cyclotomic Cosets