Abstract:Machine computation of the discrete homology of graphs has stopped at degree two. We present an algorithm that reaches degree four. It generates the singular cubes inductively, pairing cubes one degree down instead of filtering all set maps; quotients the chain modules by the hyperoctahedral group action, over a field of sufficiently large characteristic; and shrinks the graph beforehand using homotopy invariance. The fourth homology group of the five-cycle, previously beyond the reach of machine computation, is computed in under two days.
From: Chris Kapulkin [view email]
[v1]
Sun, 13 Oct 2024 17:50:49 UTC (46 KB)
[v2]
Sat, 24 May 2025 14:06:07 UTC (45 KB)
[v3]
Sun, 26 Jul 2026 16:15:53 UTC (34 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。