English

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

Combinatorics 2022-08-08 v3 Commutative Algebra Representation Theory

Abstract

In this paper we show that for any fusion B\mathcal{B} of an association scheme A\mathcal{A}, the generalized Hamming scheme H(n,B)H(n,\mathcal{B}) is a nontrivial fusion of H(n,A)H(n,\mathcal{A}). We analyze the case where A\mathcal{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)H(2,\mathcal{A}), has extra fusions, in addition to the one arising from the trivial fusion of A\mathcal{A}.

Cite

@article{arxiv.2202.01150,
  title  = {Fusions of the generalized Hamming scheme on a strongly-regular graph},
  author = {Allen Herman and Neha Joshi and Karen Meagher},
  journal= {arXiv preprint arXiv:2202.01150},
  year   = {2022}
}
R2 v1 2026-06-24T09:16:10.907Z