Optimal topology conjecture for Steiner trees of the regular simplex
Statement
Let and let satisfy
A good binary tree of height is defined recursively: a height-zero tree is a single node, and for positive height at most one child-subtree is good of height , while the remaining child-subtrees are full binary trees of height or . Optimal topology conjecture. The topology of the optimal Steiner tree of a regular -simplex is formed by taking the good tree of height on leaf nodes, removing its root node, and reconnecting the tree by an edge between the former children of the root. This is stated as a reformulation of a conjecture of Smith. The source does not provide a resolution.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.