About twenty-five years ago, Horadam and de Launey introduced the cocyclic development of designs, from which the notion of cocyclic Hadamard matrices developed over a group was readily derived. Much more recently, it has been proved that this notion may naturally be extended to define cocyclic Hadamard matrices developed over a loop. This paper delves into this last topic by introducing the concepts of coboundary, pseudocoboundary and pseudococycle over a quasigroup, and also the notion of the pseudococyclic Hadamard matrix. Furthermore, Goethals-Seidel loops are introduced as a family of Moufang loops so that every Hadamard matrix of Goethals-Seidel type (which is known not to be cocyclically developed over any group) is actually pseudococyclically developed over them. Finally, we also prove that, no matter if they are pseudococyclic matrices, the usual cocyclic Hadamard test is unexpectedly applicable.
One of the fastest known general techniques for computing permanents is Ryser’s formula. On this note, we show that this formula over Sylvester Hadamard matrices of order , , can be carried out by enumerating m-variable Boolean functions with an arbitrary Walsh spectrum. As a consequence, the quotient might be a measure of the “density” of m-variable Boolean functions with high nonlinearity.
For a simplicial augmented algebra K, Eilenberg–Mac Lane constructed a chain map . They proved that g is a reduction (homology isomorphism) and conjectured that it is also the injection of a contraction (special homotopy equivalence). The contraction is followed at once by using homological perturbation techniques. If K is commutative, Eilenberg–Mac Lane proved that g is a morphism of DGA-algebras. The present article is devoted to proving that f and φ satisfy certain multiplicative properties (weaker than g) and showing how they can be used for computing in an economical way the homology of twisted cartesian products of two Eilenberg–Mac Lane spaces.