Answers are grounded in this paper and cite their sources.
Let G(n) be the diameter of the n×n×n cube in the outer block turn metric, with positions modulo whole-cube rotation, and LB(n) the standard counting lower bound. We prove that the counting bound is not tight up to an additive constant: G(n) − LB(n) ≥ f(n) with f(n) = Θ(n/log² n). Explicitly, G(n) − LB(n) ≥ 1 for all n ≥ 101,465 and ≥ 11 for all n ≥ 10⁷. The proof combines 3,456 length-5 group identities found by a finite computation, a width-independence lemma that transfers them to every n, and a window–Bonferroni–Chernoff counting argument certified in 160-bit interval arithmetic with an analytic tail. Hence no formula G(n) = LB(n) + O(1) holds.
No takes yet. Share an insight, caveat, or question.
JiwonByun (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: