OFFSET
1,1
COMMENTS
The author conjectures that this is the minimum volume of an axis-aligned bounding box which includes the shortest minimum-link circuit joining all the vertices of the cube {0,1}^3 (i.e., the closed polygonal chains consisting of exactly 6 edges visiting all the points of the set {(0,0,0),(0,0,1),(0,1,0),(0,1,1),(1,0,0),(1,0,1),(1,1,0),(1,1,1)}).
In detail, such a circuit of 6 links is given by (1/2,1+phi,1/2)-((1-phi)/2,0,(1+phi)/2)-((phi+1)/2,0, (1-phi)/2)-(1/2,1+phi,1/2)-((phi+1)/2,0,(phi+1)/2)-((1-phi)/2,0,(1-phi)/2(1/2,1+phi,1/2), where phi := (1+sqrt(5))/2 (see A001622).
Then, phi*(2*phi + 1) = phi^2*(phi + 1) since phi - 1 = 1/phi.
LINKS
Roberto Rinaldi and Marco Ripà, Optimal cycles enclosing all the nodes of a k-dimensional hypercube, arXiv:2212.11216 [math.CO], 2022.
Marco Ripà, General uncrossing covering paths inside the Axis-Aligned Bounding Box, Journal of Fundamental Mathematics and Applications, Volume 4, 2021, Number 2, Pages 154-166.
FORMULA
Equals (7 + 3*sqrt(5))/2.
Equals phi^2*(phi + 1), where phi = (1 + sqrt(5))/2.
EXAMPLE
6.8541019662496845446137605030969...
MATHEMATICA
RealDigits[3*GoldenRatio + 2, 10, 120][[1]] (* Amiram Eldar, Jul 23 2024 *)
CROSSREFS
KEYWORD
AUTHOR
Marco Ripà, Jul 22 2024
STATUS
approved