Vanishing conjecture for higher path homology of circulant digraphs
Vanishing conjecture for higher path homology of circulant digraphs
Let be the circulant digraph with connection set
Higher path-homology vanishing conjecture. The path homology of vanishes in every degree at least three:
The authors report that their computations produce no nontrivial path homology in degrees greater than . The conjecture asserts that this pattern holds for all connection sets of the stated form; its general validity remains open.
Sources & referencesView supporting material
Primary source
Xinxing Tang and Shing-Tung Yau, “Path homology of circulant digraphs”, arXiv:2602.04140 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.