Thickness bounds imply recursively bounded refinement complexity
Statement
Let be a simplicial complex, let be positive, and let denote the unit ball. A piecewise smooth embedding of into has thickness when it satisfies the paper's thickness condition. Thickness–refinement conjecture. If admits a piecewise smooth embedding of thickness into , more specifically into , then
where is a recursively computable function of . This technical conjecture would connect geometric thickness with refinement complexity and is intended to support a thickness analogue of the non-recursive refinement-complexity theorem. The paper notes that proving it is technically difficult because its minimal thickness definition does not control the proximity of adjacent simplices.
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.