Abstract Cocyclic Hadamard matrices (CHMs) were introduced by de Launey and Horadam as a class of Hadamard matrices (HMs) with interesting algebraic properties. Ó Catháin and Röder described a classification …
Abstract Cocyclic Hadamard matrices (CHMs) were introduced by de Launey and Horadam as a class of Hadamard matrices (HMs) with interesting algebraic properties. Ó Catháin and Röder described a classification algorithm for CHMs of order based on relative difference sets in groups of order ; this led to the classification of all CHMs of order at most 36. On the basis of work of de Launey and Flannery, we describe a classification algorithm for CHMs of order with a prime; we prove refined structure results and provide a classification for . Our analysis shows that every CHM of order with is equivalent to a HM with one of five distinct block structures, including Williamson‐type and (transposed) Ito matrices. If , then every CHM of order is equivalent to a Williamson‐type or (transposed) Ito matrix.
Cocyclic Hadamard matrices (CHMs) were introduced by de Launey and Horadam as a class of Hadamard matrices with interesting algebraic properties. O Cathain and Roder described a classification algorithm for …
Cocyclic Hadamard matrices (CHMs) were introduced by de Launey and Horadam as a class of Hadamard matrices with interesting algebraic properties. O Cathain and Roder described a classification algorithm for CHMs of order $4n$ based on relative difference sets in groups of order $8n$; this led to the classification of all CHMs of order at most 36. Based on work of de Launey and Flannery, we describe a classification algorithm for CHMs of order $4p$ with $p$ a prime; we prove refined structure results and provide a classification for $p \leqslant 13$. Our analysis shows that every CHM of order $4p$ with $p\equiv 1\bmod 4$ is equivalent to a Hadamard matrix with one of five distinct block structures, including Williamson type and (transposed) Ito matrices. If $p\equiv 3 \bmod 4$, then every CHM of order $4p$ is equivalent to a Williamson type or (transposed) Ito matrix.
Cocyclic Hadamard matrices (CHMs) were introduced by de Launey and Horadam as a class of Hadamard matrices with interesting algebraic properties. \'O Cath\'ain and R\"oder described a classification algorithm for …
Cocyclic Hadamard matrices (CHMs) were introduced by de Launey and Horadam as a class of Hadamard matrices with interesting algebraic properties. \'O Cath\'ain and R\"oder described a classification algorithm for CHMs of order $4n$ based on relative difference sets in groups of order $8n$; this led to the classification of all CHMs of order at most 36. Based on work of de Launey and Flannery, we describe a classification algorithm for CHMs of order $4p$ with $p$ a prime; we prove refined structure results and provide a classification for $p \leqslant 13$. Our analysis shows that every CHM of order $4p$ with $p\equiv 1\bmod 4$ is equivalent to a Hadamard matrix with one of five distinct block structures, including Williamson type and (transposed) Ito matrices. If $p\equiv 3 \bmod 4$, then every CHM of order $4p$ is equivalent to a Williamson type or (transposed) Ito matrix.
Centraliser algebras of monomial representations of finite groups may be constructed and studied using methods similar to those employed in the study of permutation groups. Guided by results of D. …
Centraliser algebras of monomial representations of finite groups may be constructed and studied using methods similar to those employed in the study of permutation groups. Guided by results of D. G. Higman and others, we give an explicit construction for a basis of the centraliser algebra of a monomial representation. The character table of this algebra is then constructed via character sums over double cosets. We locate the theory of group-developed and cocyclic-developed Hadamard matrices within this framework. We apply Gr\"obner bases to produce a new classification of highly symmetric complex Hadamard matrices.
Centraliser algebras of monomial representations of finite groups may be constructed and studied using methods similar to those employed in the study of permutation groups. Guided by results of D. …
Centraliser algebras of monomial representations of finite groups may be constructed and studied using methods similar to those employed in the study of permutation groups. Guided by results of D. G. Higman and others, we give an explicit construction for a basis of the centraliser algebra of a monomial representation. The character table of this algebra is then constructed via character sums over double cosets. We locate the theory of group-developed and cocyclic-developed Hadamard matrices within this framework. We apply Gr\"obner bases to produce a new classification of highly symmetric complex Hadamard matrices.
Abstract Cocyclic Hadamard matrices (CHMs) were introduced by de Launey and Horadam as a class of Hadamard matrices (HMs) with interesting algebraic properties. Ó Catháin and Röder described a classification …
Abstract Cocyclic Hadamard matrices (CHMs) were introduced by de Launey and Horadam as a class of Hadamard matrices (HMs) with interesting algebraic properties. Ó Catháin and Röder described a classification algorithm for CHMs of order based on relative difference sets in groups of order ; this led to the classification of all CHMs of order at most 36. On the basis of work of de Launey and Flannery, we describe a classification algorithm for CHMs of order with a prime; we prove refined structure results and provide a classification for . Our analysis shows that every CHM of order with is equivalent to a HM with one of five distinct block structures, including Williamson‐type and (transposed) Ito matrices. If , then every CHM of order is equivalent to a Williamson‐type or (transposed) Ito matrix.
Cocyclic Hadamard matrices (CHMs) were introduced by de Launey and Horadam as a class of Hadamard matrices with interesting algebraic properties. O Cathain and Roder described a classification algorithm for …
Cocyclic Hadamard matrices (CHMs) were introduced by de Launey and Horadam as a class of Hadamard matrices with interesting algebraic properties. O Cathain and Roder described a classification algorithm for CHMs of order $4n$ based on relative difference sets in groups of order $8n$; this led to the classification of all CHMs of order at most 36. Based on work of de Launey and Flannery, we describe a classification algorithm for CHMs of order $4p$ with $p$ a prime; we prove refined structure results and provide a classification for $p \leqslant 13$. Our analysis shows that every CHM of order $4p$ with $p\equiv 1\bmod 4$ is equivalent to a Hadamard matrix with one of five distinct block structures, including Williamson type and (transposed) Ito matrices. If $p\equiv 3 \bmod 4$, then every CHM of order $4p$ is equivalent to a Williamson type or (transposed) Ito matrix.
Cocyclic Hadamard matrices (CHMs) were introduced by de Launey and Horadam as a class of Hadamard matrices with interesting algebraic properties. \'O Cath\'ain and R\"oder described a classification algorithm for …
Cocyclic Hadamard matrices (CHMs) were introduced by de Launey and Horadam as a class of Hadamard matrices with interesting algebraic properties. \'O Cath\'ain and R\"oder described a classification algorithm for CHMs of order $4n$ based on relative difference sets in groups of order $8n$; this led to the classification of all CHMs of order at most 36. Based on work of de Launey and Flannery, we describe a classification algorithm for CHMs of order $4p$ with $p$ a prime; we prove refined structure results and provide a classification for $p \leqslant 13$. Our analysis shows that every CHM of order $4p$ with $p\equiv 1\bmod 4$ is equivalent to a Hadamard matrix with one of five distinct block structures, including Williamson type and (transposed) Ito matrices. If $p\equiv 3 \bmod 4$, then every CHM of order $4p$ is equivalent to a Williamson type or (transposed) Ito matrix.
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 …
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.
Abstract 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 …
Abstract 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 .
Abstract Cocyclic Hadamard matrices (CHMs) were introduced by de Launey and Horadam as a class of Hadamard matrices (HMs) with interesting algebraic properties. Ó Catháin and Röder described a classification …
Abstract Cocyclic Hadamard matrices (CHMs) were introduced by de Launey and Horadam as a class of Hadamard matrices (HMs) with interesting algebraic properties. Ó Catháin and Röder described a classification algorithm for CHMs of order based on relative difference sets in groups of order ; this led to the classification of all CHMs of order at most 36. On the basis of work of de Launey and Flannery, we describe a classification algorithm for CHMs of order with a prime; we prove refined structure results and provide a classification for . Our analysis shows that every CHM of order with is equivalent to a HM with one of five distinct block structures, including Williamson‐type and (transposed) Ito matrices. If , then every CHM of order is equivalent to a Williamson‐type or (transposed) Ito matrix.
The central problem in the present paper is the construction of symmetric and of skew-symmetric ( = skew) matrices C of order v, with diagonal elements 0 and other elements …
The central problem in the present paper is the construction of symmetric and of skew-symmetric ( = skew) matrices C of order v, with diagonal elements 0 and other elements + 1 or — 1, satisfying The following necessary conditions are known: v ≡ 2 (mod 4) and a and b integers, for symmetric matrices C (Belevitch (1, 2), Raghavarao (14)), and v = 2 or v ≡ 0 (mod 4) for skew matrices C.
In this paper we obtain several results on the rank properties of Hadamard matrices (including Sylvester-Hadamard matrices) as well as generalized Hadamard matrices. These results are used to show that …
In this paper we obtain several results on the rank properties of Hadamard matrices (including Sylvester-Hadamard matrices) as well as generalized Hadamard matrices. These results are used to show that the classes of (generalized) Sylvester-Hadamard matrices and of (generalized) pseudo-noise matrices are equivalent, i.e., they can be obtained from each other by means of row/column permutations.
The primitive finite permutation groups containing a cycle are classified. Of these, only the alternating and symmetric groups contain a cycle fixing at least three points. The contributions of Jordan …
The primitive finite permutation groups containing a cycle are classified. Of these, only the alternating and symmetric groups contain a cycle fixing at least three points. The contributions of Jordan and Marggraff to this topic are briefly discussed.