2000 character limit reached
Non-commutative association schemes and their fusion association schemes
Published 20 Jun 2017 in math.CO | (1706.06281v2)
Abstract: We give a sufficient condition for a non-commutative association scheme to have a fusion association scheme, and construct non-commutative association schemes from symmetric balanced generalized weighing matrices and generalized Hadamard matrices. We then apply the criterion to these non-commutative association schemes to obtain symmetric fusion association schemes.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.