Checkered Hadamard Matrices of Order 16

Similar documents
3-Class Association Schemes and Hadamard Matrices of a Certain Block Form

The maximal determinant and subdeterminants of ±1 matrices

Some remarks on Hadamard matrices

RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA

A Series of Regular Hadamard Matrices

Some matrices of Williamson type

On small defining sets for some SBIBD(4t-1, 2t-1, t-1)

Hadamard ideals and Hadamard matrices with two circulant cores

Lecture 8 : Eigenvalues and Eigenvectors

Some new constructions of orthogonal designs

The rank of connection matrices and the dimension of graph algebras

Hadamard matrices of order 32

Weighing matrices and their applications

Discrete Applied Mathematics

SOME SYMMETRIC (47,23,11) DESIGNS. Dean Crnković and Sanja Rukavina Faculty of Philosophy, Rijeka, Croatia

Background on Linear Algebra - Lecture 2

On minors of the compound matrix of a Laplacian

On integer matrices obeying certain matrix equations

Strongly Regular Decompositions of the Complete Graph

On the Shadow Geometries of W (23, 16)

Direct Methods for Solving Linear Systems. Simon Fraser University Surrey Campus MACM 316 Spring 2005 Instructor: Ha Le

On Construction of a Class of. Orthogonal Arrays

AMS 209, Fall 2015 Final Project Type A Numerical Linear Algebra: Gaussian Elimination with Pivoting for Solving Linear Systems

Introduction to the Unitary Group Approach

New duality operator for complex circulant matrices and a conjecture of Ryser

arxiv: v1 [math.co] 27 Jul 2015

Some New D-Optimal Designs

Hadamard matrices and strongly regular graphs with the 3-e.c. adjacency property

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 13

On zero-sum partitions and anti-magic trees

Sign Patterns of G-Matrices

The Matrix-Tree Theorem

On Good Matrices and Skew Hadamard Matrices

Some constructions of integral graphs

Topic 15 Notes Jeremy Orloff

A 2 G 2 A 1 A 1. (3) A double edge pointing from α i to α j if α i, α j are not perpendicular and α i 2 = 2 α j 2

Hadamard matrices of order 32

b c a Permutations of Group elements are the basis of the regular representation of any Group. E C C C C E C E C E C C C E C C C E

Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J

On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer


Complex Hadamard matrices and 3-class association schemes

SCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE

The spectra of super line multigraphs

arxiv: v4 [math.co] 12 Feb 2017

Linear Analysis Lecture 16

Computational Linear Algebra

Two infinite families of symmetric Hadamard matrices. Jennifer Seberry

Intrinsic products and factorizations of matrices

On Expected Gaussian Random Determinants

Trades in complex Hadamard matrices

On the construction of asymmetric orthogonal arrays

Ranks of Hadamard Matrices and Equivalence of Sylvester Hadamard and Pseudo-Noise Matrices

An infinite family of skew weighing matrices

THE STRUCTURE OF 3-CONNECTED MATROIDS OF PATH WIDTH THREE

NEW CONSTRUCTION OF THE EAGON-NORTHCOTT COMPLEX. Oh-Jin Kang and Joohyung Kim

Final Project # 5 The Cartan matrix of a Root System

Matrix Factorization and Analysis

COMPLETION OF PARTIAL LATIN SQUARES

Complexity of the Havas, Majewski, Matthews LLL. Mathematisch Instituut, Universiteit Utrecht. P.O. Box

Perfect Secret Sharing Schemes from Room. Squares. Ghulam-Rasool Chaudhry. Centre for Computer Security Research. University of Wollongong

Minimal and Maximal Critical Sets in Room Squares

ON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION

A prolific construction of strongly regular graphs with the n-e.c. property

Hadamard and conference matrices

Matrix Algebra. Matrix Algebra. Chapter 8 - S&B

On the eigenvalues of Euclidean distance matrices

II. Determinant Functions

Lecture Notes Introduction to Cluster Algebra

5.6. PSEUDOINVERSES 101. A H w.

Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets

REVERSALS ON SFT S. 1. Introduction and preliminaries

Self-dual interval orders and row-fishburn matrices

Multivariate Gaussian Analysis

Linear Systems and Matrices

Low Rank Co-Diagonal Matrices and Ramsey Graphs

Zero sum partition of Abelian groups into sets of the same order and its applications

Auerbach bases and minimal volume sufficient enlargements

Vladimir Kirichenko and Makar Plakhotnyk

Algebraic Methods in Combinatorics

DETERMINANTS 1. def. (ijk) = (ik)(ij).

