Cocyclic Generalised Hadamard Matrices and Central Relative Difference Sets

Cocyclic matrices have the form where G is a finite group, C is a finite abelian group and : G × G C is a (two-dimensional) cocycle; that is,

Hadamard and Conference Matrices

We discuss new constructions of Hadamard and conference matrices using relative difference sets. We present the first example of a relative -difference set where n – 1 is not a prime power.     

一类特殊的分块反循环矩阵的特征值问题(英文)

利用r-循环矩阵的基本性质,探讨了一类特殊的分块反循环矩阵的特征值问题.     

一类特殊的分块反循环矩阵的特征值问题

利用r-循环矩阵的基本性质,探讨了一类特殊的分块反循环矩阵的特征值问题．     

关于双随机循环矩阵中的素元(英文)

非负矩阵中的素元分类问题在控制和系统论中有重要的应用.本文将研究由G.Picci等所提出的关于双随机循环矩阵中素元的一个问题和一个猜想,得到了一个判别具有位数5的n阶双随机循环矩阵不是素元的充要条件,给出了猜想成立的一些充分条件.     

On ‐Cocyclic Hadamard Matrices

In this paper, we describe some necessary and sufficient conditions for a set of coboundaries to yield a cocyclic Hadamard matrix over the dihedral group . Using this characterization, new classification results for certain cohomology classes of cocycles over are obtained, extending existing exhaustive calculations for cocyclic Hadamard matrices over from order 36 to order 44. We also define some transformations over coboundaries, which preserve orthogonality of ‐cocycles. These transformations are shown to correspond to Horadam's bundle equivalence operations enriched with duals of cocycles.     

循环矩阵的一些性质

本文给出了循环矩阵的一些性质.     

关于Hadamard乘积矩阵的一些性质的注记

对文 [1 ]的主要结论作了说明 ,给出 Hadamard乘积矩阵有关性质的更一般的结果 .     

基于两类切比雪夫多项式的循环矩阵行列式的计算

利用多项式因式分解的逆变换,结合循环矩阵和切比雪夫多项式的特殊结构,首先研究第三类和第四类切比雪夫多项式的通项公式,并给出第三类、第四类切比雪夫多项式的关于行首加r尾r右循环矩阵和行尾加r首r左循环矩阵的行列式的显式表达式,最后给出算法实施步骤.     

对角因子分块循环矩阵的对角化和谱分解

导出了对角因子分块循环矩阵的概念，把循环矩阵的对角化和谱分解推广到具有对角因子循环结构的分块矩阵中去．     

Some New Orders of Hadamard and Skew‐Hadamard Matrices

We construct Hadamard matrices of orders and , and skew‐Hadamard matrices of orders and . As far as we know, such matrices have not been constructed previously. The constructions use the Goethals–Seidel array, suitable supplementary difference sets on a cyclic group and a new efficient matching algorithm based on hashing techniques.     

循环矩阵本原指数的上界估计

本文给出了循环矩阵本原指数上界的新的估计及一种由级数较低的循环矩阵的本原指数估计级数较高的循环矩阵的本原指数的方法，解决了一类循环矩阵本原指数的计算问题．     

A Series of Regular Hadamard Matrices

Let p and 2p−1 be prime powers and p ≡ 3 (mod 4). Then there exists a symmetric design with parameters (4p², 2p² − p, p² − p). Thus there exists a regular Hadamard matrix of order 4p².     

Algorithms for Finding the Inverses of Factor Block Circulant Matrices

In this paper,algorithms for finding the inverse of a factor block circulant matrix, a factor block retrocirculant matrix and partitioned matrix with factor block circulant blocks over the complex field are presented respectively.In addition,two algorithms for the inverse of a factor block circulant matrix over the quaternion division algebra are proposed.     

The Semigroup of Circulant Matrices Over a Lattice

Let C_n(L) denote the set of all n × n circulant matrices over a distributive lattice L. Then C_n(L) forms a semigroup under the usual matrix product. In this paper, we shall characterize all idempotents in C_n(L), and also estabish the Euler-Fermat theorem for the semigroup C_n(L).AMS Subject Classification (2000): 20MSupported by the Educational Committee of Fujian, China.     

On ‐Cocyclic Hadamard Matrices

A characterization of ‐cocyclic Hadamard matrices is described, depending on the notions of distributions, ingredients, and recipes. In particular, these notions lead to the establishment of some bounds on the number and distribution of 2‐coboundaries over to use and the way in which they have to be combined in order to obtain a ‐cocyclic Hadamard matrix. Exhaustive searches have been performed, so that the table in p. 132 in A. Baliga, K. J. Horadam, Australas. J. Combin., 11 (1995), 123–134 is corrected and completed. Furthermore, we identify four different operations on the set of coboundaries defining ‐cocyclic matrices, which preserve orthogonality. We split the set of Hadamard matrices into disjoint orbits, define representatives for them, and take advantage of this fact to compute them in an easier way than the usual purely exhaustive way, in terms of diagrams. Let be the set of cocyclic Hadamard matrices over having a symmetric diagram. We also prove that the set of Williamson‐type matrices is a subset of of size .     

具有位数3和4的双随机循环矩阵中的素元

本文研究了双随机循环矩阵中素元的分类问题．由于任一n阶双随机循环矩阵都可以唯一地表示为移位的n-1次一元多项式,从而可把双随机循环矩阵中素元的分类问题简化为解双随机循环矩阵上的一个方程．应用此原理,本文完全解决了判别具有位数3的n阶双随机循环矩阵是否为素元的问题,并给出了n阶双随机循环矩阵中一类具有位数4的素元．     

On GMW Designs and Cyclic Hadamard Designs

We generalise results of Jackson concerning cyclic Hadamard designs admitting SL(2,2ⁿ) as a point transitive automorphism group. The generalisation concerns the designs of Gordon, Mills and Welch and we characterise these as designs admitting GM(m,qⁿ) acting in a certain way. We also generalise a construction given by Maschietti, using hyperovals, of cyclic Hadamard designs, and characterise these amongst the designs of Gordon, Mills and Welch.     

The Hadamard Product of Circulant Matrices on Three Symbols that are Inverses of M-Matrices

It is shown that the class of all n × n inverse M-matrices A for which both A and A -1 are circulant matrices on three symbols is closed under Hadamard products.