A Series of Regular Hadamard Matrices
|
|
- Randall Booth
- 5 years ago
- Views:
Transcription
1 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 Hadamard matrix of order 4p. AMS classification numbers: 05B0, 05B05 Keywords: regular Hadamard matrix, symmetric design, Menon design.
2 1 Introduction A -(v, k, λ) design is a finite incidence structure (P, B, I), where P and B are disjoint sets and I P B, with the following properties: 1. P = v;. every element of B is incident with exactly k elements of P; 3. every pair of distinct elements of P is incident with exactly λ elements of B. The elements of the set P are called points and the elements of the set B are called blocks. If P = B = v and k v, then a -(v, k, λ) design is called a symmetric design. A Hadamard matrix of order m is an (m m)-matrix H = (h i,j ), h i,j { 1, 1}, satisfying HH T = H T H = mi, where I is the unit matrix. A Hadamard matrix is regular if the row and column sums are constant. It is well known that the existence of a symmetric (4u, u u, u u) design is equivalent to the existence of a regular Hadamard matrix of order 4u (see [4, Theorem 1.4 p. 80]). Such symmetric designs are called Menon designs. If n + 1 and n 1 are prime powers there exists a symmetric Hadamard matrix with constant diagonal of order n (see [4, Corollary 5.1 p. 34]). T. Xia, M. Xia and J. Seberry proved (see [5]) the following statement: When k = q 1, q, q 1 q, q 1 q 4, q q 3 N, q 3 q 4 N, where q 1, q and q 3 are prime powers, q 1 1 (mod 4), q 3 (mod 8), q 3 5 (mod 8), q 4 = 7 or 3, N = a 3 b t, a, b = 0 or 1, t 0 is an arbitrary integer, there exist regular Hadamard matrices of order 4k. 1
3 The existence of some regular Hadamard matrice of order 4p, when p is a prime, p 7 (mod 16), is established in [3]. According to [5] and [3], there are just two values of k 100 for which the existence of a regular Hadamard matrix of order 4k is still in doubt, k = 47 and k = 79. Nonzero Squares in Finite Fields Let p be a prime power, p 3 (mod 4) and F p be a field with p elements. Then a (p p) matrix D = (d ij ), such that 1, if (i j) is a nonzero square in F p, d ij = 0, otherwise. is an incidence matrix of a symmetric (p, p 1, p 3 4 ) design. Such a symmetric design is called a Paley design (see []). Let D be an incidence matrix of a complementary symmetric design with parameters (p, p+1, p+1 4 ). Since 1 is not a square in F p, D is a skew-symmetric matrix. Further, D has zero diagonal, so D +I p and D I p, where I p is an (p p) identity matrix, are incidence matrices of symmetric designs with parameters (p, p+1, p+1 4 respectively. Matrices D and D have the following properties: D D T = (D I p )(D + I p ) T = p J p p I p, [ D D I p ] [ D I p D ] T = p 1 J p p 1 I p, [ D D ] [ D + I p D I p ] T = p 1 J p, [ D D ] [ D I p D I p ] T = p 1 J p, ) and (p, p 1, p 3 4 ),
4 where J p is the all-one matrix of dimension (p p). Let Σ(p) denote the group of all permutations of F p given by x aσ(x) + b, where a is a nonzero square in F(p), b is any element of F(p), and σ is an automorphism of the field F(p). Σ(p) is an automorphism group of symmetric designs with incidence matrices D, D + I p, D and D I p (see [, pp. 9]). If p is a prime, Σ(p) is isomorphic to a semidirect product Z p : Z p 1. Let q be a prime power, q 1 (mod 4), and C = (c ij ) be a (q q) matrix defined as follows: 1, if (i j) is a nonzero square in F q, c ij = 0, otherwise. C is a symmetric matrix, since 1 is a square in F q. There are as many nonzero squares as nonsquares in F(q), so each row of C has q 1 elements equal 1 and q+1 zeros. Let i j and C i = [c i1...c iq ], C j = [c j1...c jq ] be the i th and the j th row of the matrix C, respectively. Then C i Cj T = q 1 4, if c ij = c ji = 0, q 1 4 1, if c ij = c ji = 1. The matrix C I q has the same property. Let i j and C i = [c i1...c iq ], C j = [c j1...c jq ] be the i th and the j th row of the matrix C, respectively. Then C i C T j = q 1 4, if c ij = c ji = 0, q , if c ij = c ji = 1. The matrix C + I q has the same property. Further, C (C + I q ) T = C (C I q ) T = q 1 4 J q + q 1 4 I q, 3
5 C (C I q ) T = q 1 4 J q q 1 4 I q, (C + I q ) C T = q J q q 1 4 I q, [ C C + I q ] [ C C + I q ] T = q 1 J q + q + 1 I q, [ C C I q ] [ C C I q ] T = q 1 J q + q + 1 I q, [ C C + I q ] [ C C I q ] T = q + 1 J q q + 1 I q. Σ(q) acts as an automorphism group of incidence structures with incidence matrices C, C + I q, C and C I q. 3 Regular Hadamard Matrices Let H = (h ij ) and K be m n and m 1 n 1 matrices, respectively. Their Kronecker product is a mm 1 nn 1 matrix h 11 K h 1 K... h 1n K h 1 K h K... h n K H K =... h m1 K h m K... h mn K For v N we denote by j v the all-one vector of dimension v, by 0 v the zero-vector of dimension v, and by 0 v v the zero-matrix of dimension v v. Theorem 1 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). Proof Put q = p 1. Then q 1 (mod 4). Let D, D, C, C be defined as above. Define a (4p 4p ) matrix M in the following way: 4
6 M = 0 0 T q jp q T 0 T p q 0 q 0 q q (C I q ) jp T C jp T (C + I q ) D C D j p q C j p + + C (D I p ) (C I q ) D C (D + I p ) (C + I q ) (D I p ) 0 p q (C + I q ) j p + + (C I q ) (D I p ) C D Let us show that M is an incidence matrix of a Menon design with parameters (4p, p p, p p). It is easy to see that M J 4p = (p p)j 4p. We have to prove that M M T = (p p)j 4p + p I 4p. Using properties of the matrices D, D, C and C which we have menitioned before, one computes that the product of block matrices M and M T is: pq (p p)jq T (p p)jpq T (p p)jpq T (p p)j q (p p)j q + (p p)j q pq (p p)j q pq p I q M M T (p p)j pq = (p p)j pq (p p)j pq q + (p p)j pq pq p I pq (p p)j pq (p p)j pq (p p)j pq q (p p)j pq pq + p I pq 5
7 where J m n is the all-one matrix of dimension m n. Thus, M M T = (p p)j 4p + p I 4p which means that M is an incidence matrix of a symmetric design with parameters (4p, p p, p p). Corollary 1 Let p and p 1 be prime powers and p 3 (mod 4). Then there exists a regular Hadamard matrix of order 4p. That proves, in particular, that there exists a regular Hadamard matrix of order 4 79 = Incidence matrices of the Menon designs from Theorem 1 lead us to conclusion that the groups Σ(p) Σ(p 1) act as automorphism groups of these designs, semistandardly with one fixed point (and block), one orbit of length p 1, and two orbits of length p p. If p and p 1 are primes, then Σ(p) Σ(p 1) = (Z p : Z p 1) (Z p 1 : Z p 1 ), and the derived designs of the Menon designs from Theorem 1 with respect to the first block, i.e., the fixed block for an automorphism group (Z p : Z p 1) (Z p 1 : Z p 1 ), are cyclic. That proves the following corollary: Corollary Let p and p 1 be primes and p 3 (mod 4). Then there exists a cyclic -(p p, p p, p p 1) design having an automorphism group isomorphic to (Z p : Z p 1) (Z p 1 : Z p 1 ). Parameters of Menon designs belonging to the series described in this paper, 6
8 for p 100, are given below. table 1. Table of parameters for p 100 p q = p 1 4p Parameters of Menon Designs (36,15,6) (196,91,4) (1444,703,34) (916,1431,70) (3844,1891,930) (4964,1403,616) References [1] H. Evangelaras, C. Koukouvinos and J. Seberry, Applicatons of Hadamard matrices, Journal of Telecommunications and Information Technology, Vol. (003) pp. 10. [] E. Lander, Symmetric Designs: An Algebraic Approach, Cambridge University Press, Cambridge (1983). [3] K. H. Leung, S. L. Ma and B. Schmidt. New Hadamard matrices of order 4p obtained from Jacobi sums of order 16, preprint. 7
9 [4] W. D. Wallis, A. P. Street and J. S. Wallis, Combinatorics: Room Squares, Sum-Free Sets, Hadamard matrices, Springer-Verlag, Berlin-Heidelberg- New York (197). [5] T. Xia, M. Xia, and J. Seberry, Regular Hadamard matrices, maximum excess and SBIBD, Australasian Journal of Combinatorics, Vol. 7 (003) pp
10 Affiliation of author: Dean Crnković Department of Mathematics Faculty of Philosophy Omladinska Rijeka Croatia 9
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--------------------------------------------------------------------------------------------- Math 6023 Topics: Design and Graph Theory ---------------------------------------------------------------------------------------------
More informationSYMMETRIC (66,26,10) DESIGNS HAVING F rob 55 AUTOMORPHISM GROUP AS AN. Dean Crnković and Sanja Rukavina Faculty of Philosophy in Rijeka, Croatia
GLASNIK MATEMATIČKI Vol. 35(55)(2000), 271 281 SYMMETRIC (66,26,10) DESIGNS HAVING F rob 55 AUTOMORPHISM GROUP AS AN Dean Crnković and Sanja Rukavina Faculty of Philosophy in Rijeka, Croatia Abstract.
More informationOn some incidence structures constructed from groups and related codes
On some incidence structures constructed from groups and related codes Dean Crnković Department of Mathematics University of Rijeka Croatia Algebraic Combinatorics and Applications The first annual Kliakhandler
More informationSome 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 informationSome 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 informationON 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 informationDifference sets and Hadamard matrices
Difference sets and Hadamard matrices Padraig Ó Catháin National University of Ireland, Galway 14 March 2012 Outline 1 (Finite) Projective planes 2 Symmetric Designs 3 Difference sets 4 Doubly transitive
More informationHadamard 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 informationSome 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 informationSOME NEW SYMMETRIC DESIGNS FOR (256,120,56)
GLASNIK MATEMATICKI Vol. 34(54)(1999),123-128 SOME NEW SYMMETRIC DESIGNS FOR (256,120,56) MARIO-OSVIN PAVCEVIC University of Zagreb, Croatia ABSTRACT. We prove the existence of two symmetric designs with
More informationA 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 informationRANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA
Discussiones Mathematicae General Algebra and Applications 23 (2003 ) 125 137 RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA Seok-Zun Song and Kyung-Tae Kang Department of Mathematics,
More informationarxiv: v4 [math.co] 12 Feb 2017
arxiv:1511.03511v4 [math.co] 12 Feb 2017 On the signed graphs with two distinct eigenvalues F. Ramezani 1 Department of Mathematics, K.N.Toosi University of Technology, Tehran, Iran P.O. Box 16315-1618
More informationCheckered 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 information3-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 informationTwo 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 informationSupplementary 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 informationMinimal 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#A30 INTEGERS 17 (2017) CONFERENCE MATRICES WITH MAXIMUM EXCESS AND TWO-INTERSECTION SETS
#A3 INTEGERS 7 (27) CONFERENCE MATRICES WITH MAIMUM ECESS AND TWO-INTERSECTION SETS Koji Momihara Faculty of Education, Kumamoto University, Kurokami, Kumamoto, Japan momihara@educ.kumamoto-u.ac.jp Sho
More informationTactical Decompositions of Steiner Systems and Orbits of Projective Groups
Journal of Algebraic Combinatorics 12 (2000), 123 130 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Tactical Decompositions of Steiner Systems and Orbits of Projective Groups KELDON
More informationDifference sets and Hadamard matrices
Difference sets and Hadamard matrices Padraig Ó Catháin University of Queensland 5 November 2012 Outline 1 Hadamard matrices 2 Symmetric designs 3 Hadamard matrices and difference sets 4 Two-transitivity
More informationSquare 2-designs/1. 1 Definition
Square 2-designs Square 2-designs are variously known as symmetric designs, symmetric BIBDs, and projective designs. The definition does not imply any symmetry of the design, and the term projective designs,
More informationThe 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 informationSome 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 informationAlgebraic aspects of Hadamard matrices
Algebraic aspects of Hadamard matrices Padraig Ó Catháin University of Queensland 22 February 2013 Overview Difference set Relative difference set Symmetric Design Hadamard matrix Overview 1 Hadamard matrices
More informationA 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 informationOn 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 informationHOMEWORK Graduate Abstract Algebra I May 2, 2004
Math 5331 Sec 121 Spring 2004, UT Arlington HOMEWORK Graduate Abstract Algebra I May 2, 2004 The required text is Algebra, by Thomas W. Hungerford, Graduate Texts in Mathematics, Vol 73, Springer. (it
More informationPractice Algebra Qualifying Exam Solutions
Practice Algebra Qualifying Exam Solutions 1. Let A be an n n matrix with complex coefficients. Define tr A to be the sum of the diagonal elements. Show that tr A is invariant under conjugation, i.e.,
More informationOn the Least Number of Cell Orbits of a Hadamard Matrix of Order n
Irish Math. Soc. Bulletin 56 (2005), 95 102 95 On the Least Number of Cell Orbits of a Hadamard Matrix of Order n WARWICK DE LAUNEY AND RICHARD STAFFORD Abstract. The automorphism group of any Hadamard
More information11 Block Designs. Linear Spaces. Designs. By convention, we shall
11 Block Designs Linear Spaces In this section we consider incidence structures I = (V, B, ). always let v = V and b = B. By convention, we shall Linear Space: We say that an incidence structure (V, B,
More informationNew 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 informationOn 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 informationAffine 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 informationHadamard matrices, difference sets and doubly transitive permutation groups
Hadamard matrices, difference sets and doubly transitive permutation groups Padraig Ó Catháin University of Queensland 13 November 2012 Outline 1 Hadamard matrices 2 Symmetric designs 3 Hadamard matrices
More informationA prolific construction of strongly regular graphs with the n-e.c. property
A prolific construction of strongly regular graphs with the n-e.c. property Peter J. Cameron and Dudley Stark School of Mathematical Sciences Queen Mary, University of London London E1 4NS, U.K. Abstract
More informationarxiv: v1 [math.ra] 10 Nov 2018
arxiv:1811.04243v1 [math.ra] 10 Nov 2018 BURNSIDE S THEOREM IN THE SETTING OF GENERAL FIELDS HEYDAR RADJAVI AND BAMDAD R. YAHAGHI Abstract. We extend a well-known theorem of Burnside in the setting of
More informationTC08 / 6. Hadamard codes SX
TC8 / 6. Hadamard codes 3.2.7 SX Hadamard matrices Hadamard matrices. Paley s construction of Hadamard matrices Hadamard codes. Decoding Hadamard codes A Hadamard matrix of order is a matrix of type whose
More informationThe construction of combinatorial structures and linear codes from orbit matrices of strongly regular graphs
linear codes from Sanja Rukavina sanjar@mathunirihr Department of Mathematics University of Rijeka, Croatia Symmetry vs Regularity The first 50 years since Weisfeiler-Leman stabilization July - July 7,
More informationHadamard 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 informationOn an Additive Characterization of a Skew Hadamard (n, n 1/ 2, n 3 4 )-Difference Set in an Abelian Group
Southern Illinois University Carbondale OpenSIUC Articles and Preprints Department of Mathematics 5-013 On an Additive Characterization of a Skew Hadamard (n, n 1/, n 3 )-Difference Set in an Abelian Group
More informationSimple 3-(q + 1, 5, 3) designs admitting an automorphism group PSL(2, q) with q 1 (mod 4)
Simple -(q + 5 ) designs admitting an automorphism group PSL( q) with q (mod 4) Weixia Li School of Mathematical Sciences Qingdao University Qingdao 667 China Dameng Deng Department of Mathematics Shanghai
More informationAn 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 informationK. 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 informationPROBLEMS ON LINEAR ALGEBRA
1 Basic Linear Algebra PROBLEMS ON LINEAR ALGEBRA 1. Let M n be the (2n + 1) (2n + 1) for which 0, i = j (M n ) ij = 1, i j 1,..., n (mod 2n + 1) 1, i j n + 1,..., 2n (mod 2n + 1). Find the rank of M n.
More informationA Questionable Distance-Regular Graph
A Questionable Distance-Regular Graph Rebecca Ross Abstract In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection
More informationWilliam Stallings Copyright 2010
A PPENDIX E B ASIC C ONCEPTS FROM L INEAR A LGEBRA William Stallings Copyright 2010 E.1 OPERATIONS ON VECTORS AND MATRICES...2 Arithmetic...2 Determinants...4 Inverse of a Matrix...5 E.2 LINEAR ALGEBRA
More informationCLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES
Bull Korean Math Soc 45 (2008), No 1, pp 95 99 CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES In-Jae Kim and Bryan L Shader Reprinted
More informationBose'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 informationSome recent results on all-or-nothing transforms, or All or nothing at all
Some recent results on all-or-nothing transforms, or All or nothing at all Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Alex Rosa 80, Mikulov, June 27 30, 2017
More informationCOMMUTATIVE SEMIFIELDS OF ORDER 243 AND 3125
COMMUTATIVE SEMIFIELDS OF ORDER 243 AND 3125 ROBERT S. COULTER AND PAMELA KOSICK Abstract. This note summarises a recent search for commutative semifields of order 243 and 3125. For each of these two orders,
More informationHadamard 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 informationNew 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 informationTREVOR HYDE AND JOSEPH KRAISLER
CIRCULANT q-butson HADAMARD MATRICES TREVOR HYDE AND JOSEPH KRAISLER ABSTRACT. If q = p n is a prime power, then a d-dimensional q-butson Hadamard matrix H is a d d matrix with all entries qth roots of
More informationA 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 informationGENERATING 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 informationarxiv: 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 informationNew Restrictions on Possible Orders of Circulant Hadamard Matrices
New Restrictions on Possible Orders of Circulant Hadamard Matrices Ka Hin Leung Department of Mathematics National University of Singapore Kent Ridge, Singapore 119260 Republic of Singapore Bernhard Schmidt
More information18.S34 linear algebra problems (2007)
18.S34 linear algebra problems (2007) Useful ideas for evaluating determinants 1. Row reduction, expanding by minors, or combinations thereof; sometimes these are useful in combination with an induction
More informationRadon Transforms and the Finite General Linear Groups
Claremont Colleges Scholarship @ Claremont All HMC Faculty Publications and Research HMC Faculty Scholarship 1-1-2004 Radon Transforms and the Finite General Linear Groups Michael E. Orrison Harvey Mudd
More informationFrobenius groups, near-rings, and combinatorial designs (Life after Coolville)
Frobenius groups, near-rings, and combinatorial designs (Life after Coolville) A combinatorial design is an incidence structure of points and blocks. Blocks are simply sets of points, and we say a point
More informationZero sum partition of Abelian groups into sets of the same order and its applications
Zero sum partition of Abelian groups into sets of the same order and its applications Sylwia Cichacz Faculty of Applied Mathematics AGH University of Science and Technology Al. Mickiewicza 30, 30-059 Kraków,
More informationOn the existence of cyclic difference sets with small parameters
Fields Institute Communications Volume 00, 0000 On the existence of cyclic difference sets with small parameters Leonard D. Baumert 325 Acero Place Arroyo Grande, CA 93420 Daniel M. Gordon IDA Center for
More informationHadamard 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 informationConstructing 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 informationLIFTED CODES OVER FINITE CHAIN RINGS
Math. J. Okayama Univ. 53 (2011), 39 53 LIFTED CODES OVER FINITE CHAIN RINGS Steven T. Dougherty, Hongwei Liu and Young Ho Park Abstract. In this paper, we study lifted codes over finite chain rings. We
More informationSome constructions of integral graphs
Some constructions of integral graphs A. Mohammadian B. Tayfeh-Rezaie School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran ali m@ipm.ir tayfeh-r@ipm.ir
More informationarxiv: v1 [math.co] 3 Nov 2014
SPARSE MATRICES DESCRIBING ITERATIONS OF INTEGER-VALUED FUNCTIONS BERND C. KELLNER arxiv:1411.0590v1 [math.co] 3 Nov 014 Abstract. We consider iterations of integer-valued functions φ, which have no fixed
More informationLower bounds on maximal determinants
Lower bounds on maximal determinants Richard P. Brent ANU 26 September 2012 joint work with Judy-anne Osborn University of Newcastle Presented at the 56th annual meeting of the Australian Mathematical
More informationOn A Special Case Of A Conjecture Of Ryser About Hadamard Circulant Matrices
Applied Mathematics E-Notes, 1(01), 18-188 c ISSN 1607-510 Available free at mirror sites of http://www.math.nthu.edu.tw/amen/ On A Special Case Of A Conjecture Of Ryser About Hadamard Circulant Matrices
More informationTheorems of Erdős-Ko-Rado type in polar spaces
Theorems of Erdős-Ko-Rado type in polar spaces Valentina Pepe, Leo Storme, Frédéric Vanhove Department of Mathematics, Ghent University, Krijgslaan 28-S22, 9000 Ghent, Belgium Abstract We consider Erdős-Ko-Rado
More informationWeek 15-16: Combinatorial Design
Week 15-16: Combinatorial Design May 8, 2017 A combinatorial design, or simply a design, is an arrangement of the objects of a set into subsets satisfying certain prescribed properties. The area of combinatorial
More informationConstruction of latin squares of prime order
Construction of latin squares of prime order Theorem. If p is prime, then there exist p 1 MOLS of order p. Construction: The elements in the latin square will be the elements of Z p, the integers modulo
More informationSIMPLICES AND SPECTRA OF GRAPHS
University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics Jadranska 9, 000 Ljubljana, Slovenia Preprint series, Vol. 47 (2009), 07 SIMPLICES AND SPECTRA OF GRAPHS
More informationWeighing 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 informationTilburg 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 informationGroup actions on Hadamard matrices
National University of Ireland, Galway Group actions on Hadamard matrices by Padraig Ó Catháin A thesis submitted in partial fulfillment for the degree of Master of Literature in the Faculty of Arts School
More informationStrongly regular graphs constructed from groups
Strongly regular graphs constructed from groups Dean Crnković Department of Mathematics University of Rijeka Croatia Symmetry vs Regularity Pilsen, Czech Republic, July 2018 This work has been fully supported
More informationExercises on chapter 1
Exercises on chapter 1 1. Let G be a group and H and K be subgroups. Let HK = {hk h H, k K}. (i) Prove that HK is a subgroup of G if and only if HK = KH. (ii) If either H or K is a normal subgroup of G
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationThe energy of integral circulant graphs
Applied Linear Algebra ALA 200 Faculty of Sciences and Mathematics University of Niš, Serbia Novi Sad, May 200 Graph energy Integral circulant graphs Recent applications Let G be a simple graph with n
More informationLatin Squares and Projective Planes Combinatorics Seminar, SPRING, 2010
Latin Squares and Projective Planes Combinatorics Seminar, SPRING, 2010 1 CHAPTER 1 Finite Fields F 4 (x 2 + x + 1 is irreducable) x x + 1 x x + 1 1 x + 1 1 x 1. Examples F 4 = {(a, b) a, b Z 2 } (a,
More informationMA441: Algebraic Structures I. Lecture 18
MA441: Algebraic Structures I Lecture 18 5 November 2003 1 Review from Lecture 17: Theorem 6.5: Aut(Z/nZ) U(n) For every positive integer n, Aut(Z/nZ) is isomorphic to U(n). The proof used the map T :
More informationOn 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 informationarxiv: v2 [math.co] 27 Jul 2013
Spectra of the subdivision-vertex and subdivision-edge coronae Pengli Lu and Yufang Miao School of Computer and Communication Lanzhou University of Technology Lanzhou, 730050, Gansu, P.R. China lupengli88@163.com,
More informationx y B =. v u Note that the determinant of B is xu + yv = 1. Thus B is invertible, with inverse u y v x On the other hand, d BA = va + ub 2
5. Finitely Generated Modules over a PID We want to give a complete classification of finitely generated modules over a PID. ecall that a finitely generated module is a quotient of n, a free module. Let
More informationOn the number of diamonds in the subgroup lattice of a finite abelian group
DOI: 10.1515/auom-2016-0037 An. Şt. Univ. Ovidius Constanţa Vol. 24(2),2016, 205 215 On the number of diamonds in the subgroup lattice of a finite abelian group Dan Gregorian Fodor and Marius Tărnăuceanu
More informationMaximum exponent of boolean circulant matrices with constant number of nonzero entries in its generating vector
Maximum exponent of boolean circulant matrices with constant number of nonzero entries in its generating vector MI Bueno, Department of Mathematics and The College of Creative Studies University of California,
More informationLecture Notes Introduction to Cluster Algebra
Lecture Notes Introduction to Cluster Algebra Ivan C.H. Ip Update: May 16, 2017 5 Review of Root Systems In this section, let us have a brief introduction to root system and finite Lie type classification
More informationMa/CS 6a Class 19: Group Isomorphisms
Ma/CS 6a Class 19: Group Isomorphisms By Adam Sheffer A Group A group consists of a set G and a binary operation, satisfying the following. Closure. For every x, y G x y G. Associativity. For every x,
More informationAn 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 informationSylow subgroups of GL(3,q)
Jack Schmidt We describe the Sylow p-subgroups of GL(n, q) for n 4. These were described in (Carter & Fong, 1964) and (Weir, 1955). 1 Overview The groups GL(n, q) have three types of Sylow p-subgroups:
More informationON THE CLASSIFICATION OF RANK 1 GROUPS OVER NON ARCHIMEDEAN LOCAL FIELDS
ON THE CLASSIFICATION OF RANK 1 GROUPS OVER NON ARCHIMEDEAN LOCAL FIELDS LISA CARBONE Abstract. We outline the classification of K rank 1 groups over non archimedean local fields K up to strict isogeny,
More informationAUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS
AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS MAX GOLDBERG Abstract. We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize
More informationPerfect 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 informationHadamard 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 informationStrongly Regular Decompositions of the Complete Graph
Journal of Algebraic Combinatorics, 17, 181 201, 2003 c 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Strongly Regular Decompositions of the Complete Graph EDWIN R. VAN DAM Edwin.vanDam@uvt.nl
More informationTrades 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 informationNoetherian property of infinite EI categories
Noetherian property of infinite EI categories Wee Liang Gan and Liping Li Abstract. It is known that finitely generated FI-modules over a field of characteristic 0 are Noetherian. We generalize this result
More information