Tilburg University. Strongly Regular Graphs with Maximal Energy Haemers, W. H. Publication date: Link to publication

EXPLICIT EVALUATIONS OF SOME WEIL SUMS. 1. Introduction In this article we will explicitly evaluate exponential sums of the form

New Bounds For Pairwise Orthogonal Diagonal Latin Squares

Hadamard Matrices, d-linearly Independent Sets and Correlation-Immune Boolean Functions with Minimum Hamming Weights

Boolean Inner-Product Spaces and Boolean Matrices

MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.

LOWER BOUNDARY HYPERPLANES OF THE CANONICAL LEFT CELLS IN THE AFFINE WEYL GROUP W a (Ãn 1) Jian-yi Shi

ON A METHOD OF SUM COMPOSITION OF ORTHOGONAL LATIN SQUARES. * Michigan State University

Lecture 1: Latin Squares!

On the adjacency matrix of a block graph

IMA Preprint Series # 2066

Linear Algebra and its Applications

ON MULTI-AVOIDANCE OF RIGHT ANGLED NUMBERED POLYOMINO PATTERNS

Matrix Basic Concepts

Square 2-designs/1. 1 Definition

Combinatorial Batch Codes and Transversal Matroids

The Determinant: a Means to Calculate Volume

SZEMERÉDI S REGULARITY LEMMA FOR MATRICES AND SPARSE GRAPHS

Perfect Secret Sharing Schemes from Room Squares

Transcription:

Europ. J. Combinatorics (1998) 19, 935 941 Article No. ej980250 Checkered Hadamard Matrices of Order 16 R. W. GOLDBACH AND H. L. CLAASEN 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 ij of order 4 such that H ii = J 4 and H ij J 4 = J 4 H ij = 0 for i = j and where J 4 is the all-one matrix of order 4). It is shown that the checkered Hadamard matrices of order 16 all belong to one of the Hall s classes I, II or III. Moreover the so-called block equivalency classes are determined. c 1998 Academic Press 1. PRELIMINARIES DEFINITION 1.1. An Hadamard matrix H of order g 2 is called a checkered Hadamard matrix if H has the following form J g H 12 H 1g H H = 21 J g H 2g.. H g1 H g2 J g in which all matrices H ij are square, J g is the all-one matrix and H ij J g = J g H ij = 0. We consider in this paper the case g = 4. For the proofs of most results we refer to [1]. According to Wallis [4], K. A. Bush was the first to raise the question of the existence of what we call checkered Hadamard matrices. In [2] we investigated checkered Hadamard matrices and their connection with 3-class association schemes. For example, let (X, R) be a symmetric 3-class association scheme of type L 1,s (2s), then for an appropriately chosen numbering of the relations, D 0 + D 1 D 2 + D 3 is a symmetric checkered Hadamard matrix of order 4s 2, where the D i are the adjacency matrices. In this context it seems natural to determine all the checkered Hadamard matrices of order 16 and using this result and those from [2] to find, in a later paper, all the symmetric and non-symmetric 3-class association schemes connected with this type of Hadamard matrices. We use in this paper the terminology of [3]. In particular we use the notion of Hall s classes [3, p. 420] as well as the notion of invariants [3, p. 410]. Unless otherwise stated, H denotes a checkered Hadamard matrix of order 16 and we assume that the rows and columns of H are numbered from 0 to 15. I t denotes the (t t) identity matrix and J t denotes the (t t) all-one matrix. A16 16 matrix K can be considered to consist of 16 blocks (i.e., 4 4 matrices) K ij. We say that the matrices K ij (1 j 4) form the i-th block row and that the matrices K ij (1 i 4) form the j-th block column. It is usual to distinguish Hadamard matrices up to Hadamard equivalency (H-equivalency). However, general H-equivalent operations may destroy the block form of a checkered Hadamard matrix. Therefore we introduce and investigate in this paper a more special equivalence relation: block equivalency, which preserves the block structure of a checkered Hadamard matrix. The second author, H. L. Claasen died on 26 May 1998. 0195-6698/98/080935 + 07 $30.00/0 c 1998 Academic Press

