Search arXiv⌕ Search

arXiv · 0706.2118

A method for integral cohomology of posets

Abstract

We present a method to compute integral cohomology of posets. This toolbox is applicable as soon as the sub-posets under each object possess certain structure. This is the case for simplicial complexes and simplex-like posets. The method is based on homological algebra arguments in the category of functors and on a spectral sequence built upon the poset. We show its relation to discrete Morse theory. As application we give an alternative proof of Webb's conjecture for saturated fusion systems and we compute the cohomology of Coxeter complexes for finite and infinite Coxeter groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Antonio Diaz. 2007-06-14. A method for integral cohomology of posets. https://arxiv.org/abs/0706.2118

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A derived Chouinard's theorem for infinite groups

We establish a Chouinard-type theorem for modules over algebras of cochains on the classifying spaces of a broad class of infinite groups, allowing commutative ring spectra as coefficients. We then use this result to study finiteness properties of the integral cohomology rings of certain infinite groups, as well as stratification of the corresponding module categories. In particular, we complete the (co)stratification of module categories associated to homotopical groups over fields of positive characteristic.

math.AT↗

Galois Connections in Persistent Homology

We present a new language for persistent homology in terms of Galois connections. This language has two main advantages over traditional approaches. First, it simplifies and unifies central concepts such as interleavings and matchings. Second, it provides access to Rota's Galois connection theorem -- a powerful tool with many potential applications in applied topology. To illustrate this, we use Rota's Galois connection theorem to give a substantially easier proof of the bottleneck stability theorem. Finally, we use this language to establish relationships between various notions of multiparameter persistence diagrams.

math.AT↗