Abstract
In this paper we show that every matrix in the class of Sylvester Hadamard matrices of order 2k under H-equivalence can have full row and column sign spectrum, meaning that tabulating the numbers of sign interchanges along any row (or column) gives all integers 0,1,...,2k − 1 in some order. The construction and properties of Yates Hadamard matrices are presented and is established their equivalence with the Sylvester Hadamard matrices of the same order. Finally, is proved that every normalized Hadamard matrix has full column or row sign spectrum if and only if is H-equivalent to a Sylvester Hadamard matrix. This provides us with an efficient criterion identifying the equivalence of Sylvester Hadamard matrices.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bella, T., Olshevsky, V., Sakhnovich, L.: Ranks of Hadamard matrices and equivalence of Sylvester Hadamard and pseudo-noise matrices. In: Operator Theory: Advances and Applications, vol. 179, pp. 35–46. Birkhauser, Basel (2007)
Cooper, J., Milas, J., Wallis, W.D.: Hadamard equivalence, combinatorial mathematics. In: Lecture Notes in Mathematics, vol. 686, pp. 126–135. Springer, Berlin (1978)
Colbourn, C.J., Dinitz, J.H.: CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton (1996)
Georgiou, S., Koukouvinos, C., Seberry, J.: Hadamard matrices, orthogonal designs and construction algorithms. In: Wallis, W.D. (ed.) Designs 2002: Further Computational and Constructive Design Theory, pp. 133–205. Kluwer, Norwell (2003)
Geramita, A.V., Seberry, J.: Orthogonal designs. In: Quadratic Forms and Hadamard Matrices. Lecture Notes in Pure and Applied Mathematics, vol. 45. Marcel Dekker, New York (1979)
Hadamard, J.: Résolution d’une question relative aux déterminants. Bull. Sci. Math. 17, 240–246 (1893)
Horadam, K.J.: Hadamard Matrices and Their Applications. Princeton University Press, Princeton (2007)
Kharaghani, H., Koukouvinos, C.: Complementary, base and turyn sequences. In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn., pp. 317–321. Chapman and Hall/CRC Press, Boca Raton (2006)
McKay, B.D.: Hadamard equivalence via graph isomorphism. Discrete Math. 27(2), 213–214 (1979)
Montgomery, D.C.: Design and Analysis of Experiments, 6th edn. Wiley, New York (2005)
Plackett, R.L., Burman, J.P.: The design of optimum multifactorial experiments. Biometrika 33, 305–325 (1946)
Sylvester, J.J.: Thoughts on inverse orthogonal matrices, simultaneous sign-successions and tesselated pavements in two or more colors, with applications to Newton’s rule, ornamental-tile-work, and theory of numbers. Philos. Mag. 34, 461–475 (1867)
Wallis, W.D., Street, A.P., Seberry Wallis, J.: Combinatorics: room squares, sum-free sets, hadamard matrices. In: Lecture Notes in Mathematics, vol. 292. Springer, Berlin (1972)
Williams, R.C., Cray, F.D.: Normal to sequency-ordered Hadamard matrix conversion. Anal. Chem. 48(8), 1150–1151 (1976)
Williams, R.C., Swanson, R.M., Wilkins, C.L.: Concise algorithm for conversion between normal and sequency ordered Hadamard matrices. Anal. Chem. 46(12), 1803–1804 (1974)
Yates, F.: Design and Analysis of Factorial Experiments. Tech. Comm. No. 35, Imperial Bureau of Soil Sciences, London (1937)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mitrouli, M. A sign test for detecting the equivalence of Sylvester Hadamard matrices. Numer Algor 57, 169–186 (2011). https://doi.org/10.1007/s11075-010-9422-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-010-9422-9