A characterization of Q-polynomial association schemes
Hirotake Kurihara, Hiroshi Nozaki
TL;DR
This paper establishes a precise criterion to determine when a symmetric association scheme qualifies as a Q-polynomial scheme, advancing the theoretical understanding of algebraic combinatorics.
Contribution
It provides a necessary and sufficient condition for symmetric association schemes to be classified as Q-polynomial schemes, clarifying their structural properties.
Findings
Derived a complete characterization criterion for Q-polynomial schemes
Unified conditions for symmetric association schemes to be Q-polynomial
Enhanced theoretical framework for algebraic combinatorics
Abstract
We prove a necessary and sufficient condition for a symmetric association scheme to be a Q-polynomial scheme.
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 · Algebraic Geometry and Number Theory · Coding theory and cryptography