Contraction conjecture for shortest homology basis loops in planar metric graphs
Contraction conjecture for shortest homology basis loops in planar metric graphs
Let be a planar metric graph, meaning a geodesic space homeomorphic to a finite -dimensional simplicial complex that admits a planar embedding. Let be a coefficient group, and let be a simple closed loop such that its homology class is a member of a shortest homology basis of . A contraction is a homotopy through maps from to itself from the identity map to a retraction onto . Planar metric graph contraction conjecture. There exists a contraction . The conjecture asks whether planarity makes the condition that belong to a shortest homology basis sufficient for contracting the entire metric graph onto ; the preceding nonplanar examples show that the analogous assertion fails without planarity.
Sources & referencesView supporting material
Primary source
Žiga Virk, “Contractions in persistence and metric graphs”, arXiv:2201.11478 (2022).
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.