On the isomorphism of certain primitive $Q$-polynomial not $P$-polynomial association schemes
Giusy Monzillo, Alessandro Siciliano

TL;DR
This paper proves that certain primitive Q-polynomial association schemes, previously thought to be distinct, are actually isomorphic, linking geometric constructions with algebraic group actions and establishing isomorphisms of related strongly regular graphs.
Contribution
It demonstrates the isomorphism between two previously separate constructions of primitive Q-polynomial association schemes, unifying geometric and algebraic approaches.
Findings
The schemes constructed by Penttila and Williford are isomorphic to those by Hollmann and Xiang.
An isomorphism of the associated strongly regular graphs is established.
The result confirms the equivalence of different construction methods for these schemes.
Abstract
In 2011, Penttila and Williford constructed an infinite new family of primitive -polynomial 3-class association schemes, not arising from distance regular graphs, by exploring the geometry of the lines of the unitary polar space , even, with respect to a symplectic polar space embedded in it. In a private communication to Penttila and Williford, H.~Tanaka pointed out that these schemes have the same parameters as the 3-class schemes found by Hollmann and Xiang in 2006 by considering the action of , even, on a non-degenerate conic of extended in . Therefore, the question arises whether the above association schemes are isomorphic. In this paper we provide the positive answer. As by product, we get an isomorphism of strongly regular graphs.
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.
