Block Structured Hadamard matrices from certain arrays

Sheet Nihal Topno1, Shyam Saurabh2
1Department of Mathematics, Ranchi University, Ranchi, Jharkhand, India.
2Department of Mathematics, Tata College Chaibasa, Jharkhand, India.

Abstract

We have constructed Block structured Hadamard matrices in which odd number of blocks are used in a row (column). These matrices are different than those introduced by Agaian. Generalised forms of arrays developed by Goethals-Seidel, Wallis-Whiteman and Seberry-Balonin heve been employed. Such types of matrices are applicable in the constructions of nested group divisible designs.

Keywords: Hadamard matrix, Kronecker product, Block structure, Group divisible design

1. Introduction

Hadamard matrices discovered by Sylvester in 1867 [1] have profound structural properties. These kind of matrices have Hadamard matrices as their sub blocks. In his matrices even number of Hadamard blocks were arranged in a row (or column). However in 1985 Agaian [2] introduced Hadamard matrices with odd number of Hadamard blocks in a row. These matrices are named Block Structured Hadamard matrices. He has demonstrated their application in signal processing as well [3]. The matrices constructed by him are in correspondence to the Williamson matrices arranged in his array.

Williamson’s array has been further generalized by Goethals and Seidel [4]. Matrices suitable for Goethals- Seidel arrays have been constructed by several authors [5, 6, 7]. In 2015, Seberry and Balonin [8] introduced what is known as the “propus array” and its generalizations. This was accomplished by imposing certain restrictions on Williamson’s array and applying the arrangement principles from the Goethals-Seidel array.

The result presented in this paper involves the construction of block-structured Hadamard matrices using the generalizations of Goethals-Seidel array and Seberry-Balonin array. Similar to that of Agaian, these matrices also have odd number of blocks arranged in a row. However these are different from Agaian’s matrices, as these do not correspond to Williamson matrices. Furthermore, their applications in nested group divisible design are also discussed.

The paper is organized as follows: Section 2 contains all the relevant definitions and results. Section 3 comprises of the main result of this paper. Results are presented in three main theorems and two corollaries. Examples of each type are also included here. Section 4 is conclusion in which we have discussed some properties and an application of block structured Hadamard matrices in the construction of nested group divisible designs.

2. Preliminaries

