An Algorithm for Computing Cocyclic Matrices Developed over Some Semidirect Products
نویسندگان
چکیده
An algorithm for calculating a set of generators of representative 2-cocycles on semidirect product of finite abelian groups is constructed, in light of the theory over cocyclic matrices developed by Horadam and de Launey in [7,8]. The method involves some homological perturbation techniques [3,1], in the homological correspondent to the work which Grabmeier and Lambe described in [12] from the viewpoint of cohomology. Examples of explicit computations over all dihedral groups D4t are given, with aid of Mathematica.
منابع مشابه
(Co)homology of iterated semidirect products of finitely generated abelian groups
Let G be a group which admits the structure of an iterated semidirect product of finitely generated abelian groups. We provide a method for constructing a free resolution : X → ZZ of the integers over the group ring of G. The heart of this method consists of calculating an explicit contraction from the reduced bar construction of the group ring of G, B(ZZ[G]), to the reduced complex of X. Such ...
متن کاملCocyclic Development of Designs
We present the basic theory of cocyclic development of designs, in which group development over a finite group G is modified by the action of a cocycle defined on G x G. Negacyclic and w-cyclic development are both special cases of cocyclic development. Techniques of design construction using the group ring, arising from difference set methods, also apply to cocyclic designs. Important classes ...
متن کاملA Genetic Algorithm for Cocyclic Hadamard Matrices
A genetic algorithm for finding cocyclic Hadamard matrices is described. Though we focus on the case of dihedral groups, the algorithm may be easily extended to cover any group. Some executions and examples are also included, with aid of Mathematica 4.0.
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملThe cocyclic Hadamard matrices of order less than 40
In this paper all cocyclic Hadamard matrices of order less than 40 are classified. That is, all such Hadamard matrices are explicitly constructed, up to Hadamard equivalence. This represents a significant extension and completion of work by de Launey and Ito. The theory of cocyclic development is discussed, and an algorithm for determining whether a given Hadamard matrix is cocyclic is describe...
متن کامل