43 research outputs found
Orthogonal Designs from Negacyclic Matrices
We study the use of negacyclic matrices to form orthogonal designs and hence Hadamard matrices. We give results for all possible tuple for order 12, all but 3 for order 20 and all but 3 for order 28
A survey on modular Hadamard matrices
AbstractWe provide constructions of 32-modular Hadamard matrices for every size n divisible by 4. They are based on the description of several families of modular Golay pairs and quadruples. Higher moduli are also considered, such as 48,64,128 and 192. Finally, we exhibit infinite families of circulant modular Hadamard matrices of various types for suitable moduli and sizes
Cohomology-Developed Matrices -- constructing families of weighing matrices and automorphism actions
The aim of this work is to construct families of weighing matrices via their
automorphism group action. This action is determined from the
-cohomology groups of the underlying abstract group. As a consequence,
some old and new families of weighing matrices are constructed. These include
the Paley Conference, the Projective-Space, the Grassmannian, and the
Flag-Variety weighing matrices. We develop a general theory relying on low
dimensional group-cohomology for constructing automorphism group actions, and
in turn obtain structured matrices that we call \emph{Cohomology-Developed
matrices}. This "Cohomology-Development" generalizes the Cocyclic and Group
Developments. The Algebraic structure of modules of Cohomology-Developed
matrices is discussed, and an orthogonality result is deduced. We also use this
algebraic structure to define the notion of \emph{Quasiproducts}, which is a
generalization of the Kronecker-product
Implementing Brouwer's database of strongly regular graphs
Andries Brouwer maintains a public database of existence results for strongly
regular graphs on vertices. We implemented most of the infinite
families of graphs listed there in the open-source software Sagemath, as well
as provided constructions of the "sporadic" cases, to obtain a graph for each
set of parameters with known examples. Besides providing a convenient way to
verify these existence results from the actual graphs, it also extends the
database to higher values of .Comment: 18 pages, LaTe
Generalized binary arrays from quasi-orthogonal cocycles
Generalized perfect binary arrays (GPBAs) were used by Jedwab to
construct perfect binary arrays. A non-trivial GPBA can exist only if its energy
is 2 or a multiple of 4. This paper introduces generalized optimal binary arrays
(GOBAs) with even energy not divisible by 4, as analogs of GPBAs. We give a
procedure to construct GOBAs based on a characterization of the arrays in terms
of 2-cocycles. As a further application, we determine negaperiodic Golay pairs
arising from generalized optimal binary sequences of small length.Junta de Andalucía FQM-01