We recall some basic definitions here [4, 9, 10, 11 , 12]. An Hadamard matrix is a square matrix H of order n with entries ±1 such that HH=nIn. Four matrices A,B,C,D of order n with entries ±1 are called Williamson matrices if (i) A,B,C,D are circulant, symmetric and commuting (ii)A2+B2+C2+D2=4nIn. If A,B,C,D of same order are circulant ±1 matrices satisfying AA+BB+CC+DD=4nIn then these are called Goethals-Seidel (GS) matrices. Dokovic et al. [6] have constructed GS matrices of type (ssss), (sssk), (sskk), (skkk) where ‘s’ stand for symmetric and ‘k’ for skew type GS matrices. In this article we shall be using (sssa) and (kkka) type GS matrices, where ‘a’ stands for any (symmetric, skew type or other) type of matrix. An Hadamard matrix H of order 4tn will be called Block Structured if all its 4t×4t blocks are Hadamard matrices for a given t. If A=[aij] and B=[bij] be two matrices of order m and n respectively then the Kronecker product AB is the matrix of order mn given by AB=[aijB]. Two matrices A and B are said to be Amicable if AB=BA.
Let the elements zi of an additive abelian group G be ordered in a fixed way. Let XG. Then the matrix M=(mij) defined by
mij=ψ(zjzi),whereψ(zjzi)={1ifzjziX,0otherwise,
is called type 1 incidence matrix of X in G, and the matrix N=(nij) defined by
nij=ψ(zj+zi),whereψ(zj+zi)={1ifzj+ziX,0otherwise,
is called type 2 incidence matrix of X in G. A Circulant matrix M=(mij) defined by mij=m1,ji+1 is a special case of type 1 matrix and a backcirculant matrix N=(nij) defined by nij=n1,i+j1 is a special case of type 2 matrix. Following proposition is useful in development of the results in this paper.

Proposition 1. [Seberry] If X and Y are type 1 matrices and Z is type 2 matrix then
XY=YX, XY=YX, XY=YX, XY=YX and
XZ=ZX, XZ=ZX, XZ=ZX, XZ=ZX.

Notation: Throughout this paper In denotes the identity matrix of order n and Jn denotes the all-1 matrix of order n. Wherever I and J are used without subscript, they have the same meaning and their orders can be determined from the context.

3. Main Result

Lemma 1. Let Ai,i=0,1,2,3 be circulant matrices of order n and let R=[rij] be defined as ri,ni+1=1,rij=0 otherwise. Then

  1. (AiR)=(AiR)&(AiR)=(AiR),i=1,2,3

  2. A0(AiR)=(AiR)A0, i=1, 2, 3

  3. A0(AiR)=(AiR)A0 , i=1, 2, 3

  4. (AiR)(AjR)=(AjTR)(AiR),i,j=1,2,3

  5. (AiR)(Ai+jR)=(Ai+jR)(AiR)&(Ai+jR)(AiR)=(AiR)(Ai+jR),i,j=1,2, i+j3

Proof. Using Proposition 1

Using this lemma following Theorem can be proven easily.

Theorem 1. Let there exist (0,1,1)-matrices Xi,Yj;0i3,1j3 of order 4t;(tN) such that
(i) X0X0=XiXi+YiYi=tI4t;1i3
(ii) X0Xi+XiX0=0=X0Yi+YiX0,i=1,2,3
(iii) XiYi=0=YiXi, i=1,2,3
(iv) XiYj+XjYi=0=YjXi+YiXj,1ij3
(v) XiXi+j+Yi+jYi=0=Xi+jXi+YiYi+j,i,j=1,2, i+j3.
Then we have
(1) If there exist Goethals-Seidel matrices Ai,i=0,1,2,3 of order n of the type (kkka) or (sssa) then there exists a block structured Hadamard matrix of order 4nt with Hadamard blocks of order 4t.
(2) If there exist type 2 matrix A0 and three type 1 matrices Ai; 1i3 defined on the same Abelian group of order n such that i=03AiAi=4nIn then there exists a block structured Hadamard matrix of order 4nt with Hadamard blocks of order 4t.

Proof. (1) Define a matrix H by H=A0X0+A1RX1+A1RY1+A2RX2+A2RY2+A3RX3+A3RY3, where Ais correspond to ‘s’ or ‘k’ type for i=1,2,3 and A0 corresponds to ‘a’ type. Then HH=A0A0X0X0+i=13{(AiR)(AiR)XiXi+(AiR)(AiR)YiYi}+[i=13{(A0(AiR)X0Xi+(AiR)A0XiX0+A0(AiR)X0Yi+(AiR)A0YiX0)}+j=13i=13{(AiR)(AjR)XiYj+(AjR)(AiR)YjXi}+i=12{(AiR)(Ai+1R)XiXi+1+(Ai+1R)(AiR)Xi+1Xi+(AiR)(Ai+1R)YiYi+1+(Ai+1R)(AiR)Yi+1Yi)}+i=1{(AiR)(Ai+2R)XiXi+2+(Ai+2R)(AiR)Xi+2Xi+(AiR)(Ai+2R)YiYi+2+(Ai+2R)(AiR)Yi+2Yi)}]

=A0A0X0X0+i=13AiAi(XiXi+YiYi)+[i=13{A0(AiR)(X0Xi+XiX0)+A0(AiR)(X0Yi+YiX0)}+j=13i=13(AiR)(AjR)(XiYj+YjXi)+i=12{(AiR)(Ai+1R)(XiXi+1+Yi+1Yi)+(Ai+1R)(AiR)(Xi+1Xi+YiYi+1)}+i=1{(AiR)(Ai+2R)(XiXi+2+Yi+2Yi)+(Ai+2R)(AiR)(Xi+2Xi+YiYi+2)}]

=A0A0X0X0+i=13AiAi(XiXi+YiYi)+[0+{i=jAi2(XiYi+YiXi)+ijAiAj(XiYj+YjXi+XjYi+YiXj)}+0+0]

={i=04AiAi}tI4t=4ntI4nt.

Hence H is an Hadamard matrix. Now each 4t4t block (say Hij) is a linear combination of Xis and Yis of the form
Hij=i=03ρiXi+j=13σjYj, ρi,σj{1,1}.
Case 1: Ais are of the type (kkka)
Then Ai=Ai, i=1,2,3
AiR=AiR, i=1,2,3
ρi=σi, i=1,2,3.
Case 2: Ais are of the type (sssa)
Then Ai=Ai, i=1,2,3
AiR=AiR, i=1,2,3
ρi=σi, i=1,2,3.
Now HijHij=i=03XiXi+i=13YiYi±[i=13(X0Xi+XiX0+X0Yi+YiX0)±ji(XiYj+YjXi)±(XiXi+1+Xi+1Xi+YiYi+1+Yi+1Yi)]=4tI4t. each 4t4t block of H is an Hadamard matrix.
(2) Proof is similar to case (1), just define H by
H=A0X0+i=13{AiXi+AiYi} 

