Disjoint weighing matrices

DOI10.1007/S10801-020-00981-0zbMATH Open1490.05024arXiv2002.02566OpenAlexW3094323602MaRDI QIDQ2114772FDOQ2114772

Sho Suda, B. Tayfeh-Rezaie, H. Kharaghani

Publication date: 15 March 2022

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2002.02566

zbMATH Keywords

association schemecirculant matrixorthogonal designweighing matrixdisjoint skew weighing matrices

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of finite geometries (05B25) Other designs, configurations (05B30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Spherical codes and designs
• Three-class association schemes
• Equivalence classes of inverse orthogonal and unit Hadamard matrices
• Hoffman’s Coclique Bound for Normal Regular Digraphs, and Nonsymmetric Association Schemes
• The structure of imprimitive non-symmetric 3-class association schemes
• All triples for orthogonal designs of order 40
• Linked systems of symmetric group divisible designs
• Linked systems of symmetric group divisible designs of type. II

Cited In (2)

• Discrepancy of weighted matrix nets
• New weighing matrices via partitioned group actions

This page was built for publication: Disjoint weighing matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114772)