936 R. W. Goldbach and H. L. Claasen It is worth noting that there are checkered Hadamard matrices which are Hadamard equivalent but are not block equivalent (compare Theorems 4.2, 4.3 and 4.4). In what follows a matrix is called monomial if in each row and in each column there is exactly one entry = 0. LEMMA 1.2. If S and T are square monomial matrices of order 16 with non-zero entries ±1 such that S(I 4 J 4 )T = I 4 J 4, then S and T have the following block structure. There is a permutation α of {1, 2, 3, 4} such that for each i {1, 2, 3, 4} the blocks ɛ i S i,α(i) and ɛ i T α(i),i (ɛ i well chosen in {+1, 1}) are permutation matrices and the matrices S ik and T ki with k {1, 2, 3, 4}\{α(i)} are all-zero matrices. If also SHT = H, then the i-th block row and the j-th block column of H are mapped onto the α(i)-th block row and the α(j)-th block column of H, respectively. In particular, H ij and H α(i),α( j) have the same rank. The proof of the lemma is left to the reader. Two checkered Hadamard matrices H 1 and H 2 of order 16 are called block equivalent if there are two monomial matrices S and T with non-zero entries +1 and 1 such that SH 1 T = H 2 and S(I 4 J 4 )T = I 4 J 4. THEOREM 1.3. There are Hadamard matrices of order 16 which are not H-equivalent to a checkered Hadamard matrix. PROOF. As we shall show in the following, Hadamard matrices belonging to Hall s classes IV or V cannot be H-equivalent to a checkered Hadamard matrix of order 16, implying the theorem. 2. ON THEBLOCKS OF A CHECKERED HADAMARD MATRIX OF ORDER 16 The off-diagonal blocks of a checkered Hadamard matrix of order 16 are (+1, 1) matrices A of order 4 with the additional property AJ 4 = J 4 A = 0. In this section we shall discuss this type of matrix. Let x i R 4 be a row vector with entries ±1 and entry sum 0. Clearly the following row vectors are the only possibilities. x 0 = (+1, +1, 1, 1), x 1 = (+1, 1, +1, 1), x 2 = (+1, 1, 1, +1) and x i = x i 3 for i = 3, 4, 5. Here the inner product (x i, x j ) = 0ifi j (mod 3). We keep this notation for the rest of this paper. LEMMA 2.1. Let A be a square matrix of order 4 with entries ±1 such that AJ 4 = J 4 A = 0. Then the following hold. (1) Rank (A) is either 1 or 2. (2) If rank (A) = 1 and if y is a row of A, then the four rows of A are y, y, y and y. (3) If rank (A) = 2 and if y and z are independent rows of A, then the four rows of A are y, z, y and z. By Lemma 2.1 a square matrix A of order 4 with entries ±1 such that AJ 4 = J 4 A = 0 has one of the following row forms t with t {0, 1, 2, 3, 4, 5}; here y and z are vectors of the form x i (i {0, 1, 2, 3, 4, 5}), while (y, z) = 0.

Checkered Hadamard matrices of order 16 937 0 1 2 3 4 5 +y +y +y +y +y +y +y y y +z +z y y +y y z y +z y y +y y z z If A T has row form t, then we say that A has column form t. We introduce the following matrices (here i, j, k, l {0, 1, 2}): T ij;kl = 1 2 {(x i + x j ) T x k + (x i x j ) T x l }. If i = j or k = l, we denote T ij;kl by O ik. We assume throughout this paper that the rows and columns of the matrices T ij;kl are labelled by 0, 1, 2, 3 and when considering matrices T ij;kl, we assume that i, j, k, l {0, 1, 2}. The proof of the following lemma is straightforward and is left to the reader. LEMMA 2.2. Let A be a (+1, 1) matrix of order 4 such that AJ 4 = J 4 A = 0. (1) If A has rank 1, row form i and column form k, then A = ηo ik with η {+1, 1}. (2) If A has rank 2, row form m and column form n, then A = ηt ij;kl for well-chosen η {+1, 1} and for i = j and k = l such that i + j = m 2 and k + l = n 2. (3) A = ηt ij;kl with η {+1, 1} has (a) row (column) form 3 if {i, j} ={0, 1} ({k, l} ={0, 1}), (b) row (column) form 4 if {i, j} ={0, 2} ({k, l} ={0, 2}), (c) row (column) form 5 if {i, j} ={1, 2} ({k, l} ={1, 2}). (4) O T ik = O ki and (T ij;kl ) T = T kl;ij. If in Lemma 2.2, η =+1, then we say that A has sign + and otherwise that its sign is. 3. A DISCUSSION OF THE STRUCTURE We recall the convention that unless otherwise stated, H is, in this paper, a checkered Hadamard matrix of order 16. LEMMA 3.1. A block row of H may contain (apart from J 4 ) (1) three blocks of rank 1 of different row forms, (2) one block of rank 1 of row form t (t {0, 1, 2}) and two blocks of rank 2 of row form 5 t, or (3) three blocks of rank 2 of different row forms. An analogous result holds if in the above one replaces row by column. PROOF. Let a block row of H contain k t blocks of the row form t (t {0, 1, 2, 3, 4, 5}). Since the inner product of two different rows of the block row is 0, we find (taking the inner products of the first row with the second, third and fourth row) + k 0 + k 1 k 2 + k 3 = 1 + k 0 k 1 + k 2 + k 4 = 1 k 0 + k 1 + k 2 + k 5 = 1 Now since k t N, the results follow easily.

