Regular sets of matrices and applications

DOI10.1007/BF02988305MaRDI QIDQ2366958zbMATH OpenOpenAlexFDO

Authors Xian-Mo Zhang, Jennifer Seberry

Publication date 11 August 1993

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02988305

zbMATH Keywords

Hadamard matrices regular \(s\)-set of matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Review text

The present paper is a sequel to the paper by the first author and \textit{A. L. Whiteman} [Graphs Comb. 4, No. 4, 355-377 (1988; Zbl 0673.05016)]. The set \(\{A_ i,\;1\leq i\leq s\}\) of \(s\) \((-1,1)\)-matrices of order \(m\) is called a regular \(s\)-set of matrices of order \(m\) if the following conditions are satisfied: \[ A_ i A_ j= A_ i{^ tA_ j}= J\;(1\leq i, j\leq s)\quad\text{and}\quad\sum_{1\leq i\leq s} (A_ i A^ t_ j+ A_ i{^ tA_ j})=2smI. \] Now, first of all, three product theorems are obtained. For instance, using a regular \(s\)-set of matrices of order \(m\) and a regular \(m\)-set of matrices of order \(n\) the authors construct a regular \(s\)-set of matrices of order \(mn\) (Theorem 1). Then they apply the results to Hadamard matrices and orthogonal designs. For instance, using an Hadamard matrix of order \(4h\) and a regular \(2h\)-set of matrices of order \(m\), they construct an Hadamard matrix of order \(4hm\) (Theorem 4).

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Regular sets of matrices and applications

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