Example 1. The matrices X0=[1000100001000100001000100001000110001000010001000010001000010001],X1=[0100010010001000000000000000000001000100100010000000000000000000],X2=[0010001000000000100010000000000000100010000000001000100000000000] X3=[0001000100000000000000001000100000010001000000000000000010001000],Y1=[0000000000000000000100010010001000000000000000000001000100100010],Y2=[0000000000010001000000000100010000000000000100010000000001000100], Y3=[0000000000100010010001000000000000000000001000100100010000000000] together with (sssa) or (kkka) type Goethals-Seidel matrices of order n taken as Ais give the Block Structured Hadamard matrix of order 8n with Hadamard blocks of order 8.

Theorem 2. Let there exist three (0,1,1)-matrices of order 4t (tN) such that
(i) XiXi=tI4t; i=1,3 and X2X2=2tI4t
(ii) XiXj+XjXi=0; 1ij3.
Then we have
(1) If there exist four Williamson matrices Ai,1i4 such that A4=A2 of order n then there exists a block structured Hadamard matrix of order 4nt with Hadamard blocks of order 4t.
(2)If there exist three pairwise amicable ±1 matrices Ai;1i3 of order n such that A1A1+2A2A2+A3A3=4nIn then there exists a block structured Hadamard matrix of order 4nt with Hadamard blocks of order 4t.

Proof. (1) Define H by H=i=13AiXi then
HH=i=13AiAiXiXi+[i=12(AiAi+1XiXi+1+Ai+1AiXi+1Xi)+i=1(AiAi+2XiXi+2+Ai+2AiXi+2Xi)]=i=13AiAiXiXi+[i=12(AiAi+1{XiXi+1+Xi+1Xi})+i=1(AiAi+2{XiXi+2+Xi+2Xi})] ={A1A1+2A2A2+A3A3}tI4t=4nIntI4t=4ntI4nt. Now, each mm blocks of Hij is a linear combination of Xis i.e., Hij=i=13ρiXi; ρi{1,1} therefore, HijHij=i=13XiXi±1ij3(XiXj+XjXi)=4tI4t. (2) Can be proven similarly. 

Example 2. Take X1=[1000001001000001],X2=[0110100110010110],X3=[0001010000101000].

Corollary 1. If there exist matrices Xi, i=1,2,3 of order 4t, tN satisfying conditions of Theorem 3, the matrices Xi, i=1,2,3 of order 8t, tN also exist.

Proof. Define new Xi as Xi[1111]Xi,i=1,2,3. 

Corollary 1. If there exist matrices Xi, i=1,2,3 of order 4t, tN satisfying conditions of Theorem 3, and there exists three Amicable Hadamard matrices of order r then there exist Xi matrices of order 4rt.

Proof. Let Hi, i=1,2,3 be Amicable Hadamard matrix of order r. Define new Xi as XiXiHi,i=1,2,3. 

Theorem 3. Let there exist (0,1,1)-matrices Xi,Yj; 0i2,1j2 of order 4t; tN such that
(i) X0X0=X2X2+Y2Y2=tI4t and X1X1+Y1Y1=2tI4t
(ii) X0Xi+XiX0=0=X0Yi+YiX0,i=1,2
(iii) XiYi=0=YiXi, i=1,2
(iv) XiYj+XjYi=0=YjXi+YiXj,1ij2
(v) XiXi+j+Yi+jYi=0=Xi+jXi+YiYi+j,i,j=1, i+j2.
Then we have, if there exist three pairwise commutative ±1 matrices Ai;0i2 of order n such that A0A0+2A1A1+A2A2=4nIn then there exists a block structured Hadamard matrix of order 4nt with Hadamard blocks of order 4t.

Proof. Proof is simillar to Theorem 1 and Theorem 2. Just take
H=A0X0+A1RX1+A1RY1+A2RX2+A2RY2

Example 3. From Example 1 take Xis and Yis and set X0=X0,X1=X1+X2,X2=X3,Y1=Y1+Y2,Y2=Y3 to get the desired result.

3. Conclusion