938 R. W. Goldbach and H. L. Claasen In the next Lemma 3.2 the third possibility of the preceding lemma is excluded. Let M be a block matrix with blocks M ij. If rank(m ij ) = r ij, then the matrix with (i, j)- entry r ij is called the rank ( distribution ) matrix of M, denoted by R(M). Hij H ik A submatrix T = ( T H = ji H jl H ki H kl H lj H lk of H with i, j, k and l all different is called a tile. If ), then T and T are called complementary tiles. LEMMA 3.2. The following hold for H. (1) Every block row (column) of H contains either no blocks of rank 2 or exactly two blocks of rank 2 of the same row (column) form. (2) Up to permutations of the rows and columns the rank distribution matrix of a tile can only be ( ) 1 1, 1 1 ( ) 2 1, 1 1 ( ) 2 1, 1 2 ( ) 2 2. 2 2 (3) If a tile of H has rank distribution matrix 2J 2, then its complementary tile has rank distribution matrix either J 2 or 2J 2. THEOREM 3.3. The following hold. (1) A checkered Hadamard matrix of order 16 contains either no or one or two tiles of which all the blocks have rank 2. (2) Checkered Hadamard matrices with different numbers of tiles of which all the blocks have rank 2 are not block equivalent. (3) Up to block equivalency the rank distribution matrix of H must have one of the following forms: 1 1 1 1 1 2 2 1 1 2 2 1 1 1 1 1 1 1 1 1 2 1 1 2,,. 1 1 1 1 1 1 1 1 2 1 1 2 1 1 1 1 1 2 2 1 1 2 2 1 DEFINITION 3.4. We say that a checkered Hadamard matrix of order 16 with t (t {0, 1, 2}) tiles of which all blocks have rank 2 has the rank format t. We emphasize that two checkered Hadamard matrices of different rank format are not block equivalent. LEMMA 3.5. The following hold. (1) If a block of H has rank 1 and row-space A, then the row-space of any block in the same block column is orthogonal to A. (2) If two blocks of H in the same block column have rank 2, then they have the same row space. ( ) H1 H (3) If 2 is a tile of H with rank distribution matrix 2J H 3 H 2 and (a b) is a row of 4 (H 1 H 2 ), then ( a b) or (a b) is a row of (H 3 H 4 ). An analogous result holds if we interchange row and column. The next theorem shows that the properties of the blocks of a checkered Hadamard matrix of order 16 found in this section are also sufficient for a block matrix of order 16 to be a checkered Hadamard matrix.

Checkered Hadamard matrices of order 16 939 THEOREM 3.6. A square ( 1, +1) matrix H of order 16 with blocks H ij of order 4 is a checkered Hadamard matrix if and only if the following conditions are fulfilled. (1) H ii = J 4 and H ij J 4 = J 4 H ij = 0 for any i and j such that i = j. (2) Each block row contains either (a) three blocks = J 4 of rank 1 of different row forms or (b) one block = J 4 of rank 1 of row form t and two blocks of rank 2 of row form 5 t (t {0, 1, 2}). (3) Each tile of H has one of the rank distribution matrices given in item 2 of Lemma 3.2. (4) Two blocks in the same block column have orthogonal row spaces if at least one of them has rank 1. (5) Suppose the blocks of a tile T all have rank 2. (a) Then the blocks in the same block column of T have the same row space. (b) If (a b) is a row in one of the block rows of T, then ( a b) or (a b) isarow in the other block row of T. 4. THE BLOCK EQUIVALENCY CLASSES If H is of rank format 0, by definition all blocks H ij have rank 1. LEMMA 4.1. Every checkered Hadamard matrix H of order 16 of rank format 0 is block equivalent to a matrix of the following form: J 4 η 12 O 00 η 13 O 11 η 14 O 22 η 21 O 00 J 4 η 23 O 22 η 24 O 11 (1) η 31 O 11 η 32 O 22 J 4 η 34 O 00 η 41 O 22 η 42 O 11 η 43 O 00 J 4 with η ij { 1, +1}. PROOF. Without loss of generality we can assume that a block row of H has the following form: (J 4 O ak O bl O cm ), {a, b, c} ={0, 1, 2} (by Lemma 3.1) and k, l, m chosen in {0, 1, 2}. By an appropriate row permutation one can change the row form of each of the blocks of the given block row at will (of course within the constraints given in Lemma 3.2). Since the same applies to the column form, it is easy to complete the proof of the theorem. The next theorem characterizes the block equivalency classes for the rank format 0. THEOREM 4.2. The set of checkered Hadamard matrices of rank format 0 consists of two block equivalency classes. One class consists of the matrices which can, by block equivalent operations, be brought to the form (1) with an even number of η ij equal to 1. Matrices of this class belong to Hall s class I. The other class consists of the matrices which can, by block equivalent operations, be brought to the form (1) with an odd number of η ij equal to 1. Matrices of this class belong to Hall s class II. The next theorem covers rank format 2.

