Hadamard matrices of order 36 with automorphisms of order 17
- 1 December 1986
- journal article
- research article
- Published by Cambridge University Press (CUP) in Nagoya Mathematical Journal
- Vol. 104, 163-174
- https://doi.org/10.1017/s002776300002273x
Abstract
A Hadamard matrix of order n is an n by n matrix of 1’s and − 1’s such that HHt − nI. In such a matrix n is necessarily 1, 2 or a multiple of 4. Two Hadamard matrices H1 and H2 are called equivalent if there exist monomial matrices P, Q with PH1Q = H2. An automorphism of a Hadamard matrix H is an equivalence of the matrix to itself, i.e. a pair (P, Q) of monomial matrices such that PHQ = H. In other words, an automorphism of H is a permutation of its rows followed by multiplication of some rows by − 1, which leads to reordering of its columns and multiplication of some columns by − 1. The set of all automorphisms form a group under composition called the automorphism group (Aut H) of H. For a detailed study of the basic properties and applications of Hadamard matrices see, e.g. [1], [7, Chap. 14], [8].Keywords
This publication has 11 references indexed in Scilit:
- Hadamard matrices of order 28 with automorphisms of order 7Journal of Combinatorial Theory, Series A, 1985
- Hadamard matrices of order 28 with automorphisms of order 13Journal of Combinatorial Theory, Series A, 1983
- An Hadamard matrix of order 36Journal of Combinatorial Theory, Series A, 1983
- Classification of 3-(24, 12, 5) designs and 24-dimensional Hadamard matricesJournal of Combinatorial Theory, Series A, 1981
- Hadamard matrices with ?doubly transitive? automorphism groupsArchiv der Mathematik, 1980
- On Cyclic Steiner 2-DesignsPublished by Elsevier ,1980
- Hadamard Matrices and Their ApplicationsThe Annals of Statistics, 1978
- Nonisomorphic Hadamard designsJournal of Combinatorial Theory, Series A, 1976
- SYMMETRIC HADAMARD MATRICES OF ORDER 36Annals of the New York Academy of Sciences, 1970
- Automorphism groups of Hadamard matricesJournal of Combinatorial Theory, 1969