ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥1n\geq 1 be fixed, and let dMpd^p_{\mathcal{M}} and dIpd^p_{\mathcal I} denote the corresponding distances on finitely presented nn-parameter persistence modules, with dIpd^p_{\mathcal I} considered specifically for 22-parameter modules. Computational complexity conjecture. (i) For fixed n≥1n\geq 1, the distance dMpd^p_{\mathcal{M}} on finitely presented nn-parameter persistence modules is exactly computable in polynomial time. (ii) Computing dIpd^p_{\mathcal I} on finitely presented 22-parameter persistence modules is NP-hard, for all p∈[1,∞]p\in[1,\infty]. These computational claims concern the complexity of the distances whose approximation and computation are discussed in the paper; both assertions are left to future work.

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.