Abstract:We develop a new technique for computing higher limits of functors over filtered posets by constructing explicit fibrant replacements within a suitable model category structure. We apply this procedure to develop two systematic vanishing bounds for the higher limits. For the first one, we define a combinatorial bound derived from the poset's Hasse diagram. This bound systematically outperforms classical poset-length bounds and provides critical stopping criteria for computing the sheaf cohomology of hypergraphs and higher-order interaction networks. The second one is an inductive bound driven by the local algebraic information of the functor. We demonstrate the robustness of this theoretical framework by applying it to two distinct domains: establishing vanishing bounds for Mackey functors over posets with local quasi-units, and bounding the unnormalised Khovanov homology of the torus knot T(3,4).
| Subjects: | Algebraic Topology (math.AT); Commutative Algebra (math.AC) |
| MSC classes: | 8G10, 18N40, 55P99, 06A07, 05C65, 57K18 |
| Cite as: | arXiv:2407.14205 [math.AT] |
| (or arXiv:2407.14205v2 [math.AT] for this version) | |
| https://doi.org/10.48550/arXiv.2407.14205 arXiv-issued DOI via DataCite |
From: Guille Carrion Santiago [view email]
[v1]
Fri, 19 Jul 2024 11:02:03 UTC (15 KB)
[v2]
Mon, 25 May 2026 12:13:05 UTC (48 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。