Optimal Steiner tree construction conjecture for regular simplices
Let be the number of terminals in a regular simplex, and let . The construction described immediately before the claim recursively splits Steiner points and coordinates from a known Steiner tree. Optimal construction conjecture. This construction yields an optimal Steiner tree for every regular -simplex when , and its natural generalization yields the optimal Steiner tree for every regular -simplex with . The source gives no resolution for the asserted generalization.
References
- Henry Fleischmann, Guillermo A. Gamboa Q., Karthik C. S., Josef Matějka and Jakub Petr, “On Steiner Trees of the Regular Simplex”, arXiv:2312.01252 (2023).
Progress summary
Never refreshed
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.