Answers are grounded in this paper and cite their sources.
This unrefereed negative research record documents a failed proof route for capture-time bounds on Fibonacci cubes. Elementary three-center and four-center coverings are constructed for even- and odd-dimensional Fibonacci cubes. The manuscript explicitly limits the infinite-family conclusion to a comparison between covering-center counts and known cop numbers, not an inequality between covering radius and capture time. In Gamma_10, a radius-4 cover with three centers coexists with a separately audited computer-assisted capture time of five moves. For Gamma_11, a concrete four-center configuration satisfies two particular static necessary checks, but neither a four-move win nor a five-move lower bound is established. A previously reported Gamma_11 five-move lower bound is withdrawn. Mathematical novelty is inconclusive; references have not been exhaustively screened; no human peer review has been performed. The point of publication is to preserve the verified limits of an unsuccessful approach and its reproducibility evidence, without exaggerating what has been proved. All rights reserved.
No takes yet. Share an insight, caveat, or question.
Ryutaro Yonezu (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: