ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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:X→Yf: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:XO→YOf_{\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.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.