The recursive upper-bound conjecture for neighborly boxes
A box in is an axis-parallel -dimensional cuboid. Two boxes are -neighborly if their intersection has dimension strictly smaller than but at least . Let be the maximum size of a family of pairwise -neighborly boxes in . We use the boundary conventions for all and for . The recursive upper-bound conjecture. For every ,
This supposition was proposed as a possible route to the value in the asymptotic limit conjecture. Its status is not resolved in the supplied text.
References
2 papers in this index state this conjecture (2022–2025). The statement above is taken from the most recent of them; the others are arXiv:2212.05133.
Source: Jarosław Grytczuk, Andrzej P. Kisielewicz and Krzysztof Przesławski, “Neighborly boxes and strings with jokers; constructions and asymptotics”, arXiv:2508.20648 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.