Computing homology.
Kaczynski, Tomasz, Mischaikow, Konstantin, Mrozek, Marian (2003)
Homology, Homotopy and Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Computation of cohomology operations on finite simplicial complexes.”
Computing homology.
Non-abelian cohomology via parity quasi-complexes.
Ionescu, Lucian M. (2004)
Homology, Homotopy and Applications
Similarity:
More about the (co)homology of groups and associative algebras.
Inassaridze, Hvedri (2005)
Homology, Homotopy and Applications
Similarity:
Invariance proof of simplicial homology and cohomology groups without using subdivisions or axiomatic approach
Hu, Sze-Tsen (1970)
Portugaliae mathematica
Similarity:
Pairings, duality, amenability and bounded cohomology
Jacek Brodzki, Graham A. Niblo, Nick J. Wright (2012)
Journal of the European Mathematical Society
Similarity:
We give a new perspective on the homological characterizations of amenability given by Johnson & Ringrose in the context of bounded cohomology and by Block & Weinberger in the context of uniformly finite homology. We examine the interaction between their theories and explain the relationship between these characterizations. We apply these ideas to give a new proof of non-vanishing for the bounded cohomology of a free group.
Cochain operations and higher cohomology operations
Stephan Klaus (2001)
Cahiers de Topologie et Géométrie Différentielle Catégoriques
Similarity:
The cohomology ring of free loop spaces.
Menichi, Luc (2001)
Homology, Homotopy and Applications
Similarity:
Isomorphic cohomology Yields isomorphic homology.
Marek Golasinksi, D. Lima Goncalves (1997)
Manuscripta mathematica
Similarity:
Effective homology for homotopy colimit and cofibrant replacement
Marek Filakovský (2014)
Archivum Mathematicum
Similarity:
We extend the notion of simplicial set with effective homology presented in [22] to diagrams of simplicial sets. Further, for a given finite diagram of simplicial sets such that each simplicial set has effective homology, we present an algorithm computing the homotopy colimit as a simplicial set with effective homology. We also give an algorithm computing the cofibrant replacement of as a diagram with effective homology. This is applied to computing of equivariant cohomology...
On a theorem of Borsuk
J. Moore (1956)
Fundamenta Mathematicae
Similarity: