Some matrices of Williamson type

Similar documents
Construction of Williamson type matrices

Some new constructions of orthogonal designs

Supplementary difference sets and optimal designs

An infinite family of skew weighing matrices

On integer matrices obeying certain matrix equations

A construction for orthogonal designs with three variables

An infinite family of Goethals-Seidel arrays

Constructing Hadamard matrices via orthogonal designs

Two infinite families of symmetric Hadamard matrices. Jennifer Seberry

Recent advances in the construction of Hadamard matrices

Semi Williamson type matrices and the W(2n, n) conjecture

Weighing matrices and their applications

Some New D-Optimal Designs

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

Hadamard ideals and Hadamard matrices with two circulant cores

Minimal and Maximal Critical Sets in Room Squares

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

Perfect Secret Sharing Schemes from Room Squares

On Good Matrices and Skew Hadamard Matrices

Complex Hadamard matrices

Higher dimensional orthogonal designs and Hadamard matrices

A note on orthogonal Graeco-Latin designs

Bose's method of differences applied to construct Bhaskar Rao designs

An infinite family of Goethals-Seidel arrays

A note on orthogonal designs

A REVIEW AND NEW SYMMETRIC CONFERENCE MATRICES

On Good Matrices and Skew Hadamard Matrices

Orthogonal designs: II

Inner Product Vectors for skew-hadamard Matrices

Generation of a frequency square orthogonal to a 10 x 10 Latin square

K. T. Arasu Jennifer Seberry y. Wright State University and University ofwollongong. Australia. In memory of Derek Breach.

Generalized Bhaskar Rao designs with elements from cyclic groups of even order

A Series of Regular Hadamard Matrices

A COMPOSITION THEOREM FOR GENERALIZED BHASKAR RAO DESIGNS. William Douglas Palmer

A Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly Regular Graphs

The maximal determinant and subdeterminants of ±1 matrices

Small Orders of Hadamard Matrices and Base Sequences

Some remarks on Hadamard matrices

Checkered Hadamard Matrices of Order 16

On the Amicability of Orthogonal Designs

On the multiplication theorems of Hadamard matrices of generalized quaternion type using M- structures

arxiv: v1 [math.co] 27 Jul 2015

Latin squares: critical sets and their lower bounds

Goethals Seidel difference families with symmetric or skew base blocks

New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function - a review

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

Cocyclic Hadamard matrices over Zt x Z~

New skew-hadamard matrices via computational algebra

EXHAUSTIVE DETERMINATION OF (511, 255, 127)-CYCLIC DIFFERENCE SETS

The amicable-kronecker construction of quaternion orthogonal designs

Square 2-designs/1. 1 Definition

New Infinite Families of Orthogonal Designs Constructed from Complementary Sequences

TREVOR HYDE AND JOSEPH KRAISLER

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

Additional Constructions to Solve the Generalized Russian Cards Problem using Combinatorial Designs

Linear Algebra and its Applications

Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices

Orthogonal arrays obtained by repeating-column difference matrices

There are no Barker arrays having more than two dimensions

(v, k, lambda)-configurations and Hadamard matrices

Construction of latin squares of prime order

AN INVERSE MATRIX OF AN UPPER TRIANGULAR MATRIX CAN BE LOWER TRIANGULAR

Back circulant Latin squares and the inuence of a set. L F Fitina, Jennifer Seberry and Ghulam R Chaudhry. Centre for Computer Security Research

On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer

Complex Hadamard matrices and 3-class association schemes

Hadamard matrices of order 32

AMICABLE MATRICES AND ORTHOGONAL DESIGNS. S M ERFANUL KABIR CHOWDHURY Master of Science, University of Chittagong, 2010

ON THE CONSTRUCTION OF HADAMARD MATRICES. P.K. Manjhi 1, Arjun Kumar 2. Vinoba Bhave University Hazaribag, INDIA

Orthogonal designs III: Weighing matrices

Comments on "Generating and Counting Binary Bent Sequences"

