✦ LIBER ✦

Graph Approach to the Computation of the Homology of Continuous Maps

✍ Scribed by Konstantin Mischaikow; Marian Mrozek; Pawel Pilarczyk

Book ID: 106297143
Publisher: Springer-Verlag
Year: 2005
Tongue: English
Weight: 379 KB
Volume: 5
Category: Article
ISSN: 1615-3375
DOI: 10.1007/s10208-004-0125-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Čech Type Approach to Computing Homology

Čech Type Approach to Computing Homology of Maps

✍ Marian Mrozek 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 784 KB

Directly computing the generators of ima

Directly computing the generators of image homology using graph pyramids

✍ Samuel Peltier; Adrian Ion; Walter G. Kropatsch; Guillaume Damiand; Yll Haxhimus 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 524 KB

The graph spaces of connectivity maps

✍ Keith Whittington 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 616 KB

On the numerical computation of Poincaré

On the numerical computation of Poincaré maps

✍ M. Henon 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 895 KB

The homology of a locally finite graph w

The homology of a locally finite graph with ends

✍ Reinhard Diestel; Philipp Sprüssel 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 434 KB

The Modular Homology of Inclusion Maps a

The Modular Homology of Inclusion Maps and Group Actions

✍ Valery Mnukhin; Johannes Siemons 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 470 KB

Let 0 be a finite set of n elements, R a ring of characteristic p>0 and denote by M k the R-module with k-element subsets of 0 as basis. The set inclusion map : M k Ä M k&1 is the homomorphism which associates to a k-element subset 2 the sum (2)=1 1 +1 2 + } } } +1 k of all its (k&1)-element subsets