Disjoint weighing matrices

DOI10.1007/S10801-020-00981-0MaRDI QIDQ2114772zbMATH OpenOpenAlexFDO

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

Publication date 15 March 2022

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

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

zbMATH Keywords

association schemecirculant matrixdisjoint skew weighing matricesorthogonal designweighing matrix

Mathematics Subject Classification ID

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) Association schemes, strongly regular graphs (05E30)

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.

Review text

A weighing matrix of order \(n\) and weight \(w\), denoted by \(W(n,w)\), is an \(n \times n\) \((0, \pm 1)\)-matrix \(W\) such that \(WW^{\top}=wI_n\), where \(I_n\) denotes the identity matrix of order \(n\). In this paper, the authors introduce the notion of disjoint weighing matrices, as a generalization of orthogonal designs. Disjoint weighing matrices can be used in the construction of Bush-type Hadamard matrices, orthogonal designs, symmetric group divisible designs, and disjoint weighing designs. The main focus of the paper is on skew-symmetric disjoint weighing matrices. Using a recursive construction and a computer search, the authors obtain infinite classes of disjoint weighing matrices. They also introduce a generalization of symmetric group divisible designs and use skew-symmetric disjoint weighing matrices to obtain commutative association schemes with 3 or 4 classes.

Recommendations

• Balanced weighing matrices
• Weighing matrices and their applications
• New weighing matrices constructed from two circulant submatrices
• scientific article; zbMATH DE number 1290171
• scientific article; zbMATH DE number 5247089

Cites work

• All triples for orthogonal designs of order 40
• Equivalence classes of inverse orthogonal and unit Hadamard matrices
• Hoffman's coclique bound for normal regular digraphs, and nonsymmetric association schemes
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3935054 (Why is no real title available?)
• scientific article; zbMATH DE number 3733933 (Why is no real title available?)
• scientific article; zbMATH DE number 3637895 (Why is no real title available?)
• Linked systems of symmetric group divisible designs
• Linked systems of symmetric group divisible designs of type. II
• Spherical codes and designs
• The structure of imprimitive non-symmetric 3-class association schemes
• Three-class association schemes

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)