On pseudofrobenius imprimitive association schemes

DOI10.1007/S10801-022-01193-4MaRDI QIDQ6382007arXivFDO

Authors Ilya Ponomarenko, Grigoriĭ Konstantinovich Ryabov

Publication date 2 November 2021

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Association schemes, strongly regular graphs (05E30) General theory for finite permutation groups (20B05) Ordinary representations and characters (20C15)

Abstract: An (association) scheme is said to be Frobenius if it is the scheme of a Frobenius group. A scheme which has the same tensor of intersection numbers as some Frobenius scheme is said to be pseudofrobenius. We establish a necessary and sufficient condition for an imprimitive pseudofrobenius scheme to be Frobenius. We also prove strong necessary conditions for existence of an imprimitive pseudofrobenius scheme which is not Frobenius. As a byproduct, we obtain a sufficient condition for an imprimitive Frobenius group $G$ with abelian kernel to be determined up to isomorphism only by the character table of $G$. Finally, we prove that the Weisfeiler-Leman dimension of a circulant graph with $n$ vertices and Frobenius automorphism group is equal to $2$ unless $ninp,p^2,p^3,pq,p^{2}q$, where $p$ and $q$ are distinct primes.

This page was built for publication: On pseudofrobenius imprimitive association schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6382007)