Classification of partially metric Q-polynomial association schemes with $m_1 = 4$
Da Zhao

TL;DR
This paper classifies a specific type of algebraic combinatorial structures called partially metric Q-polynomial association schemes with a particular parameter value, enhancing understanding of their structure and properties.
Contribution
It provides a complete classification of partially metric Q-polynomial association schemes with m_1=4, a previously unexplored parameter setting.
Findings
Classification of schemes with m_1=4 completed
Characterization of the relation between scheme graphs and distance graphs
Extension of known theory to new parameter regime
Abstract
We classify the Q-polynomial association schemes with which are partially metric with respect to the nearest neighbourhood relation. An association scheme is partially metric with respect to a relation if the scheme graph of is exactly the distance-2 graph of the scheme graph of under a certain ordering of the relations.
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
