×

zbMATH — the first resource for mathematics

An infinite class of Hadamard matrices of maximal excess. (English) Zbl 0734.05028
Let H be an Hadamard matrix of order n. Then \(\sigma\) (H) denotes the sum of all entries of H. Furthermore \[ \sigma (n)=_{H} \sigma (H), \] where H runs over all Hadamard matrices of order n. Now the main result of the present paper is the following theorem: If m is the order of a skew Hadamard matrix, then \[ \sigma (4m^ 2-4m)=4(m-1)^ 2(2m+1). \]

MSC:
05B20 Combinatorial aspects of matrices (incidence, Hadamard, etc.)
Keywords:
Hadamard matrix
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Farmakis, N.; Kounias, S., The excess of Hadamard matrices and optimal designs, Discrete math., 67, 165-176, (1987) · Zbl 0652.05006
[2] Geramita, A.V.; Seberry, J., Orthogonal designs: quadratic forms and Hadamard matrices, (1979), Marcell Dekker New York · Zbl 0411.05023
[3] Kounias, S.; Farmakis, N., On the excess of Hadamard matrices, Discrete math., 68, 59-69, (1988) · Zbl 0667.05013
[4] Pesotan, H.; Raghararao, D., Embedded Hadamard matrices, Utilitas math., 8, 99-110, (1975) · Zbl 0326.05018
[5] Pesotan, H.; Raghararao, D.; Raktoe, B.L., Further contributions to embedded Hadamard matrices, Utilitas math., 12, 241-246, (1977) · Zbl 0374.05010
[6] Sathe, Y.S.; Shenoy, R.G., Constructions of maximal weight Hadamard matrices of order 48 and 80, Ars combin., 19, 25-35, (1985) · Zbl 0573.05013
[7] J. Seberry, SBIBD (4k2, 2k2 + k, k2 + k) and Hadamard matrices of order 4k2 with maximal excess are equivalent, Graphs and Combinatorics, to appear.
[8] Wallis, W.D.; Street, A.P.; Wallis, J.S., Combinatorics: room squares, sum-free sets, Hadamard matrices, () · Zbl 1317.05003
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.