Power Hadamard matrices

We introduce power Hadamard matrices, in order to study the structure of (group) generalized Hadamard matrices, Butson (generalized) Hadamard matrices and other related orthogonal matrices, with which they share certain common characteristics. The new objects turn out to be as interesting, and perhaps as useful, as the objects that motivated them.We develop a basic theory of power Hadamard matrices, explore these relationships, and offer some new insights into old results. For example, we show that all 4×4 Butson Hadamard matrices are equivalent to circulant ones, and how to move between equivalence classes.We provide, among other new things, an infinite family of circulant Butson Hadamard matrices that extends a known class to include one of each positive integer order.Dedication: In 1974 Jennifer Seberry (Wallis) introduced what was then a totally new structure, orthogonal designs, in order to study the existence and construction of Hadamard matrices. They have proved their worth for this purpose, and have also become an object of interest for their own sake and in applications (e.g., [H.J.V. Tarok, A.R. Calderbank, Space-time block codes from orthogonal designs, IEEE Trans. Inf. Theory 45 (1999) 1456-1467. [26]]). Since then many other generalizations of Hadamard matrices have been introduced, including some discussed herein. In the same spirit we introduce a new object showing this kind of promise.Seberry's contributions to this field are not limited to her own work, of which orthogonal designs are but one example—she has mentored many young mathematicians who have expanded her legacy by making their own marks in this field. It is fitting, therefore, that our contribution to this volume is a collaboration between one who has worked in this field for over a decade and an undergraduate student who had just completed his third year of study at the time of the work.     

Temperley-Lieb R-matrices from generalized Hadamard matrices

We construct new sets of rank n-representations of the Temperley-Lieb algebra TL_N(q) that are characterized by two matrices with a generalized complex Hadamard property. We give partial classifications for the two matrices, in particular, in the case where they reduce to Fourier or Butson matrices.     

Non-existence of Some Nearly Perfect Sequences,Near Butson–Hadamard Matrices,and Near Conference Matrices

In this paper we study the non-existence problem of (nearly) perfect (almost) m-ary sequences via their connection to (near) Butson–Hadamard (BH) matrices and (near) conference matrices. We refine the idea of Brock on the unsolvability of certain equations in the case of cyclotomic number fields whose ring of integers is not a principal ideal domain and get many new non-existence results for near BH matrices and near conference matrices. We also apply previous results on vanishing sums of roots of unity and self conjugacy condition to derive non-existence results for near BH matrices and near conference matrices.     

New lower bound of the determinant for Hadamard product on some totally nonnegative matrices

Applying the properties of Hadamard core for totally nonnegative matrices, we give new lower bounds of the determinant for Hadamard product about matrices in Hadamard core and totally nonnegative matrices, the results improve Oppenheim inequality for tridiagonal oscillating matrices obtained by T. L. Markham.     

On the complete pivoting conjecture for Hadamard matrices: further progress and a good pivots property

Further progress is achieved for the growth conjecture for Hadamard matrices. It is proved that the leading principal minors of a CP Hadamard matrix form an increasing sequence. Bounds for the sixth and seventh pivot of any CP Hadamard matrix are given. A new proof demonstrating that the growth of a Hadamard matrix of order 12 is 12, is presented. Moreover, a new notion of good pivots is introduced and its importance for the study of the growth problem for CP Hadamard matrices is examined. We establish that CP Hadamard matrices with good pivots satisfy Cryer’s growth conjecture with equality, namely their growth factor is equal to their order. A construction of an infinite class of Hadamard matrices is proposed.     

Cocyclic two-circulant core Hadamard matrices

Journal of Algebraic Combinatorics - The two-circulant core (TCC) construction for Hadamard matrices uses two sequences with almost perfect autocorrelation to construct a Hadamard matrix. A...     

三对角的完全非负矩阵上的Schur-Oppenheim严格不等式

应用完全非负矩阵的 Hadamard中心的性质 ,给出了非奇异三对角完全非负矩阵的Hadamard乘积的行列式的下界估计满足 Schur- Oppenheim严格不等式的充分条件 ,改进了 T.L .Markham的关于三对角的振荡矩阵的相应结果 .     

Properties of submatrices of Sylvester Hadamard matrices

