Injective cubes require noninjective relations
Statement
Computation of cubical homology
When computing cubical homology of a simple graph , one builds a cubical set whose -cubes are maps and then takes the usual cubical homology of this cubical set.
Can cubical homology of a graph be computed using only injective maps ? Should this restriction be made at the cubical set or chain complex level?
Record
- Source
- Added
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.