On the separability of cyclotomic schemes over finite fields
From MaRDI portal
Publication:5014091
DOI10.1090/SPMJ/1684zbMATH Open1479.05370arXiv2006.13592OpenAlexW3213503246MaRDI QIDQ5014091FDOQ5014091
Authors: Ilya Ponomarenko 
Publication date: 1 December 2021
Published in: St. Petersburg Mathematical Journal (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2006.13592
Recommendations
Directed graphs (digraphs), tournaments (05C20) Association schemes, strongly regular graphs (05E30) Finite fields and commutative rings (number-theoretic aspects) (11T99)
Cites Work
- An optimal lower bound on the number of variables for graph identification
- On pseudocyclic association schemes
- Title not available (Why is that?)
- Separability number and Schurity number of coherent configurations
- Two-valenced association schemes and the Desargues theorem
- 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
Cited In (1)
Uses Software
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)
