ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tree of order n≥2n\geq 2. A subtree root is a zero of the subtree polynomial of TT. Consider the annulus

{z∈C ⁣: 12≤∣z+12∣≤12+n−1n−1}.\left\{z\in\mathbb{C}\colon\ \tfrac{1}{2}\leq \left|z+\tfrac{1}{2}\right|\leq \tfrac{1}{2}+\sqrt[n-1]{n-1}\right\}.

Annulus conjecture. The subtree roots of TT are contained in this annulus.

This is presented as a strengthening of the disk conjecture: it gives both an inner exclusion region and an order-dependent outer bound. The conjecture remains open.

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.