We investigate the algebraic behaviour of leading principal submatrices of Hadamard matrices being powers of 2. We provide analytically the spectrum of general submatrices of these Hadamard matrices. Symmetry properties and relationships between the upper left and lower right corners of the matrices in this respect are demonstrated. Considering the specific construction scheme of this particular class of Hadamard matrices (called Sylvester Hadamard matrices), we utilize tensor operations to prove the respective results. An algorithmic procedure yielding the complete spectrum of leading principal submatrices of Sylvester Hadamard matrices is proposed.     

A Note on Siamese Twin Designs Intersecting in a BIBD and a PBD

Suppose there exists a Hadamard 2-\((m,\frac{m-1}{2},\frac{m-3}{4})\) design with skew incidence matrix, and a conference graph with v vertices, where \(v = 2m-1\). Under this assumption we prove that there exists a Siamese twin Menon design with parameters \((4m^{2},2m^{2}-m,m^{2}-m)\) intersecting in a balanced incomplete block design \(\mathrm {BIBD}(2m^{2} - m, m^{2} - m, m^{2} - m - 1)\) and a pairwise balanced design \(\mathrm {PBD}(2m^{2} - m, \{m^{2}, m^{2} - m\}, m^{2} - m - 1)\). These Menon designs lead to regular amicable Hadamard matrices of orders not previously constructed. Further we construct complex orthogonal designs of order \(4m^2\) and Butson Hadamard matrices \(\mathrm {BH}(4m^{2},2k)\) for all k. Some results regarding automorphisms of the constructed Menon designs are proven.     

On the classification of Hadamard matrices of order 32

All equivalence classes of Hadamard matrices of order at most 28 have been found by 1994. Order 32 is where a combinatorial explosion occurs on the number of Hadamard matrices. We find all equivalence classes of Hadamard matrices of order 32 which are of certain types. It turns out that there are exactly 13, 680, 757 Hadamard matrices of one type and 26, 369 such matrices of another type. Based on experience with the classification of Hadamard matrices of smaller order, it is expected that the number of the remaining two types of these matrices, relative to the total number of Hadamard matrices of order 32, to be insignificant. © 2009 Wiley Periodicals, Inc. J Combin Designs 18:328–336, 2010     

2-(31,15,7), 2-(35,17,8) and 2-(36,15,6) designs with automorphisms of odd prime order,and their related Hadamard matrices and codes

We present the full classification of Hadamard 2-(31,15,7), Hadamard 2-(35, 17,8) and Menon 2-(36,15,6) designs with automorphisms of odd prime order. We also give partial classifications of such designs with automorphisms of order 2. These classifications lead to related Hadamard matrices and self-dual codes. We found 76166 Hadamard matrices of order 32 and 38332 Hadamard matrices of order 36, arising from the classified designs. Remarkably, all constructed Hadamard matrices of order 36 are Hadamard equivalent to a regular Hadamard matrix. From our constructed designs, we obtained 37352 doubly-even [72,36,12] codes, which are the best known self-dual codes of this length until now.      

Weaving hadamard matrices with maximum excess and classes with small excess

Weaving is a matrix construction developed in 1990 for the purpose of obtaining new weighing matrices. Hadamard matrices obtained by weaving have the same orders as those obtained using the Kronecker product, but weaving affords greater control over the internal structure of matrices constructed, leading to many new Hadamard equivalence classes among these known orders. It is known that different classes of Hadamard matrices may have different maximum excess. We explain why those classes with smaller excess may be of interest, apply the method of weaving to explore this question, and obtain constructions for new Hadamard matrices with maximum excess in their respective classes. With this method, we are also able to construct Hadamard matrices of near‐maximal excess with ease, in orders too large for other by‐hand constructions to be of much value. We obtain new lower bounds for the maximum excess among Hadamard matrices in some orders by constructing candidates for the largest excess. For example, we construct a Hadamard matrix with excess 1408 in order 128, larger than all previously known values. We obtain classes of Hadamard matrices of order 96 with maximum excess 912 and 920, which demonstrates that the maximum excess for classes of that order may assume at least three different values. Since the excess of a woven Hadamard matrix is determined by the row sums of the matrices used to weave it, we also investigate the properties of row sums of Hadamard matrices and give lists of them in small orders. © 2004 Wiley Periodicals, Inc. J Combin Designs 12: 233–255, 2004.     

The cocyclic Hadamard matrices of order less than 40

