2020/02/07 by Kharaghani, Hadi, Suda, Sho, Tayfeh-Rezaie, Behruz
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2002.02566
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.