Torsion criterion for graph cohomology of algebras
Torsion criterion for graph cohomology of algebras
Let be a graph, and let denote its graph cohomology associated with the algebra . A graph is loopless if it has no loops, and a cycle has order equal to its number of edges. Torsion criterion for . The cohomology contains torsion if and only if is loopless and contains a cycle of order at least . In this case, has torsion of order dividing . This generalizes the corresponding result for ; the source later notes that this conjecture was proved in the cited work.
Sources & referencesView supporting material
Primary source
Laure Helme-Guizon, Jozef H. Przytycki and Yongwu Rong, “Torsion in Graph Homology”, arXiv:math/0507245 (2006).
Progress summary
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.