Buscar
Mostrando ítems 1-6 de 6
Artículo
Computing Adem Cohomology Operations
(Cornell University, 2006)
We deal with the problem of obtaining explicit simplicial formu- lae defining the classical Adem cohomology operations at the cochain level. Having these formulae at hand, we design an algorithm for com- puting these ...
Artículo
Simplification techniques for maps in simplicial topology
(2005)
This paper offers an algorithmic solution to the problem of obtaining “economical” formulae for some maps in Simplicial Topology, having, in principle, a high computational cost in their evaluation. In particular, maps of ...
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 homological algebra. Three particular algorithms are considered: the computation of the homology of ...
Artículo
Cohomología 3D y visualización
(Real Sociedad Matemática Española, 2004)
Proponemos un método para visualizar conceptos altamente abstractos en objetos tridimensionales, representados éstos como complejos simpliciales. Dichos conceptos son ciertos invariantes topológicos como los grupos de ...
Artículo
On the cohomology of 3D digital images
(2005)
We propose a method for computing the cohomology ring of three-dimensional (3D) digital binary-valued pictures. We obtain the cohomology ring of a 3D digital binary-valued picture I , via a simplicial complex K(I)K(I) ...
Artículo
HPT and cocyclic operations
(International Press, 2005)
We reinterpret the classical theory of cocyclic operations in terms of permutations and homotopy equivalences of explicit chains. The essential tools we use are Homological Perturbation Theory and Eilenberg–Zilber ...