A construction for orthogonal designs with three variables

Size: px
Start display at page:

Download "A construction for orthogonal designs with three variables"

Transcription

1 University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1987 A construction for orthogonal designs with three variables Jennifer Seberry University of Wollongong, jennie@uow.edu.au Publication Details Seberry, J, A construction for orthogonal designs with three variables, Combinatorial Design Theory, (C.J. Colbourne and R.A. Mathon, (Eds)), North Holland, 1987, 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

2 A construction for orthogonal designs with three variables Abstract We show how orthogonal designs OD(48p²t;16p²t, 16p²t,16p²t) can be constructed from an Hadamard matrix of order 4p and an OD(4t;t,t,t,t). This allows us to assert that OD(48p²t; 16p²t,16p²t,16p²t) exist for all t,p 102 except possibly for tє{67,71,73,77,79,83,86,89,91,97}. These designs are new. Disciplines Physical Sciences and Mathematics Publication Details Seberry, J, A construction for orthogonal designs with three variables, Combinatorial Design Theory, (C.J. Colbourne and R.A. Mathon, (Eds)), North Holland, 1987, This journal article is available at Research Online:

3 Annals of Discrete Mathematics 34 (1987) Elsevier Science Publishers B.V. (North Holland) 437 A Construction for Orthogonal Designs with Three Variables Jennifer Seberry Department of Computer Science University College The University of New South Wales Australian Defence Forces Academy Canberra, A.C.T AUSTRALIA TO J.u:r ROSJ. 0)1 JUS l1truth BIR. TJlOJ.Y ABSTRACT We show how orthogonal designs OD(4Sp Z t;16p Z t, 16p 2 t,16p 2 t) can be constructed from an Hadamard matrix of order 4p and an OD~4tjt,t,t,t). This allows us to assert that OD{4Sp 2 tj 16p t,16p2t,16p2t) exist ror all t,p:::; 102 except possibly for te{67,71,73,77,7q,83,86,sq,q1,q7}. These designs are new. 1. Introduction Let H = (h jj ) be a matrix of order h with h ij E{l,-I}. H is called an Hadamard matrix of order n, if HHT '"" hlh where Ih denotes the identity matrix order of h. An orthogonal design A, of order H, type (P"P2"",p,..), denoted OD(njp"pz,...,Pu), on the commuting variables (±x,,±xv '",±Xu,O) is a square matrix of order 11 with entries ±xk where each Xk occur Pk times in each row and column such that the rows are pairwise orthogonal. In other words AA T,.,. (PIX? Pux~)I". It is known that the maximum number of variables is an orthogonal design is p(n), the' Radon number, where for n=z'b,b odd, set a=4c+d,o:::;d<4, then p(n)=sc +2d. OD(4tjt,t,t,t), otherwise called Baumert-Hall arrays, and OD(2 P ja,b,2 P -a-b) have been extensively used to construct Hadamard matrices and weighing matrices. For details see Geramita. and Seberry (HI7Q).

