Disjoint weighing matrices
Combinatorics
2020-09-07 v2
Abstract
The notion of disjoint weighing matrices is introduced as a generalization of orthogonal designs. A recursive construction along with a computer search lead to some infinite classes of disjoint weighing matrices, which in turn are shown to form commutative association schemes with 3 or 4 classes.
Cite
@article{arxiv.2002.02566,
title = {Disjoint weighing matrices},
author = {Hadi Kharaghani and Sho Suda and Behruz Tayfeh-Rezaie},
journal= {arXiv preprint arXiv:2002.02566},
year = {2020}
}
Comments
11 pages