Browsing by Author "Álvarez Solano, Víctor"
Now showing items 1-20 of 46
-
Article
A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares
(Springer, 2019)Latin squares are used as scramblers on symmetric-key algorithms that generate pseudo-random sequences of the same length. ...
-
Chapter of Book
A genetic algorithm for cocyclic hadamard matrices
(2006)A genetic algorithm for finding cocyclic Hadamard matrices is described. Though we focus on the case of dihedral groups, ...
-
Presentation
A Heuristic Procedure with Guided Reproduction for Constructing Cocyclic Hadamard Matrices
(Springer, 2009)A genetic algorithm for constructing cocyclic Hadamard matrices over a given group is described. The novelty of this ...
-
Chapter of Book
A Mathematica Notebook for Computing the Homology of Iterated Products of Groups
(2006)Let G be a group which admits the structure of an iterated product of central extensions and semidirect products of abelian ...
-
Article
A Mixed Heuristic for Generating Cocyclic Hadamard Matrices
(Springer, 2018)A way of generating cocyclic Hadamard matrices is described, which combines a new heuristic, coming from a novel notion ...
-
Article
A System of Equations for Describing Cocyclic Hadamard Matrices
(Wiley, 2008)Given a basis equation image for 2-cocycles equation image over a group G of order equation image, we describe a nonlinear ...
-
Presentation
ACS Searching for D4t-Hadamard Matrices
(Springer, 2010)An Ant Colony System (ACS) looking for cocyclic Hadamard matrices over dihedral groups D4t is described. The underlying ...
-
Article
Algebra Structures on the Comparison of the Reduced Bar Construction and the Reduced W-Construction
(Taylor and Francis, 2009)For a simplicial augmented algebra K, Eilenberg–Mac Lane constructed a chain map . They proved that g is a reduction ...
-
Article
Algebra Structures on the Twisted Eilenberg–Zilber Theorem
(Taylor and Francis, 2007)Let G, G′, and G ×τ G′ be three simplicial groups (not necessarily abelian) and C N (G) ⊗ t C N (G′) be the “twisted” ...
-
Article
Algorithms in Algebraic Topology and Homological Algebra: Problem of Complexity
(Springer, 2002)This review tackles the problem of the high computational complexity lying in most algorithms in algebraic topology and ...
-
Chapter of Book
An algorithm for computing cocyclic matrices developed over some semidirect products
(2001)An algorithm for calculating a set ofgenerators ofrepresentative 2-cocycles on semidirect product offinite abelian groups ...
-
Presentation
An algorithm for computing the first homology groups of CDGAs with linear differential
(Research Institute for Symbolic Computation, 1999)We design here a primary platform for computing the basic homological information of Commutative Differential Graded ...
-
Chapter of Book
Calculating cocyclic hadamard matrices in Mathematica: exhaustive and heuristic searches
(2006)We describe a notebook in Mathematica which, taking as input data a homological model for a finite group G of order |G| = ...
-
Article
Cartan's contructions and the twisted Eilenberg-Zilber theorem
(De Gruyter, 2010) - Presentation
-
Article
Cocyclic Hadamard matrices over Latin rectangles
(Elsevier, 2019)In the literature, the theory of cocyclic Hadamard matrices has always been developed over finite groups. This paper ...
-
Chapter of Book
Comparison maps for relatively free resolutions
(2006)Let Λ be a commutative ring, A an augmented differential graded algebra over Λ (briefly, DGA-algebra) and X be a relatively ...
- PhD Thesis
-
Presentation
Computing “Small” 1–Homological Models for Commutative Differential Graded Algebras
(Springer, 2000)We use homological perturbation machinery specific for the algebra category [13] to give an algorithm for computing the ...
- PhD Thesis