4 438 J. &berry Geramita, Geramita and Wallis (=Seberry) observed (see Geramlta and Sebcrry [HI79, 4.3]) that if A,B,C,D are four circulant or type 1 matrices of order n satisfying AAT + BBT + CC T + DDT = (~ Pix;) In i_i then A,B,C,D can be used in the Goethals-Seidel array or ( J. Seberry Wallis Whiteman array) A BR CR -DR -BR A DTR -etr CR _DTR A BTR (1). DR CTR _BTR A to form an orthogonal design OD(4niPt,pz,""Pu)' 2. Background Kharaghani (UI85) defined Ot '""!hij.hkj[ and applying that to Hadamard matrices of order 4p, obtruned matrices satisfying CjCj=O,i+i (2). :E Cl-(4p)214p' He then used this to show there are Bush-type (blocks J4p down the diagonal) and Szekeres-type (h ij = -1 =} h jj - 1 and not necessarily vice versa) Hadamard matrices. By using a symmetric Latin square he could also have shown that regular symmetric Hadamard matrices with constant diagonal of order (4p)2 could be constructed by his method. Hammer, Sal"Vate and Seberry applied Kharaghani's method to OD(n;sl"..,.'I ) and in particular OD(4t;t,t,t,t) and OD4s;s,s,s,s) obtaining existence of OD(48s~t t, t, t, 12s2t) and OD(808 2 t; 20s 2 t, 2Os 2 t, t, 2Os 2 t) from OD(4s;s,s,s,s) and OD(4t;t,t,t,t). Seberry (to appear) extended this further to obtain OD(16k8 2 t ;4ks 2 t,4k8 2 t,4ks 2 t,4k8 2 t) for {1,3,5,... }. We modify their techniques to obtain new orthogonal designs. 3. Construction Let G l, O 2,.,G4p be the Kharaghani matrices of order 4p obtained from an orthogonal design OD(4p;p,p,p,p). Let a,b,c be commuting variables and write [aol: ac2:,, :aop : bcp+l :... :bc2p : cc2p+l:.. :cc3p l [ac 3P +l:,,:ag 4p : ccp+ 1 :.. :cc2p : b02p+l:... :bg3p]

5 OrthogOMI De8igns with Three Variables.39 for the first rows of two block circulant matrices WI and W z. It can be checked that w 1 wf = wzwi. Write [ac2p+1: :acap: bc1: :bcp : ccap+1: :CC4"J [ac"+i:.. :ac2p : bci: bc,,: bc3p+ 1 : bc 4 "J for the first rows of two block bru:k-circulant matrices Wa and W 4 It can be checked that wawf = w 4 wf. Now by virtue of being circulant and bru:k-circulant Example. Let p = ie(i,2), je(3,.). 3 so there are 12 matrices of order 12, C1>...,C I2. Then WI = aclac2ac3bc4bcsbcscc7ccgccg acaaclaczbcsbc4bcsccgcc7ccg ac2acaaclbcsbcsbc4ccgcc9cc7 CC7cCgcCgaOlaC2aCabC4bCsbCs cog C07 cgg a03 aoi ao z b0 6 b0 4 bos cog cog c07 ao z ac a ao l bo s b0 6 b0 4 b04bosbcsc07cogcc9aolaczaoa bcsb04boscc9c07cosaoaaola02 bcsbosb04cggcg9cc7aozagaaol W 2 = aoio ag ll ac I2 cc 4 cos cc s b0 7 bog bog acl2 aoio aoll C06 cc 4 cos bog b07 bcg ac ll aol2 ac IO cc s cos cc 4 bog bog b0 7 bg 7 bgg bcg agio aoll aol2 C04 cos cos bg g bc 7 bcg ac I2 acio ag ll cc s cc 4 cgs bog bog bc7 ac ll aolz ac IO cos ccs c04 C04 ccs cos b0 7 bog bog aoio oc ll aol2 cos c0 4 cos bcg bc 7 bog agio ac ll ccs ccs cc4 bcs bcg bc7 aoll aol2 acio wlwf=iq Xbc t C;eT ;_4 but OJ Or is symmetric and so WI wf = W2 wi. Wa and W 4 are formed similarly but are back-circulant in blocks (i.e., type 2) in the language of Seberry-Wallis and Whiteman). Thus WI' W 2, Wa, W( are VVilJiamson-type matrices of order 12p2 they can be used to replace the variables of an OD(4i1,1,1,1) to get an OD(48p2; 16p2, 16p2, 16p2, 16p2). In general they can be used to replace the variables of an OD(4tit,t,t,t) so we have

6 440 J. Seberry Theorem: If there is an Hadamard matrix of order 4p and an OD(4tjt,t,t,t) then there is an OD(48p2tj16p2t,16p2t,16p2t,16p2t). Since Hadamard matrices of order 4p exist for all p ::s: 102 and OD(4tjt,t,t,t) exist for all t $102 except possibly for tes, S={67,71,73,77,79,83,86,S9,91,97} (see Sebefry (HIS6a)) we have Corollary; OD{48p2tj16p2t,16p2t,16p2t,16,.h) exist for all t,p $102 except pobsibly fot t ES. Acknowledgement The author's research is supported in part by grants from ACRB and ATERB. References [1] J. Cooper and J. Seberry Wallis, "A construction of Hadamard arrays", Bull. Austral Math. Soc., 7 (1972) [2J A.V. Geramita and J. Seberry, Orthogonal Designs: Quadratic Forms and Hadamard Matrices Marcel Dekker, New York-Basel (198B). [3] J. Hammer, D.G. Sarvate, J. Seberry, "A note on orthogonal designs", Ars Combinatoria, submitted. [4J H. Kharagani, "New class of weighing matrices", Ars Combinatorica, Vol. 19, pp [5J J. Seberry, "More towards proving the Hadamard conjecture", (preprint). [6] J. Seberry-Wallis, "Hadamard matrices, Part IV of W.D. Wallis, A. P. Street, and J. Seberry-Wallis", Combinatorics: IWorn Square, sum free sets and Hadamard matriees, Lecture Notes in Mathematics, Vol. 292, Springer-Verlag, Berlin Heidelberg New York.

Some matrices of Williamson type

Some matrices of Williamson type 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,

More information

A note on orthogonal designs

A note on orthogonal designs University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1987 A note on orthogonal designs J Hammer D G. Sarvate Jennifer Seberry

More information

Some new constructions of orthogonal designs

Some new constructions of orthogonal designs University of Wollongong Research Online Faculty of Engineering and Information Sciences - Papers: Part A Faculty of Engineering and Information Sciences 2013 Some new constructions of orthogonal designs

More information

An infinite family of skew weighing matrices

An infinite family of skew weighing matrices University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1976 An infinite family of skew weighing matrices Peter Eades Jennifer

More information

Supplementary difference sets and optimal designs

Supplementary difference sets and optimal designs University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1991 Supplementary difference sets and optimal designs Christos Koukouvinos

More information

Weighing matrices and their applications

Weighing matrices and their applications University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1997 Weighing matrices and their applications Christos Koukouvinos Jennifer

More information

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

On small defining sets for some SBIBD(4t-1, 2t-1, t-1) University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 992 On small defining sets for some SBIBD(4t-, 2t-, t-) Jennifer Seberry

More information

On integer matrices obeying certain matrix equations

On integer matrices obeying certain matrix equations University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1972 On integer matrices obeying certain matrix equations Jennifer Seberry

More information

Constructing Hadamard matrices via orthogonal designs

Constructing Hadamard matrices via orthogonal designs University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1987 Constructing Hadamard matrices via orthogonal designs Jennifer Seberry

More information

An infinite family of Goethals-Seidel arrays

An infinite family of Goethals-Seidel arrays University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 2005 An infinite family of Goethals-Seidel arrays M. Xia Central China

More information

Two infinite families of symmetric Hadamard matrices. Jennifer Seberry

Two infinite families of symmetric Hadamard matrices. Jennifer Seberry AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 69(3) (2017), Pages 349 357 Two infinite families of symmetric Hadamard matrices Jennifer Seberry Centre for Computer Security Research School of Computing

More information

Minimal and Maximal Critical Sets in Room Squares

Minimal and Maximal Critical Sets in Room Squares University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1996 Minimal and Maximal Critical Sets in Room Squares Ghulam Rasool Chaudhry

More information

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

Bose's method of differences applied to construct Bhaskar Rao designs University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1998 Bose's method of differences applied to construct Bhaskar Rao designs

More information

Construction of Williamson type matrices

Construction of Williamson type matrices University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1975 Construction of Williamson type matrices Jennifer Seberry University

More information

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

Semi Williamson type matrices and the W(2n, n) conjecture University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1992 Semi Williamson type matrices and the W(2n, n) conjecture Jennifer

More information

Orthogonal designs: II

Orthogonal designs: II University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1975 Orthogonal designs: II Anthony V. Geramita Jennifer Seberry University

More information

Hadamard ideals and Hadamard matrices with two circulant cores

Hadamard ideals and Hadamard matrices with two circulant cores Hadamard ideals and Hadamard matrices with two circulant cores Ilias S. Kotsireas a,1,, Christos Koukouvinos b and Jennifer Seberry c a Wilfrid Laurier University, Department of Physics and Computer Science,

More information

On Good Matrices and Skew Hadamard Matrices

On Good Matrices and Skew Hadamard Matrices On Good Matrices and Skew Hadamard Matrices Gene Awyzio and Jennifer Seberry Dedicated to Hadi Kharighani on his 70th Birthday n her PhD thesis (Seberry) Wallis described a method using a variation of

More information

On Good Matrices and Skew Hadamard Matrices

On Good Matrices and Skew Hadamard Matrices On Good Matrices and Skew Hadamard Matrices Gene Awyzio and Jennifer Seberry Dedicated to Hadi Kharighani on his 0th Birthday n her PhD thesis (Seberry) Wallis described a method using a variation of the

More information

Inner Product Vectors for skew-hadamard Matrices

Inner Product Vectors for skew-hadamard Matrices Inner Product Vectors for skew-hadamard Matrices Ilias S. Kotsireas and Jennifer Seberry and Yustina S. Suharini Dedicated to Hadi Kharaghani on his 70th birthday Abstract Algorithms to find new orders

More information

On the Amicability of Orthogonal Designs

On the Amicability of Orthogonal Designs On the Amicability of Orthogonal Designs W. H. Holzmann and H. Kharaghani Department of Mathematics & Computer Science University of Lethbridge Lethbridge, Alberta, T1K 3M4 Canada email: holzmann@uleth.ca,

More information

Perfect Secret Sharing Schemes from Room Squares

Perfect Secret Sharing Schemes from Room Squares University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1998 Perfect Secret Sharing Schemes from Room Squares G. R. Chaudhry University

More information

A REVIEW AND NEW SYMMETRIC CONFERENCE MATRICES

A REVIEW AND NEW SYMMETRIC CONFERENCE MATRICES UDC 004438 A REVIEW AND NEW SYMMETRIC CONFERENCE MATRICES N A Balonin a, Dr Sc, Tech, Professor, korbendfs@mailru Jennifer Seberry b, PhD, Foundation Professor, jennifer_seberry@uoweduau a Saint-Petersburg

More information

Higher dimensional orthogonal designs and Hadamard matrices

Higher dimensional orthogonal designs and Hadamard matrices University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1981 Higher dimensional orthogonal designs and Hadamard matrices Joseph

More information

The amicable-kronecker construction of quaternion orthogonal designs

The amicable-kronecker construction of quaternion orthogonal designs University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 2011 The amicable-kronecker construction of quaternion orthogonal designs

More information

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

New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function - a review University of Wollongong Research Online Faculty of Informatics - Paers (Archive) Faculty of Engineering and Information Sciences 1999 New weighing matrices and orthogonal designs constructed using two

More information

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

Generation of a frequency square orthogonal to a 10 x 10 Latin square University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1978 Generation of a frequency square orthogonal to a 10 x 10 Latin square

More information

New Infinite Families of Orthogonal Designs Constructed from Complementary Sequences

New Infinite Families of Orthogonal Designs Constructed from Complementary Sequences International Mathematical Forum, 5, 2010, no. 54, 2655-2665 New Infinite Families of Orthogonal Designs Constructed from Complementary Sequences Christos Koukouvinos Department of Mathematics National

More information

A note on orthogonal Graeco-Latin designs

A note on orthogonal Graeco-Latin designs University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1979 A note on orthogonal Graeco-Latin designs Jennifer Seberry University

More information

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

A Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly Regular Graphs Journal of Combinatorial Theory, Series A 98, 118 126 (2002) doi:10.1006/jcta.2001.3231, available online at http://www.idealibrary.com on A Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly

More information

New skew-hadamard matrices via computational algebra

New skew-hadamard matrices via computational algebra AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 41 (2008), Pages 235 248 New skew-hadamard matrices via computational algebra I.S. Kotsireas Wilfrid Laurier University Department of Physics and Computer Science

More information

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

3-Class Association Schemes and Hadamard Matrices of a Certain Block Form Europ J Combinatorics (1998) 19, 943 951 Article No ej980251 3-Class Association Schemes and Hadamard Matrices of a Certain Block Form R W GOLDBACH AND H L CLAASEN We describe 3-class association schemes

More information

Small Orders of Hadamard Matrices and Base Sequences

Small Orders of Hadamard Matrices and Base Sequences International Mathematical Forum, Vol. 6, 2011, no. 62, 3061-3067 Small Orders of Hadamard Matrices and Base Sequences Dragomir Ž. D oković Department of Pure Mathematics and Institute for Quantum Computing

More information

Some remarks on Hadamard matrices

Some remarks on Hadamard matrices University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 2010 Some remarks on Hadamard matrices Jennifer Seberry University of

More information

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

K. T. Arasu Jennifer Seberry y. Wright State University and University ofwollongong. Australia. In memory of Derek Breach. On Circulant Weighing Matrices K. T. Arasu Jennifer Seberry y Department of Mathematics and Statistics Department of Computer Science Wright State University and University ofwollongong Dayton, Ohio{45435

More information

An infinite family of Goethals-Seidel arrays

An infinite family of Goethals-Seidel arrays An infinite family of Goethals-Seidel arrays Mingyuan Xia Department of Mathematics, Central China Normal University, Wuhan, Hubei 430079, China Email: xiamy@ccnu.edu.cn Tianbing Xia, Jennifer Seberry

More information

Some New D-Optimal Designs

Some New D-Optimal Designs Some New D-Optimal Designs Dragomir Z. f) okovic* Department of Pure Mathematics University of Waterloo Waterloo, Ontario N2L 301 Canada E-mail: dragomir@herod.uwaterloo.ca Abstract We construct several

More information

The maximal determinant and subdeterminants of ±1 matrices

The maximal determinant and subdeterminants of ±1 matrices Linear Algebra and its Applications 373 (2003) 297 310 www.elsevier.com/locate/laa The maximal determinant and subdeterminants of ±1 matrices Jennifer Seberry a,, Tianbing Xia a, Christos Koukouvinos b,

More information

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

On the multiplication theorems of Hadamard matrices of generalized quaternion type using M- structures University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1993 On the multiplication theorems of Hadamard matrices of generalized

More information

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

Generalized Bhaskar Rao designs with elements from cyclic groups of even order University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1991 Generalized Bhaskar Rao designs with elements from cyclic groups

More information

Linear Algebra and its Applications

Linear Algebra and its Applications Linear Algebra and its Applications 436 (2012) 2054 2066 Contents lists available at SciVerse ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa An eigenvalue

More information

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

A COMPOSITION THEOREM FOR GENERALIZED BHASKAR RAO DESIGNS. William Douglas Palmer A COMPOSITION THEOREM FOR GENERALIZED BHASKAR RAO DESIGNS William Douglas Palmer The School of Mathematics and Statistics and The School of Teaching and Curriculum Studies The University of Sydney Abstract:

More information

Checkered Hadamard Matrices of Order 16

Checkered Hadamard Matrices of Order 16 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

More information

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

On small defining sets for some SBIBD(4t - 1, 2t - 1, t - 1) University f Wllngng Research Online Faculty f Infrmatics - Papers (Archive) Faculty f Engineering and Infrmatin Sciences 992 On small defining sets fr sme SBIBD(4t -, 2t -, t - ) Jennifer Seberry University

More information

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

Tilburg University. Strongly Regular Graphs with Maximal Energy Haemers, W. H. Publication date: Link to publication Tilburg University Strongly Regular Graphs with Maximal Energy Haemers, W. H. Publication date: 2007 Link to publication Citation for published version (APA): Haemers, W. H. (2007). Strongly Regular Graphs

More information

Sets of MOLSs generated from a single Latin square

Sets of MOLSs generated from a single Latin square Sets of MOLSs generated from a single Latin square Hau Chan and Dinesh G Sarvate Abstract The aim of this note is to present an observation on the families of square matrices generated by repeated application

More information

Comments on "Generating and Counting Binary Bent Sequences"

Comments on Generating and Counting Binary Bent Sequences University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1994 Comments on "Generating and Counting Binary Bent Sequences" Claude

More information

Hamilton Cycles in Digraphs of Unitary Matrices

Hamilton Cycles in Digraphs of Unitary Matrices Hamilton Cycles in Digraphs of Unitary Matrices G. Gutin A. Rafiey S. Severini A. Yeo Abstract A set S V is called an q + -set (q -set, respectively) if S has at least two vertices and, for every u S,

More information

A Series of Regular Hadamard Matrices

A Series of Regular Hadamard Matrices A Series of Regular Hadamard Matrices Dean Crnković Abstract Let p and p 1 be prime powers and p 3 (mod 4). Then there exists a symmetric design with parameters (4p,p p,p p). Thus there exists a regular

More information

On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer

On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer Europ. J. Combinatorics (1983) 4,215-220 On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer P. FRANKL AND A. M. ODLYZKO If m(n, I) denotes the maximum number of subsets of an n-element

More information

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

Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices Roderick J. Fletcher 8460 Greystone Ln. Apt. 2F Columbia, Maryland 21045, USA Marc Gysin

More information

Latin squares: critical sets and their lower bounds

Latin squares: critical sets and their lower bounds University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1995 Latin squares: critical sets and their lower bounds Diane Donovan

More information

Complex Hadamard matrices

Complex Hadamard matrices University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1973 Complex Hadamard matrices Jennifer Seberry University of Wollongong,

More information

The Amicable-Kronecker Construction of Quaternion Orthogonal Designs

The Amicable-Kronecker Construction of Quaternion Orthogonal Designs 1 The Amicable-Kronecker Construction of Quaternion Orthogonal Designs Jennifer Seberry and Sarah Spence Adams Abstract Recently, quaternion orthogonal designs (QODs) were introduced as a mathematical

More information

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

SOME SYMMETRIC (47,23,11) DESIGNS. Dean Crnković and Sanja Rukavina Faculty of Philosophy, Rijeka, Croatia GLASNIK MATEMATIČKI Vol. 38(58)(2003), 1 9 SOME SYMMETRIC (47,23,11) DESIGNS Dean Crnković and Sanja Rukavina Faculty of Philosophy, Rijeka, Croatia Abstract. Up to isomorphism there are precisely fifty-four

More information

A survey of orthogonal designs

A survey of orthogonal designs University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1974 A survey of orthogonal designs Anthony V. Geramita Jennifer Seberry

More information

Trades in complex Hadamard matrices

Trades in complex Hadamard matrices Trades in complex Hadamard matrices Padraig Ó Catháin Ian M. Wanless School of Mathematical Sciences, Monash University, VIC 3800, Australia. February 9, 2015 Abstract A trade in a complex Hadamard matrix

More information

A NEW CLASS OF NESTED (NEARLY) ORTHOGONAL LATIN HYPERCUBE DESIGNS

A NEW CLASS OF NESTED (NEARLY) ORTHOGONAL LATIN HYPERCUBE DESIGNS Statistica Sinica 26 (2016), 1249-1267 doi:http://dx.doi.org/10.5705/ss.2014.029 A NEW CLASS OF NESTED (NEARLY) ORTHOGONAL LATIN HYPERCUBE DESIGNS Xue Yang 1,2, Jian-Feng Yang 2, Dennis K. J. Lin 3 and

More information

New constructions for Hadamard matrices

New constructions for Hadamard matrices New constructions for Hadamard matrices Paul Leopardi Mathematical Sciences Institute, Australian National University. For presentation at University of Newcastle. 26 April 2012 Introduction Acknowledgements

More information

Recent advances in the construction of Hadamard matrices

Recent advances in the construction of Hadamard matrices University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1973 Recent advances in the construction of Hadamard matrices Jennifer

More information

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

Perfect Secret Sharing Schemes from Room. Squares. Ghulam-Rasool Chaudhry. Centre for Computer Security Research. University of Wollongong Perfect Secret Sharing Schemes from Room Squares Ghulam-Rasool Chaudhry Hossein Ghodosi Jennifer Seberry Department of Computer Science Centre for Computer Security Research University of Wollongong Wollongong,

More information

Hadamard ideals and Hadamard matrices with circulant core

Hadamard ideals and Hadamard matrices with circulant core Hadamard ideals and Hadamard matrices with circulant core Ilias S. Kotsireas a,1,, Christos Koukouvinos b and Jennifer Seberry c a Wilfrid Laurier University, Department of Physics and Computer Science,

More information

Goethals Seidel difference families with symmetric or skew base blocks

Goethals Seidel difference families with symmetric or skew base blocks Goethals Seidel difference families with symmetric or skew base blocks Dragomir Ž. Doković1, Ilias S. Kotsireas 2 arxiv:1802.00556v1 [math.co] 2 Feb 2018 Abstract We single out a class of difference families

More information

New Bounds For Pairwise Orthogonal Diagonal Latin Squares

New Bounds For Pairwise Orthogonal Diagonal Latin Squares New Bounds For Pairwise Orthogonal Diagonal Latin Squares B.Du Department of Mathematics, Suzhou University Suzhou 215006 China (PRC) Abstract A diagonal Latin square is a Latin square whose main diagonal

More information

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

Hadamard matrices and strongly regular graphs with the 3-e.c. adjacency property Hadamard matrices and strongly regular graphs with the 3-e.c. adjacency property Anthony Bonato Department of Mathematics, Wilfrid Laurier University, Waterloo, Ontario, Canada, N2L 3C5 abonato@wlu.ca

More information

New extremal binary self-dual codes of length 68 via the short Kharaghani array over F 2 +uf 2

New extremal binary self-dual codes of length 68 via the short Kharaghani array over F 2 +uf 2 MATHEMATICAL COMMUNICATIONS 121 Math. Commun. 22(2017), 121 131 New extremal binary self-dual codes of length 68 via the short Kharaghani array over F 2 +uf 2 Abidin Kaya Department of Computer Engineering,

More information

Block Weighing Matrices

Block Weighing Matrices Block Weighing Matrices K. T. Arasu Simone Severini Edmund Velten March 25, 2013 Abstract We define a special type of weighing matrix called block weighing matrices. Motivated by questions arising in the

More information

Structures of cryptographic functions with strong avalanche characteristics

Structures of cryptographic functions with strong avalanche characteristics University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1995 Structures of cryptographic functions with strong avalanche characteristics

More information

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

The Impact of Number Theory and Computer Aided Mathematics on Solving the Hadamard Matrix Conjecture The Impact of Number Theory and Computer Aided Mathematics on Solving the Hadamard Matrix Conjecture Jennifer Seberry Centre for Computer and Information Security Research, SCSSE, University of Wollongong,

More information

Lecture 3: Matrix and Matrix Operations

Lecture 3: Matrix and Matrix Operations Lecture 3: Matrix and Matrix Operations Representation, row vector, column vector, element of a matrix. Examples of matrix representations Tables and spreadsheets Scalar-Matrix operation: Scaling a matrix

More information

On unit weighing matrices with small weight

On unit weighing matrices with small weight On unit weighing matrices with small weight arxiv:1209.4581v2 [math.co] 10 Dec 2012 Darcy Best, Hadi Kharaghani, Hugh Ramp Department of Mathematics & Computer Science University of Lethbridge Lethbridge,

More information

Generalized Hadamard matrices and colourable designs in the construction of regular GDDs with two and three association classes

Generalized Hadamard matrices and colourable designs in the construction of regular GDDs with two and three association classes University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1987 Generalized Hadamard matrices and colourable designs in the construction

More information

Linear Algebra (Review) Volker Tresp 2017

Linear Algebra (Review) Volker Tresp 2017 Linear Algebra (Review) Volker Tresp 2017 1 Vectors k is a scalar (a number) c is a column vector. Thus in two dimensions, c = ( c1 c 2 ) (Advanced: More precisely, a vector is defined in a vector space.

More information

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

New duality operator for complex circulant matrices and a conjecture of Ryser New duality operator for complex circulant matrices and a conjecture of Ryser Luis H. Gallardo Mathematics University of Brest Brest, France Luis.Gallardo@univ-brest.fr Submitted: May 6, 2015; Accepted:

More information

arxiv: v1 [math.co] 27 Jul 2015

arxiv: v1 [math.co] 27 Jul 2015 Perfect Graeco-Latin balanced incomplete block designs and related designs arxiv:1507.07336v1 [math.co] 27 Jul 2015 Sunanda Bagchi Theoretical Statistics and Mathematics Unit Indian Statistical Institute

More information

Orthogonal designs III: Weighing matrices

Orthogonal designs III: Weighing matrices University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1974 Orthogonal designs III: Weighing matrices Anthony V. Geramita Jennifer

More information

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

Hadamard Matrices, d-linearly Independent Sets and Correlation-Immune Boolean Functions with Minimum Hamming Weights Hadamard Matrices, d-linearly Independent Sets and Correlation-Immune Boolean Functions with Minimum Hamming Weights Qichun Wang Abstract It is known that correlation-immune (CI) Boolean functions used

More information

Linear Algebra (Review) Volker Tresp 2018

Linear Algebra (Review) Volker Tresp 2018 Linear Algebra (Review) Volker Tresp 2018 1 Vectors k, M, N are scalars A one-dimensional array c is a column vector. Thus in two dimensions, ( ) c1 c = c 2 c i is the i-th component of c c T = (c 1, c

More information

Hadamard matrices of order 32

Hadamard matrices of order 32 Hadamard matrices of order 32 H. Kharaghani a,1 B. Tayfeh-Rezaie b a Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Alberta, T1K3M4, Canada b School of Mathematics,

More information

Means of unitaries, conjugations, and the Friedrichs operator

Means of unitaries, conjugations, and the Friedrichs operator J. Math. Anal. Appl. 335 (2007) 941 947 www.elsevier.com/locate/jmaa Means of unitaries, conjugations, and the Friedrichs operator Stephan Ramon Garcia Department of Mathematics, Pomona College, Claremont,

More information

Hadamard and conference matrices

Hadamard and conference matrices Hadamard and conference matrices Peter J. Cameron December 2011 with input from Dennis Lin, Will Orrick and Gordon Royle Hadamard s theorem Let H be an n n matrix, all of whose entries are at most 1 in

More information

Cocyclic Hadamard matrices over Zt x Z~

Cocyclic Hadamard matrices over Zt x Z~ Cocyclic Hadamard matrices over Zt x Z~ A. Baliga 1 and K. J. Horadam 2 Department of Mathematics, R.M.LT., GPO Box 2476V, Melbourne, VIC 3001, AUSTRALIA Abstract A natural starting point in a systematic

More information

University of Wollongong. Research Online

University of Wollongong. Research Online University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1975 Orthogonal designs Anthony V. Geramita Joan Murphy Geramita Jennifer

More information

Some Restricted Plane partitions and Associated Lattice Paths S. Bedi Department of Mathematics, D.A.V College, Sector 10 Chandigarh , India

Some Restricted Plane partitions and Associated Lattice Paths S. Bedi Department of Mathematics, D.A.V College, Sector 10 Chandigarh , India Some Restricted Plane partitions and Associated Lattice Paths S. Bedi Department of Mathematics, D.A.V College, Sector 10 Chandigarh - 160010, India Abstract. Anand and Agarwal, (Proc. Indian Acad. Sci.

More information

GENERATING TERNARY SIMPLEX CODES ARISING FROM COMPLEX HADAMARD MATRICES

GENERATING TERNARY SIMPLEX CODES ARISING FROM COMPLEX HADAMARD MATRICES GENERATING TERNARY SIMPLEX CODES ARISING FROM COMPLEX HADAMARD MATRICES ABSTRACT Chandradeo Prasad Assistant Professor, Department. Of CSE, RGIT, Koderma, (India) In this paper, simplex codes are constructed

More information

ON THE CONSTRUCTION OF 2-SYMBOL ORTHOGONAL ARRAYS

ON THE CONSTRUCTION OF 2-SYMBOL ORTHOGONAL ARRAYS Hacettepe Journal of Mathematics and Statistics Volume 31 (2002), 57 62 ON THE CONSTRUCTION OF 2-SYMBOL ORTHOGONAL ARRAYS Hülya Bayra and Aslıhan Alhan Received 22. 01. 2002 Abstract The application of

More information

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

The Multiplicities of a Dual-thin Q-polynomial Association Scheme The Multiplicities of a Dual-thin Q-polynomial Association Scheme Bruce E. Sagan Department of Mathematics Michigan State University East Lansing, MI 44824-1027 sagan@math.msu.edu and John S. Caughman,

More information

Freiman s theorem in torsion-free groups

Freiman s theorem in torsion-free groups Freiman s theorem in torsion-free groups Mercede MAJ UNIVERSITÀ DEGLI STUDI DI SALERNO ADDITIVE COMBINATORICS IN BORDEAUX Institut de Mathématiques de Bordeaux April, 11-15, 2016 Gregory Freiman, Tel Aviv

More information

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

ON THE CONSTRUCTION OF HADAMARD MATRICES. P.K. Manjhi 1, Arjun Kumar 2. Vinoba Bhave University Hazaribag, INDIA International Journal of Pure and Applied Mathematics Volume 120 No. 1 2018, 51-58 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.12732/ijpam.v120i1.4

More information

A note on Devaney's definition of chaos

A note on Devaney's definition of chaos University of Wollongong Research Online Faculty of Engineering and Information Sciences - Papers: Part A Faculty of Engineering and Information Sciences 2004 A note on Devaney's definition of chaos Joseph

More information

W= -b'e + af + cg + dh, X= a'e + bf + dg' - ch', Y = -d'e - cf+ ag' - bh, Z = e'e - df + bg + ah',

W= -b'e + af + cg + dh, X= a'e + bf + dg' - ch', Y = -d'e - cf+ ag' - bh, Z = e'e - df + bg + ah', PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 88, Number 4. August 1983 LAGRANGE IDENTITY FOR POLYNOMIALS AND Ô-CODES OF LENGTHS It AND 13/ C. H. YANG Abstract. It is known that application of

More information

Affine designs and linear orthogonal arrays

Affine designs and linear orthogonal arrays Affine designs and linear orthogonal arrays Vladimir D. Tonchev Department of Mathematical Sciences, Michigan Technological University, Houghton, Michigan 49931, USA, tonchev@mtu.edu Abstract It is proved

More information

The Local Spectra of Regular Line Graphs

The Local Spectra of Regular Line Graphs The Local Spectra of Regular Line Graphs M. A. Fiol a, M. Mitjana b, a Departament de Matemàtica Aplicada IV Universitat Politècnica de Catalunya Barcelona, Spain b Departament de Matemàtica Aplicada I

More information

Primes in the Semigroup of Non-Negative Matrices

Primes in the Semigroup of Non-Negative Matrices Linear and Multilinear Algebra, 1974, Vol. 2, pp. 135-140 Gordon and Breach Science Publishers Ltd. Printed in Great Britain Primes in the Semigroup of Non-Negative Matrices DANIEL J. RICHMAN and HANS

More information

Review of Linear Algebra

Review of Linear Algebra Review of Linear Algebra Definitions An m n (read "m by n") matrix, is a rectangular array of entries, where m is the number of rows and n the number of columns. 2 Definitions (Con t) A is square if m=

More information

The amicable-kronecker construction of quaternion orthogonal designs

The amicable-kronecker construction of quaternion orthogonal designs AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 50 (2011), Pages 243 258 The amicable-kronecker construction of quaternion orthogonal designs Jennifer Seberry Centre for Computer and Information Security

More information

Phys 201. Matrices and Determinants

Phys 201. Matrices and Determinants Phys 201 Matrices and Determinants 1 1.1 Matrices 1.2 Operations of matrices 1.3 Types of matrices 1.4 Properties of matrices 1.5 Determinants 1.6 Inverse of a 3 3 matrix 2 1.1 Matrices A 2 3 7 =! " 1

More information

arxiv: v2 [math.co] 6 Apr 2016

arxiv: v2 [math.co] 6 Apr 2016 On the chromatic number of Latin square graphs Nazli Besharati a, Luis Goddyn b, E.S. Mahmoodian c, M. Mortezaeefar c arxiv:1510.051v [math.co] 6 Apr 016 a Department of Mathematical Sciences, Payame Noor

More information

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

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

More information

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing

More information