On the separability of cyclotomic schemes over finite fields
From MaRDI portal
Publication:5014091
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 2007658 (Why is no real title available?)
- An optimal lower bound on the number of variables for graph identification
- Coherent configurations associated with TI-subgroups
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm
- On pseudocyclic association schemes
- Separability number and Schurity number of coherent configurations
- Two-valenced association schemes and the Desargues theorem
This page was built for publication: On the separability of cyclotomic schemes over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014091)
