Unitization by folding finitely many infinite paths in a graph
Statement
Let a graph have all but finitely many vertices lying on finitely many infinite paths. Fold each of these paths so that it produces countably infinitely many edges between two distinct vertices. Folding unitization conjecture. The resulting graph algebra is a unitization of the original graph algebra. The conjecture concerns extending the finite-graph construction described above to graphs with finitely many infinite paths; the supplied text gives no resolution or further conditions.
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.