The bounded-deficit conjecture for the FILL procedure
Statement
Let be the full -dimensional simplicial complex on vertices, and let be a non-trivial -cycle with coefficients in either or . Let 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 , with , such that for every non-trivial -cycle on , with coefficients in either or , the procedure can be made to produce a filling of deficit at most .
This is presented as a weaker conjecture than the paper's main conjecture: it predicts a deficit bounded independently of , although the bound may depend on . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.