• Publications
  • Influence
Processor Interconnection Networks from Cayley Graphs
Abstract Cayley graphs of groups are presently being considered by the computer science community as models of architectures for large scale parallel processor computers. In the first section of thisExpand
On twin prime power Hadamard matrices
In this paper, we show that exactly one Hadamard matrix constructed using the twin prime power method is cocyclic. Expand
Automorphisms of higher‐dimensional Hadamard matrices
This article derives from first principles a definition of equivalence for higher-dimensional Hadamard matrices and thereby a definition of the automorphism group for higher-dimensional HadamardExpand
On cocyclic weighing matrices and the regular group actions of certain paley matrices
In this paper we consider cocyclic weighing matrices. Cocyclic development of a weighing matrix is shown to be related to regular group actions on the points of the associated group divisible design.Expand
On the automorphisms of Paley's type II Hadamard matrix
We determine the automorphism group of Paley's type II Hadamard matrix. Expand
Groups of Permutation Polynomials over Finite Fields
LetFbe a finite field. We apply a result of Thierry Berger (1996,Designs Codes Cryptography,7, 215?221) to determine the structure of all groups of permutations onFgenerated by the permutationsExpand
Short two-variable identities for finite groups
Abstract In this paper, we consider finite groups G satisfying identities of the form . We focus on identities with r small, , and all coprime to the order of G. We show that for r = 2,3 and 5, GExpand
A Characterization of Janko's Simple Group J4 by Centralizers of Elements of Order 3
In a recent paper [lo], Zvonimir Janko exhibited strong evidence for the existence of a new type of simple group. However, the existence and uniqueness of a simple group satisfying Janko’s hypothesisExpand
On the Least Number of Cell Orbits of a Hadamard Matrix of Order n
The automorphism group of any Hadamard ma- trix of order n acts on the set of cell co-ordinates f(i;j)ji;j = 1;2;:::;ng. Let f(n) denote the least number of cell orbits amongst all the HadamardExpand