Fusions of the generalized Hamming scheme on a strongly-regular graph

Abstract

In this paper we show that for any fusion B of an association scheme A, the generalized Hamming scheme H(n,B) is a nontrivial fusion of H(n,A). We analyze the case where A is the association scheme on a strongly-regular graph, and determine the parameters of all strongly-regular graphs for which the generalized Hamming scheme, H(2,A), has extra fusions, in addition to the one arising from the trivial fusion of A.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…