A family of acyclic functors

Antonio Diaz

Home/Archive/arXiv

arXiv · 0706.2113

A family of acyclic functors

Antonio Diaz

View original source ↗Read source document ↗Export metadata ↓

Abstract

We determine a family of functors from a poset to abelian groups such that the higher direct limits vanish on them. This is done by first characterizing the projective functors. Then a spectral sequence arising from the grading of the poset is used. Also the dual version for injective functors and higher inverse limits is included. Graded posets include simplicial complexes, subdivision categories and simplex-like posets.

Explore related subjects

math.AT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Antonio Diaz. 2007-11-08. A family of acyclic functors. https://arxiv.org/abs/0706.2113

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

KEEP EXPLORING

Related papers

arXiv2026

The homology of $\mathrm{Out}(F_8)$ and $\mathrm{Aut}(F_7)$

We compute the rational homology of $\mathrm{Out}(F_8)$ and $\mathrm{Aut}(F_7)$, and several related groups. We also show that the Eisenstein classes in $H_7(\mathrm{Aut}(F_5))$ and $H_{11}(\mathrm{Aut}(F_7))$ are zero.

math.AT↗

arXiv2026

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↗

arXiv2026

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↗