English

On pseudofrobenius imprimitive association schemes

Combinatorics 2021-12-14 v2

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 GG with abelian kernel to be determined up to isomorphism only by the character table of GG. Finally, we prove that the Weisfeiler-Leman dimension of a circulant graph with nn vertices and Frobenius automorphism group is equal to 22 unless n{p,p2,p3,pq,p2q}n\in \{p,p^2,p^3,pq,p^2q\}, where pp and qq are distinct primes.

Keywords

Cite

@article{arxiv.2111.01852,
  title  = {On pseudofrobenius imprimitive association schemes},
  author = {Ilia Ponomarenko and Grigory Ryabov},
  journal= {arXiv preprint arXiv:2111.01852},
  year   = {2021}
}

Comments

16 pages

R2 v1 2026-06-24T07:23:21.273Z