940 R. W. Goldbach and H. L. Claasen THEOREM 4.3. Let H be a checkered Hadamard matrix of order 16 and of rank format 2. H is block equivalent to a matrix of the form: J 4 T 12;12 T 12;12 O 00 T 12;12 J 4 O 00 T 12;12. (2) T 12;12 ηo 00 J 4 T 12;12 ˆηO 00 T 12;12 T 12;12 J 4 There are three block equivalency classes of checkered Hadamard matrices of order 16 and of rank format 2. The first class consists of matrices which can be brought to the form (2) with η =ˆη =+1. Matrices of this class belong to Hall s class I. The second class consists of matrices which can be brought to the form (2) with η ˆη = 1. Matrices of this class belong to Hall s class II. The third class consists of matrices which can be brought to the form (2) with η =ˆη = 1. Matrices of this class belong to Hall s class III. Finally we consider the checkered Hadamard matrices of rank format 1. Let H be a checkered Hadamard matrix of order 16 and of rank format 1. Applying the appropriate block equivalent operations it is possible to bring H into the following form, which is block equivalent to H: J 4 T 12;12 T 12;12 η 1 O 00 ɛ 1 O 11 J 4 η 2 O 00 ɛ 2 O 22 ɛ 3 O 22 η 3 O 00 J 4 ɛ 4 O 11 η 4 O 00 T 12;12 T 12;12 J 4 where ɛ i,η j { 1, +1} for i, j {1, 2, 3, 4}. One can, without loss of generality, suppose that η i =+1for i {1, 2, 3, 4} (by an appropriately chosen column permutation one can bring the matrix in a form for which η 4 =+1, etc.). Once that has been achieved it is possible, by applying well-chosen row permutations, to reach a situation where ɛ 1 = ɛ 4 =+1and all the matrices O 00 still have sign +. So we see that H is block equivalent to J 4 T 12;12 T 12;12 O 00 O 11 J 4 O 00 ηo 22. ˆηO 22 O 00 J 4 O 11 O 00 T 12;12 T 12;12 J 4 If η = ˆη = 1, then apply on this matrix the row permutation (45)(67) and the column permutation (01)(23), yielding a matrix with η =ˆη =+1 and if η =+1 and ˆη = 1, then the above process applied on this matrix yields one with η = 1 and ˆη =+1. So we have the following theorem. THEOREM 4.4. Let H be a checkered Hadamard matrix of order 16 and of rank format 1. H is block equivalent to a matrix of the following form: J 4 T 12;12 T 12;12 O 00 O 11 J 4 O 00 ηo 22 O 22 O 00 J 4 O 11 O 00 T 12;12 T 12;12 J 4 There are two block equivalency classes of checkered Hadamard matrices of order 16 and of rank format 1.,

Checkered Hadamard matrices of order 16 941 The first class consists of matrices which can be brought to the above form with η =+1. Matrices of this class belong to Hall s class II. The second class consists of matrices which can be brought to the above form with η = 1. Matrices of this class belong to Hall s class III. REFERENCES 1. }R. W. Goldbach and H. L. Claasen, Checkered Hadamard matrices of order 16, Report 96 136, Delft University of Technology, Delft, 1996. 2. }R. W. Goldbach and H. L. Claasen, 3-class association schemes and Hadamard matrices of a certain block form, Eur. J. Combin., 19 (1998), 943 949. 3. }W. D. Wallis, Ann Penfold Street and Jennifer Seberry Wallis, Combinatorics: Room Squares, Sum-free Sets, Hadamard Matrices, Lecture Notes in Mathematics, 292 (1972). Springer, Berlin. 4. }W. D. Wallis, On a problem of K. A. Bush concerning Hadamard matrices, Bull. Austr. Math. Soc., 6 (1972), 321 326. Received 6 July 1998 and accepted in revised form 30 July 1998 R. W. GOLDBACH Department ITS/TWI, Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands E-mail: R.W.Goldbach@twi.tudelft.nl