Triviality conjecture for the orientation double cover of string diagrams

Let SD\mathcal{SD} be the space of oriented string diagrams and let SDu\mathcal{SD}^{\mathrm{u}} be the space of unoriented string diagrams. There is a double cover

SDSDu.\mathcal{SD}\longrightarrow\mathcal{SD}^{\mathrm{u}}.

Orientation-cover triviality conjecture. This double cover is trivial. The source does not provide a proof or status evidence for this assertion.

Sources & referencesView supporting material

Primary source

Gabriel C. Drummond-Cole, Kate Poirier and Nathaniel Rounds, “Chain-Level String Topology Operations”, arXiv:1506.02596 (2015).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.