arxiv: v4 [math.co] 12 Feb 2017

Monogamous decompositions of complete bipartite graphs, symmetric H -squares, and self-orthogonal I-factorizations

Structures of cryptographic functions with strong avalanche characteristics

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

Hadamard matrices of order 32

The Impact of Number Theory and Computer Aided Mathematics on Solving the Hadamard Matrix Conjecture

COMMUTATIVE SEMIFIELDS OF ORDER 243 AND 3125

Hadamard ideals and Hadamard matrices with circulant core

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

A survey of orthogonal designs

Representations of disjoint unions of complete graphs

TRANSVERSALS OF LATIN SQUARES AND THEIR GENERALIZATIONS

Weaknesses in Hadamard Based Symmetric Key Encryption Schemes

The Multiplicities of a Dual-thin Q-polynomial Association Scheme

Some constructions of integral graphs

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

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

A classification of sharp tridiagonal pairs. Tatsuro Ito, Kazumasa Nomura, Paul Terwilliger

Algebraic aspects of Hadamard matrices

PARTITIONS OF GROUPS AND COMPLETE MAPPINGS

Lupe Latin squares of order odd, 3-odd, A 2 + 3B 2 with gcm(a, B) = 1

Positive definite preserving linear transformations on symmetric matrix spaces

Sets of MOLSs generated from a single Latin square

ON THE SOLVABILITY OF THE EQUATION Zr=i Xi/di s 0 (mod 1) AND ITS APPLICATION

University of Wollongong. Research Online

Hadamard matrices, difference sets and doubly transitive permutation groups

A REPRESENTATION THEORETIC APPROACH TO SYNCHRONIZING AUTOMATA

Complex Hadamard matrices and 3-class association schemes

Maximum exponent of boolean circulant matrices with constant number of nonzero entries in its generating vector


Transcription:

University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1973 Some matrices of Williamson type Jennifer Seberry University of Wollongong, jennie@uow.edu.au Publication Details Jennifer Seberry Wallis, Some matrices of Williamson type, Utilitas Mathematica, 4, (1973), 147-154. Research Online is the open access institutional repository for the University of Wollongong. For further information contact the UOW Library: research-pubs@uow.edu.au

Some matrices of Williamson type Abstract Recent advances in the construction of Hadamard matrices have depended on the existence of Baumert-Hall arrays and four (1,-1) matrices A, B, C, D of order m which are of Williamson type; that is, they pairwise satisfy (i) MN T = NM T, and (ii) AA T + BB T + CC T + DD T = 4mI m We show that if p = 1 (mod 4) is a prime power then such matrices exist for m = 1 / 2 p(p+1). The matrices constructed are not circulant and need not be symmetric. This means there are Hadamard matrices of order 2p(P+1)t and 10p(p+1)t for t E {1,3,5,...,59} u {1 + 2 a 10 b 26 c,a,b,c non-negative integers}, which is a new infinite family. Disciplines Physical Sciences and Mathematics Publication Details Jennifer Seberry Wallis, Some matrices of Williamson type, Utilitas Mathematica, 4, (1973), 147-154. This journal article is available at Research Online: http://ro.uow.edu.au/infopapers/947

SOME MATRICES OF WILLIAMSON TYPE Jennifer Seberry Wallis ABSTRACT. Recent advances in the construction of Hadamard matrices have depended on the existence of Baumert-Hall arrays and four (1.-1) matrices A. B. C. D of order m which are of Williamson type; that is. they pairwise satisfy (i) (ii) ~=~.~ AAT + BBT + CC T + DDT = 4mI m We show that if p 1 (mod 4) is a prime power then such matrices exist for m = ~(p+l). The matrices construeted are not circulant and need not be symmetric. This means there are Hadamard matrices of order 2p(P+l)t and lop(p+l)t for t {1.3.5..,59} u {I + 2 a lo b 26 c.a,b,c non-negative integers} which is a new infinite family. 1. Introduction. We wish to form four (1.-1) matrices A, B, C, D of order m which pairwise satisfy (1) and (i) 4mI m Williamson first used such matrices and we call them Williamson type. The matrices Williamson originally used were both circulant and symmetric but we will show that neither the circulant nor symmetric properties are necessary in order to satisfy (1). This paper was prepared while the author was visiting the Department of Computer Science. University of Manitoba, Canada. UTILITAS MATHEMATICA, Vol. 4 (1973), pp. 147-154.

