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
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 ...
Artículo
On p-minimal homological models of twisted tensor products of elementary complexes localised over a prime
(American Mathematical Society, 1999)
In this paper, working over Z(p) and using algebra perturbation results from [18], p-minimal homological models of twisted tensor products (TTPs) of Cartan’s elementary complexes are obtained. Moreover, making use of 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 Algebras (brie y, CDGAs), endowed with linear differential. All the algorithms have been implemented ...
Artículo
An algorithm computing homotopy groups
(Elsevier, 1996)
An algorithm computing homotopy groups of a reduced simplicial set with effective homology is described, using the Whitehead tower method.
Ponencia
Steenrod reduced powers and computability
(International Association for Mathematics and Computers in Simulation, 1999)
Ponencia
Computing Cocycles on Simplicial Complexes
(Springer, 1999)
In this note, working in the context of simplicial sets [17], we give a detailed study of the complexity for computing chain level Steenrod squares [20, 21], in terms of the number of face operators required. This analysis ...
Artículo
Una curiosa combinación de Topología, Álgebra y Combinatoria: los cuadrados de Steenrod
(Real Sociedad Matemática Española, 1998)
Ponencia
analyzing the transference of the coalgebra structure on the homology CDGAs
(International Association for Mathematics and Computers in Simulation, 1999)
Artículo
On the computability of the Steenrod squares
(Springer, 1996)
In questo lavoro offriamo in modo esplicito le formule di una serie de morfismi che controUano la mancanza di commutativit~ del prodotto cup a livello di cocateni, supponendo di lavorare con insiemi sempliciali; queste ...