Weak higher-category structure conjecture for representable constructible polygraphs

Let CPol\mathbf{CPol} be the category of constructible polygraphs and let RCPol\mathbf{RCPol} be the category of representable constructible polygraphs and strong maps. For a constructible polygraph XX, let XOX_{\mathbf O} denote the restriction of its presheaf to the full subcategory O\mathbf O of constructible atoms. A map is strong if it sends nn-equivalences to nn-equivalences. Weak higher-category conjecture. If f:XYf:X\to Y is a strong map of representable constructible polygraphs, then XOX_{\mathbf O} and YOY_{\mathbf O} admit structures of algebraic weak higher categories, and fO:XOYOf_{\mathbf O}:X_{\mathbf O}\to Y_{\mathbf O} is a functor of weak higher categories. This would provide an algebraic weak higher-categorical structure on the underlying graphs of representable constructible polygraphs; the source leaves both the precise algebraic definition and the assertion unresolved.

Sources & referencesView supporting material

Primary source

Amar Hadzihasanovic, “A combinatorial-topological shape category for polygraphs”, arXiv:1806.10353 (2019).

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.