Goethals and Seidel II] found two (1,-1) matrices I+R, S of order ~(p+l), p = 1 (mod 4) a prime power, which are circulant and symmetric and which satisfy where I is the identity matrix. Turyn [2] noted that A I+R, B = I-R, C = D = S satisfy the conditions (1) for m = ~(p+l) and hence are Williamson matrices. Whiteman [5] provided an alternate construction for A, B, C, D of these orders. We are going to generalize the matrices of the following example: Let J, X, Y be of order 5, J the matrix of alii's and suppose XJ = -YJ = -J, xyt = YXT, XXT + yyt = 121-2J. Consider A = [~ ~ :], B = [_: -: ~:], C = [~ : :], D = [-: -: ~:J ' X X J -X -x X y Y J -Y -Y Y and note that A, B, C, D satisfy (1). We use the following theorem (see Section 2 for definitions): THEOREM 1. (Baumert and Hall, see [4]). If there are Williamson type matrices, of order m and a Baumert-Hall array of order t then there exists a Hadamard matrix of order 4mt Turyn has announced [3] that he has found Baumert-Hall arrays for the orders t and 5t (2) t {1,3,5,..,59} u {I + 2 a lo b 26 c, a,h,c non-negative integers}. Some Baumert-Hall arrays found by Cooper and Wallis may be found in [4]. 148

2. Basic Definitions. A matrix with every entry +1 or -1 is called a (1,-1) matrix. An Hadamard matrix H = (h.. ) is a square (1,-1) matrix of ~J order n which satisfies the equation ni n We use J for the matrix of alii's. A Baumert-HaZZ array of order t is a 4t x 4t array with entries A, -A, B. -B, C, -C. D. -D and the properties that: (i) in any row there are exactly t entries ±A, t entries ±B. t entries ±C. and t entries ±D ; and similarly for the columns (ii) the rows are formally orthogonal. in the sense that if ta. ±B. ±C. ±D are realized as elements of any commutative ring then the distinct rows of the array are pairwise orthogonal; and similarly for the columns. The Baumert-Hall arrays are a generalization of the following array of Williamson: A B C Dl B A -D C r -C D A-13 -D -C B A Let 51' 52'.. 5 n be subsets of V. an additive abelian group of order v. containing k 1 k 2... k n elements respectively. Write Ti for the totality of all differences between elements of 5 i (with repetitions), and T for the totality of elements of all the T If T contains each non-zero element a fixed number of times. i A say. then the sets 51' 52'.. 5 ' will be called n 149

