𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Properties of Hadamard product of inverse M-matrices

✍ Scribed by Chuansheng Yang; Chengxian Xu


Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
102 KB
Volume
11
Category
Article
ISSN
1070-5325

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Automorphisms of higher-dimensional Hada
✍ Warwick de Launey; Richard M. Stafford πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 308 KB

## Abstract This article derives from first principles a definition of equivalence for higher‐dimensional Hadamard matrices and thereby a definition of the automorphism group for higher‐dimensional Hadamard matrices. Our procedure is quite general and could be applied to other kinds of designs for

Checkered Hadamard Matrices of Order 16
✍ R.W. Goldbach; H.L. Claasen πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 112 KB

In this paper all the so-called checkered Hadamard matrices of order 16 are determined (i.e., Hadamard matrices consisting of 16 square blocks H i j of order 4 such that H ii = J 4 and H i j J 4 = J 4 H i j = 0 for i = j and where J 4 is the all-one matrix of order 4). It is shown that the checkered

On the asymptotic existence of complex H
✍ R. Craigen; W. H. Holzmann; H. Kharaghani πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 159 KB πŸ‘ 2 views

Let N = N (q) be the number of nonzero digits in the binary expansion of the odd integer q. A construction method is presented which produces, among other results, a block circulant complex Hadamard matrix of order 2 Ξ± q, where Ξ± β‰₯ 2N -1. This improves a recent result of Craigen regarding the asympt

Hadamard matrices of small order and Yan
✍ Dragomir Ε½. ÐokoviΔ‡ πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 79 KB πŸ‘ 1 views

## Abstract We show that 138 odd values of __n__<10000 for which a Hadamard matrix of order 4__n__ exists have been overlooked in the recent handbook of combinatorial designs. There are four additional odd __n__=191, 5767, 7081, 8249 in that range for which Hadamard matrices of order 4__n__ exist.

Decompositions of Complete Multigraphs R
✍ David A Gregory; Kevin N Vander Meulen πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 242 KB

Let bp(+K v ) be the minimum number of complete bipartite subgraphs needed to partition the edge set of +K v , the complete multigraph with + edges between each pair of its v vertices. Many papers have examined bp(+K v ) for v 2+. For each + and v with v 2+, it is shown here that if certain Hadamard