Abstract. An algorithm for calculating a set of generators of represen-tative 2-cocycles on semidirect product of finite abelian groups is con-structed, in light of the theory over cocyclic matrices developed by Ho-radam 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.
We describe a notebook in Mathematica which, taking as input data a homological model for a finite g...
Provided that a cohomological model for G is known, we describe a method for constructing a basis fo...
In this thesis, we investigate group actions on certain families of pairwise combinatorial designs,...
An algorithm for calculating a set ofgenerators ofrepresentative 2-cocycles on semidirect product of...
Let G be a semidirect product of finitely generated Abelian groups. We provide a method for construc...
An alternate method for constructing (Hadamard) cocyclic matrices over a finite group GG is describe...
AbstractIn this paper we provide a method of explicitly determining, for a given finite group G and ...
Abstract. Given a basis B = {f1,..., fk} for 2-cocycles f: G×G → {±1} over a group G of order |G | ...
In this paper, we describe some necessary and sufficient conditions for a set of coboundaries to yi...
This thesis is a compilation of results dealing with cocyclic development of pairwise combinatorial ...
We reinterpret the classical theory of cocyclic operations in terms of permutations and homotopy eq...
A genetic algorithm for finding cocyclic Hadamard matrices is described. Though we focus on the case...
Given a basis equation image for 2-cocycles equation image over a group G of order equation image, w...
AbstractIn this paper we will compute the cohomology rings of the title as algebras over the Steenro...
AbstractMany codes and sequences designed for robust or secure communications are built from Hadamar...
We describe a notebook in Mathematica which, taking as input data a homological model for a finite g...
Provided that a cohomological model for G is known, we describe a method for constructing a basis fo...
In this thesis, we investigate group actions on certain families of pairwise combinatorial designs,...
An algorithm for calculating a set ofgenerators ofrepresentative 2-cocycles on semidirect product of...
Let G be a semidirect product of finitely generated Abelian groups. We provide a method for construc...
An alternate method for constructing (Hadamard) cocyclic matrices over a finite group GG is describe...
AbstractIn this paper we provide a method of explicitly determining, for a given finite group G and ...
Abstract. Given a basis B = {f1,..., fk} for 2-cocycles f: G×G → {±1} over a group G of order |G | ...
In this paper, we describe some necessary and sufficient conditions for a set of coboundaries to yi...
This thesis is a compilation of results dealing with cocyclic development of pairwise combinatorial ...
We reinterpret the classical theory of cocyclic operations in terms of permutations and homotopy eq...
A genetic algorithm for finding cocyclic Hadamard matrices is described. Though we focus on the case...
Given a basis equation image for 2-cocycles equation image over a group G of order equation image, w...
AbstractIn this paper we will compute the cohomology rings of the title as algebras over the Steenro...
AbstractMany codes and sequences designed for robust or secure communications are built from Hadamar...
We describe a notebook in Mathematica which, taking as input data a homological model for a finite g...
Provided that a cohomological model for G is known, we describe a method for constructing a basis fo...
In this thesis, we investigate group actions on certain families of pairwise combinatorial designs,...