In this paper all cocyclic Hadamard matrices of order less than 40 are classified. That is, all such Hadamard matrices are explicitly constructed, up to Hadamard equivalence. This represents a significant extension and completion of work by de Launey and Ito. The theory of cocyclic development is discussed, and an algorithm for determining whether a given Hadamard matrix is cocyclic is described. Since all Hadamard matrices of order at most 28 have been classified, this algorithm suffices to classify cocyclic Hadamard matrices of order at most 28. Not even the total numbers of Hadamard matrices of orders 32 and 36 are known. Thus we use a different method to construct all cocyclic Hadamard matrices at these orders. A result of de Launey, Flannery and Horadam on the relationship between cocyclic Hadamard matrices and relative difference sets is used in the classification of cocyclic Hadamard matrices of orders 32 and 36. This is achieved through a complete enumeration and construction of (4t, 2, 4t, 2t)-relative difference sets in the groups of orders 64 and 72.     

Skew‐Hadamard matrices of orders 436, 580, and 988 exist

We construct two difference families on each of the cyclic groups of order 109, 145, and 247, and use them to construct skew‐Hadamard matrices of orders 436, 580, and 988. Such difference families and matrices are constructed here for the first time. The matrices are constructed by using the Goethals‐Seidel array. © 2008 Wiley Periodicals, Inc. J Combin Designs 16: 493–498, 2008     

An Infinite Family of Hadamard Matrices with Fourth Last Pivot n /2

We show that the equivalence class of Sylvester Hadamard matrices give an infinite family of Hadamard matrices in which the fourth last pivot is n /2. Analytical examples of completely pivoted Hadamard matrices of order n having as fourth last pivot n /2 are given for n = 16 and 32. In each case this distinguished case with the fourth pivot n /2 arose in the equivalence class of the Sylvester Hadamard matrices.     

An Infinite Family of Hadamard Matrices with Fourth Last Pivot n /2

We show that the equivalence class of Sylvester Hadamard matrices give an infinite family of Hadamard matrices in which the fourth last pivot is n /2. Analytical examples of completely pivoted Hadamard matrices of order n having as fourth last pivot n /2 are given for n = 16 and 32. In each case this distinguished case with the fourth pivot n /2 arose in the equivalence class of the Sylvester Hadamard matrices.     

Hadamard matrices with few distinct types

The notion of type of quadruples of rows is proven to be useful in the classification of Hadamard matrices. In this paper, we investigate Hadamard matrices with few distinct types. Among other results, the Sylvester Hadamard matrices are shown to be characterized by their spectrum of types.     

Goethals–Seidel Difference Families with Symmetric or Skew Base Blocks

We single out a class of difference families which is widely used in some constructions of Hadamard matrices and which we call Goethals–Seidel (GS) difference families. They consist of four subsets (base blocks) of a finite abelian group of order v, which can be used to construct Hadamard matrices via the well-known Goethals–Seidel array. We consider the special class of these families in cyclic groups, where each base block is either symmetric or skew. We omit the well-known case where all four blocks are symmetric. By extending previous computations by several authors, we complete the classification of GS-difference families of this type for odd \(v<50\). In particular, we have constructed the first examples of so called good matrices, G-matrices and best matrices of order 43, and good matrices and G-matrices of order 45. We also point out some errors in one of the cited references.     

Classification of skew‐Hadamard matrices of order 32 and association schemes of order 31

Using a backtracking algorithm along with an essential change to the rows of representatives of known 13 710 027 equivalence classes of Hadamard matrices of order 32, we make an exhaustive computer search feasible and show that there are exactly 6662 inequivalent skew‐Hadamard matrices of order 32. Two skew‐Hadamard matrices are considered SH ‐equivalent if they are similar by a signed permutation matrix. We determine that there are precisely 7227 skew‐Hadamard matrices of order 32 up to SH ‐equivalence. This partly settles a problem posed by Kim and Solé. As a consequence, we provide the classification of association schemes of order 31.     

A sign test for detecting the equivalence of Sylvester Hadamard matrices

In this paper we show that every matrix in the class of Sylvester Hadamard matrices of order 2 ^k under H-equivalence can have full row and column sign spectrum, meaning that tabulating the numbers of sign interchanges along any row (or column) gives all integers 0,1,...,2 ^k  − 1 in some order. The construction and properties of Yates Hadamard matrices are presented and is established their equivalence with the Sylvester Hadamard matrices of the same order. Finally, is proved that every normalized Hadamard matrix has full column or row sign spectrum if and only if is H-equivalent to a Sylvester Hadamard matrix. This provides us with an efficient criterion identifying the equivalence of Sylvester Hadamard matrices.