Covering conjecture for discrete singular cubical homology of graphs
Statement
Let be a graph, and let be a covering of by subgraphs such that every edge, -cycle, and -cycle of is contained in some . Let denote the cubical chain complex generated by cubes whose images are contained in some . Covering conjecture. One should have
The conjecture proposes a Mayer–Vietoris-type covering principle for discrete singular cubical homology. The source presents it as a speculation and does not establish it; the paper notes that related covering results are available for graphs with no -cycles or -cycles, where the higher-dimensional homology groups vanish.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.