In this paper we have constructed block structured Hadamard matrices different from those of Sylvester and Agaian. Matrices Xis and Yis of Theorem 1 can be obtained from Goethals-Seidel array and its generalization. In this method block structured Hadamard matrix of order 4nt is constructed using the blocks of a set containing at the most 16 distinct Hadamard blocks of order t. (Here two Hadamard blocks Hi and Hj are considered to be distinct if Hi±Hj.) Matrices Ais can be found in the works of several authors specially in [4, 11, 12].
Matrices Xis and Yis of Theorem 2 can be obtained from Propus array and Propus type arrays. Seberry and Balonin have constructed required Ais matrices in abundance [8]. Methods of construction of these matrices are not proposed here. In this construction there are precisely four distinct Hadamard blocks viz. ±(X1+X2+X3), ±(X1X2+X3), ±(X1X2X3) and ±(X1+X2X3). If the matrices Ais are constructed from Turyn’s method then there are only three distinct Hadamard blocks viz. ±(X1+X2+X3), ±(X1X2+X3), ±(X1X2X3).
Theorem 3 is a product of the Theorems 1 and 2. In this construction number of distinct Hadamard blocks are 16. Efforts could be made to find a method to construct matrices Xis and Yis in general, which could result in some Hadamard matrices of new orders. Block structured Hadamard matrices may be used in nested group divisible (GD) designs as follows:
It is well known that replacing 1 by I2 and 1 by (JI)2 in a Hadamard matrix H of order 4nt we obtain a series of resolvable semi-regular GD designs with parameters (see Saurabh and Sinha [13]): v=b=mn=8nt,r=k=4nt,λ1=0,λ2=2nt,m=4nt,n=2.

Further since H contains Hadamard blocks each of order 4t, removing s rows of blocks of incidence matrix of 1 we obtain a series of GD designs with parameters: v=8t(ns),b=8nt,r=4nt,k=4t(ns),λ1=0,λ2=2nt,m=4t(ns),n=2;s<n.

Hence a GD design with parameters 2 is nested within a GD design with parameters 1. For details on GD designs we refer to Raghvarao and Padgett [14], Saurabh and Sinha [13] and Saurabh and Prasad [15].

Acknowledgment

The authors express their gratitude to Dr. Mithilesh Kumar Singh for his valuable suggestions on the presentation of this paper, as well as to the anonymous referees for their nice comments.

References:

  1. Sylvester, J.J., 1867. LX. Thoughts on inverse orthogonal matrices, simultaneous signsuccessions, and tessellated pavements in two or more colours, with applications to Newton’s rule, ornamental tile-work, and the theory of numbers. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, 34(232), pp.461-475.[Google Scholor]
  2. Agaian, S.S., 2006. Hadamard matrices and their applications (Vol. 1168). Springer-Verlag, Berlin Heidelberg, New York.[Google Scholor]
  3. Agaian, S.S., Sarukhanyan, H., Egiazarian, K. and Astola, J., 2011, August. Hadamard transforms. SPIE Press, Bellingham, Washington USA.[Google Scholor]
  4. Goethals, J.M. and Seidel, J.J., 1967. Orthogonal matrices with zero diagonal. Canadian Journal of Mathematics, 19, pp.1001-1010.[Google Scholor]
  5. Shen, S. and Zhang, X., 2023. Constructions of Goethals-Seidel Sequences by Using $k$-Partition. Mathematics, 11(2), p.294.[Google Scholor]
  6. Doković, D. Ž . and Kotsireas, I.S., 2018. Goethals-Seidel difference families with symmetric or skew base blocks. Mathematics in Computer Science, 12, pp.373-388.[Google Scholor]
  7. Xia, M., Xia, T., Seberry, J. and Wu, J., 2005. An infinite family of Goethals-Seidel arrays. Discrete Applied Mathematics, 145(3), pp.498-504.[Google Scholor]
  8. Seberry, J. and Balonin, N.A., 2015. The Propus Construction for Symmetric Hadamard Matrices. arXiv e-prints, pp.arXiv-1512.[Google Scholor]
  9. Geramita, A.V., 1979. Orthogonal design, quadratic forms and hadamard matrices. Lecture notes in pure and applied mathematics, 43.[Google Scholor]
  10. Hall, M., 1988. Combinatorial theory . Wiley- Interscience, 2nd edition.[Google Scholor]
  11. Seberry, J., 2017. Orthogonal designs. Hadamard matrices, quadratic forms and algebra. Springer International Publishing AG.[Google Scholor]
  12. Wallis, W.D., Street, A.P. and Wallis, J.S., 1972. Combinatorics: Room squares, sum-free sets, Hadamard matrices. Springer-Verlag, Berlin-Heidelberg, New York .[Google Scholor]
  13. Saurabh, S. and Sinha, K., 2023. Matrix approaches to constructions of group divisible designs. Bulletin of the ICA, 97, pp.83-105.[Google Scholor]
  14. Raghavarao, D. and Padgett, L.V., 2005. Block designs: analysis, combinatorics, and applications. Series on Applied Mathematics, 17, World Scientific, Singapore.[Google Scholor]
  15. Saurabh, S. and Prasad, D., 2023. Certain Incomplete Block Designs from Combinatorial Matrices. Journal of the Indian Society for Probability and Statistics, 24(2), pp.535-544.[Google Scholor]