On the separability of cyclotomic schemes over finite fields

DOI10.1090/spmj/1684zbMath1479.05370arXiv2006.13592OpenAlexW3213503246MaRDI QIDQ5014091

Ilya Nikolaevich Ponomarenko

Publication date: 1 December 2021

Published in: St. Petersburg Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.13592

zbMATH Keywords

association schemePaley graphcoherent configurationWeisfeiler-Lemon dimension

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Finite fields and commutative rings (number-theoretic aspects) (11T99) Directed graphs (digraphs), tournaments (05C20)

Uses Software

• GitHub
• COCO2P

Cites Work

• Unnamed Item
• An optimal lower bound on the number of variables for graph identification
• Separability number and Schurity number of coherent configurations
• Two-valenced association schemes and the Desargues theorem
• Coherent configurations associated with TI-subgroups
• On pseudocyclic association schemes
• Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
• Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm

This page was built for publication: On the separability of cyclotomic schemes over finite fields