English

Applications of the Isolating Fusion Algorithm to Table Algebras and Association Schemes

Combinatorics 2023-06-16 v2

Abstract

Let B\mathbf{B} be a basis for an rr-dimensional algebra AA over a field or commutative ring with unity. The semifusions of B\mathbf{B} are the partitions of B\mathbf{B} whose characteristic functions form the basis of a subalgebra of AA, and fusions are semifusions that respect a given involution on AA. In this paper, we give an algorithm for computing a minimal semifusion (or fusion) of B\mathbf{B} that isolates a prescribed list of disjoint sums of basis elements of B\mathbf{B}, when such a semifusion (or fusion) exists. We apply this algorithm to three problems: (1) computing the fusion lattices for small association schemes of a given order; (2) producing explicit realizations of association schemes with transitive automorphism groups; and (3) producing examples of non-Schurian fusions of Schurian association schemes whose adjacency matrices have noncyclotomic eigenvalues. The latter is of interest to the open question asking whether association schemes with transitive automorphsm groups can have noncyclotomic character values.

Keywords

Cite

@article{arxiv.2205.01810,
  title  = {Applications of the Isolating Fusion Algorithm to Table Algebras and Association Schemes},
  author = {Allen Herman and Roghayeh Maleki},
  journal= {arXiv preprint arXiv:2205.01810},
  year   = {2023}
}