ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KndK_n^d be the full dd-dimensional simplicial complex on nn vertices, and let Zd−1Z^{d-1} be a non-trivial (d−1)(d-1)-cycle with coefficients in either F2\mathbb{F}_2 or Q\mathbb{Q}. Let FILL⁡(Znd−1)\operatorname{FILL}(Z_n^{d-1}) denote the recursive filling procedure used in the source, and let the deficit of a filling measure how far its support is from the largest possible support.

Bounded-deficit conjecture. There exists a function α:N↦N\alpha:\mathbb{N}\mapsto\mathbb{N}, with d↦αdd\mapsto\alpha_d, such that for every non-trivial (d−1)(d-1)-cycle Zd−1Z^{d-1} on KndK_n^d, with coefficients in either F2\mathbb{F}_2 or Q\mathbb{Q}, the procedure FILL⁡(Znd−1)\operatorname{FILL}(Z_n^{d-1}) can be made to produce a filling of deficit at most αd\alpha_d.

This is presented as a weaker conjecture than the paper's main conjecture: it predicts a deficit bounded independently of nn, although the bound may depend on dd. The source gives no resolution status.

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.