Buscar
Mostrando ítems 1-10 de 14
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 product X( , m, , 0, n) = K( ,m)× K( 0, n) of Eilenberg-Mac Lane spaces is given. The chief ...
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 suitable Ha- damard matrices exist. Uncertainty about the existence of Hadamard matrices on all orders ...
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 tool in this approach is given by the Homological Perturbation Theory particularized for the algebra ...
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 Algebras (brie y, CDGAs), endowed with linear differential. All the algorithms have been implemented ...
Ponencia
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 about a third of a Hadamard matrix (which is the best asymptotic result known so far, [8]) is achieved. ...
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 algorithm is the guided heuristic procedure for reproduction, instead of the classical crossover and ...
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 family of Goethals-Seidel Hadamard matrices is (pseudo)-cocyclic over a certain family of quasigroups. ...
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 differential structure of a small 1– homological model for commutative differential graded algebras ...
Ponencia