On Pseudocyclic Association Schemes
M.E. Muzychuk, I.N. Ponomarenko

TL;DR
This paper generalizes pseudocyclic association schemes to non-commutative cases, showing that schemes with high rank relative to valency are Frobenius schemes and are uniquely determined by their intersection numbers, with implications for schemes of prime degree.
Contribution
It extends the theory of pseudocyclic schemes to non-commutative cases and characterizes high-rank schemes as Frobenius schemes, establishing their uniqueness by intersection numbers.
Findings
High-rank pseudocyclic schemes are Frobenius schemes.
Such schemes are uniquely determined by their intersection number array.
Schemes of prime degree with large enough rank are schurian.
Abstract
The notion of pseudocyclic association scheme is generalized to the non-commutative case. It is proved that any pseudocyclic scheme the rank of which is much more than the valency is the scheme of a Frobenius group and is uniquely determined up to isomorphism by its intersection number array. An immediate corollary of this result is that any scheme of prime degree, valency and rank at least is schurian.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