n - {V; k 1 k Z ' k n ; A} suppzementary difference sets. Henceforth we assume V is always an additive abelian group of order v with elements v The type 1 (1. -1) incidence matrix M = (m.. ) of order ~J of a subset X of V is defined by m.. 1+1 gj - gi E X ~J -1 otherwise, while the type Z O. -1) incidence matrix N (n ij ) of order v of a subset Y of V is defined by n ij r1 gj + gi E Y -1 otherwise. It is shown in [4J that if M is a type 1 (1, -1) incidence matrix and N is a type Z (1, -1) incidence matrix of Z - {Zq-l; q-l,q; q-l} supplementary difference sets then and MN T = ml (3) Mll + NN T = 4qI - ZJ If H were type 1 (3) would still be satisfied. 150

3. The Construction. THEOREM 2. Suppose there exist (1,-1) matrices I+R,S cf order q which satisfy I + RRT + SST = 2ql, RT = R, ST = S, RS SR and 2 - {2q-1; q-1, q; q-1} supplementary difference sets with incidence matrices X,Y which satisfy xyt = yxt. Then A = IxJ + RxX B Sxx C IxJ + RxY D SxY are four Williamson type matrices of order q(2q-1). Proof. Choose X and Y to be both type 1(1,-1) incidence matrices if the condition xyt = YXT can be satisfied;otherwise choose X to be a type 1 (1,-1) incidence matrix and Y to be a type 2 (1,-1) incidence matrix. Then xyt = YXT (see [4; p.288]) By lemma 1.20 of [4;p.291] 4qI-2J, and from the size of the two supplementary difference sets XJ -J -YJ and That A, B, C, D pairwise satisfy MN T NM T is easily verified Ix(2q-1)J + FTxJXT + RxXJ + SSTxXX T + RRTXXX T +Ix(2q-1)J + RTxJY T + RxYJ + SSTXyyT + RRTxyyT 2Ix(2q-1)J + (SST + RRT) x (4qI-2J) 4q(2q-1)I, 151

as required. Now we note that there exist 2 - {2q-l; q-l, q; q-l} supplementary difference sets for (i) (ii) 2q-l 4q-l a prime power; 14;p. 283], a prime power; Szekeres, 14;p.303], (iii) 2q-l 2q the order of a symmetric conference matrix, see 14], and that R,S exist 14;p.39l] for orders q for which 2q-l is a prime power = 1 (mod 4). Thus we have COROLLARY 3. Let 2q-l = p be a, prime power _ 1 (mod 4) ; then there exist four Williamson type matrices A, B, C, D of order y,p(p+l). COROLLARY 4. Let p = 1 (mod 4) be a prime power; then using theorem 1, there is a Hadamard matrix of order 2p(p+l)t and lop (p+l)t where t is given by (2). We note that the matrices constructed in corollary 3 are all symmetric but not circulant. matrices are circulant and some are not symmetric. In the following construction, none of the LEMMA 5. Let p = 5 (mod 8) be a prime power then there exist Williamson type matrices A, B, C, D of order y,p(p+l) which pairwise satisfy MN T = NM T for which T T T T AA + BB + CC + DD = 2p(p+l)Iy,p(p+l)' but whiah are neither circulant nor symmetria. Proof. We use a construction of Szekeres 14;p.32l]. Let x be a primitive root of GF(p) and consider the cyclotomic classes of p = 4f+l (f odd) defined by {x 4j +i j 0,1,., f-l} i 0,1,2,3 152

Then are Z - {4f+1; Zf, Zf+1; Zf} supplementary difference sets for which (since -1 E C Z ) a E Co U C 1 ~-a Co U C 1 and b E {o} U C 1 U C z ~ -b {o} U C 1 U C Z ' b~o We form the type 1 (1,-1) incidence matrix, X, of Co U C 1 and the type Z (1,-1) incidence matrix, Y, of {O} U C 1 U C Z Then (X+1)T. = -(X+1), yt = y, XJ = -J -YJ xx T + yyt = Z(4f+Z)I-ZJ, and xyt yxt We now proceed as in theorem Z noting that A and B are not symmetric. 153

REFERENCES [1] J.M. Goethals and J.J. Seidel, Orthogonal matrices with zero diagonal, Canad. J. Math. 19 (1967), 1001-1010. [2] Richard J. Turyn, An infinite class of Williamson matrices, J. Combinatorial Th. 12 (1972), 319-321. [3] Richard J. Turyn, Computation of certain Hadamard matrices, Notices of Amer. Math. Soc. 20 (1973), A-I. [4] W.D. Wallis, Anne Penfold Street, Jennifer Seberry Wallis, Combinatorics: Room Squares, Sum-free Sets, Hadamard Matrices, Lecture Notes in Mathematics, Vol. 292, Springer-Verlag, Berlin-Heidelberg-New York, 1972. [5] Albert Leon Whiteman, An infinite family of Hadamard matrices of Williamson type, J. Combinatorial Th. (to appear). Institute of Advanced Studies Australian National University Canberra Australia Received February 15, 1973. 154