Perfil del autor: Álvarez Solano, Víctor
Datos institucionales
Nombre | Álvarez Solano, Víctor |
Departamento | Matemática Aplicada I |
Área de conocimiento | Matemática Aplicada |
Categoría profesional | Profesor Titular de Universidad |
Correo electrónico | Solicitar |
Estadísticas
-
Nº publicaciones
47
-
Nº visitas
4254
-
Nº descargas
5070
Publicaciones |
---|
Artículo
A computational approach to analyze the Hadamard quasigroup product
(American Institute of Mathematical Sciences (AIMS), 2023)
Based on the binary product described by any Latin square, the Hadamard quasigroup product is introduced in this paper as ... |
Artículo
Hadamard Matrices with Cocyclic Core
(MDPI, 2021)
Since Horadam and de Launey introduced the cocyclic framework on combinatorial designs in the 1990s, it has revealed itself ... |
Artículo
On Cocyclic Hadamard Matrices over Goethals-Seidel Loops
(MDPI, 2020)
About twenty-five years ago, Horadam and de Launey introduced the cocyclic development of designs, from which the notion ... |
Artículo
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. ... |
Artículo
Generating binary partial Hadamard matrices
(Elsevier, 2019)
This paper deals with partial binary Hadamard matrices. Although there is a fast simple way to generate about a half (which ... |
Artículo
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 ... |
Artículo
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 ... |
Artículo
GA Based Robust Blind Digital Watermarking
(Elsevier, 2018)
A genetic algorithm based robust blind digital watermarking scheme is presented. The experimental results show that our ... |
Artículo
Gröbner bases and cocyclic Hadamard matrices
(Elsevier, 2018)
Hadamard ideals were introduced in 2006 as a set of nonlin-ear polynomial equations whose zeros are uniquely related ... |
Ponencia |
Ponencia
Generating partial Hadamard matrices as solutions to a Constraint Satisfaction Problem characterizing cliques
(2017)
A procedure is described looking for partial Hadamard matrices, as cliques of a particular subgraph Gt of Ito’s Hadamard ... |
Ponencia
(Pseudo)-cocyclic (structured) Hadamard matrices over (quasi)groups
(2017)
Progressing on a survey of the state of the art of cocyclic constructions for Hadamard matrices, we will prove that the ... |
Ponencia |
Artículo
On D4t-Cocyclic Hadamard Matrices
(Wiley, 2016)
In this paper, we describe some necessary and sufficient conditions for a set of coboundaries to yield a cocyclic Hadamard ... |
Artículo
On ZZt × ZZ2 2-cocyclic Hadamard matrices
(Wiley, 2015)
A characterization of ZZt × ZZ22 -cocyclic Hadamard matrices is described, de- pending on the notions of distributions, ... |
Artículo
Determinants of (–1,1)-matrices of the skew-symmetric type: a cocyclic approach
(Walter de Gruyter GmbH, 2015)
An n by n skew-symmetric type (−1, 1)-matrix K = [ki,j ] has 1’s on the main diagonal and ±1’s elsewhere with ki,j = −kj,i. ... |
Artículo
On higher dimensional cocyclic Hadamard matrices
(2015)
Provided that a cohomological model for G is known, we describe a method for constructing a basis for n-cocycles over G, ... |
Artículo
Equivalences of Zt×Z22-cocyclic Hadamard matrices
(Cornell University, 2015)
One of the most promising structural approaches to resolving the Hadamard Conjecture uses the family of cocyclic matrices ... |
Artículo
Embedding cocylic D-optimal designs in cocylic Hadamard matrices
(International Linear Algebra Society, 2012)
A method for embedding cocyclic submatrices with “large” determinants of orders 2t in certain cocyclic Hadamard matrices ... |
Artículo
Homological models for semidirect products of finitely generated Abelian groups
(2012)
Let G be a semidirect product of finitely generated Abelian groups. We provide a method for constructing an explicit ... |
Artículo
The maximal determinant of cocyclic (−1, 1)-matrices over D2t
(Elsevier, 2012)
Cocyclic construction has been successfully used for Hadamard matrices of order n. These -matrices satisfy that and give ... |
Tesis Doctoral |
Ponencia
Searching for partial Hadamard matrices
(Universidade de Santiago de Compostela, Servicio de Publicaciones, 2010)
Three algorithms looking for pretty large partial Hadamard ma- trices are described. Here “large” means that hopefully ... |
Artículo
Cartan's contructions and the twisted Eilenberg-Zilber theorem
(De Gruyter, 2010)
|
Ponencia
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 ... |
Artículo
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 ... |
Artículo
The homological reduction method for computing cocyclic Hadamard matrices
(2009)
An alternate method for constructing (Hadamard) cocyclic matrices over a finite group GG is described. Provided that a ... |
Ponencia
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 ... |
Ponencia
Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t
(Springer, 2009)
A new reduction on the size of the search space for cocyclic Hadamard matrices over dihedral groups D4t is described, in ... |
Artículo
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 ... |
Ponencia
Error correcting codes from quasi-Hadamard matrices
(Springer, 2007)
Levenshtein described in [5] a method for constructing error correcting codes which meet the Plotkin bounds, provided ... |
Artículo
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” ... |
Capítulo de Libro
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 ... |
Capítulo de Libro
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, ... |
Capítulo de Libro
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| = ... |
Capítulo de Libro
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 ... |
Artículo |
Tesis Doctoral |
Artículo
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 ... |
Ponencia
Matrices cocíclicas de Hadamard sobre productos semidirectos
(Alberto Márquez, 2002)
|
Tesis Doctoral |
Ponencia
El Proyecto CHATA
(Universidad de Sevilla, 2001)
En este art´ıculo, se pretende dar una visi´on general y lo m´as divulgativa posible sobre los prop´ositos y objetivos del ... |
Capítulo de Libro
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 ... |
Ponencia
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 ... |
Ponencia
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 ... |
Ponencia
On the computability of the p-local homology of twisted cartesian products of Eilenberg-Mac Lane spaces
(Universidade do Minho, 1997)
Working in the framework of the Simplicial Topology, a method for calculating the p-local homology of a twisted cartesian ... |
Ponencia
Homological perturbation theory and computability of Hochschild and cyclic homologies of CDGAs
(Diffiety Institute of the Russian Academy of Natural Sciences, 1997)
We establish an algorithm computing the homology of commutative differential graded algebras (briefly, CDGAs). The main ... |