ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≥1k\geq 1 and let dd satisfy

2≤2k<d≤2k+1.2\leq 2^k<d\leq 2^{k+1}.

A good binary tree of height kk is defined recursively: a height-zero tree is a single node, and for positive height at most one child-subtree is good of height k−1k-1, while the remaining child-subtrees are full binary trees of height k−1k-1 or k−2k-2. Optimal topology conjecture. The topology of the optimal Steiner tree of a regular dd-simplex is formed by taking the good tree of height k+1k+1 on dd 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.