Status: complete proposed counterfamily; independent mathematical, root, and documented priority reviews passed. The proof remains unrefereed. Date: 21 November 2026.
The conjecture
Brown and Mol's Conjecture 4.2 in On the roots of the subtree polynomial, arXiv:1810.08655v1 (2018), published in European Journal of Combinatorics 89 (2020), 103181, asserts that every zero of the subtree polynomial of a tree of order belongs to
The subtree polynomial counts nonempty connected induced vertex sets by their order. The conjecture is repeated, still open, as Conjecture 5.1 on printed page 16 of Jin, Ma, and Wang's Proof of a Brown–Mol conjecture on subtree roots, arXiv:2608.07898v2 (14 August 2026). That paper proves the distinct disk bound centered at zero; it does not prove this translated annulus assertion.
Primary sources:
- https://arxiv.org/pdf/1810.08655, Conjecture 4.2, printed page 14.
- https://arxiv.org/abs/2608.07898, version 2, Conjecture 5.1, printed page 16.
We construct trees whose subtree polynomials have zeros strictly inside the forbidden inner disk. This disproves the full universal annulus conjecture once. No claim is made here about its outer bound.
A family of trees
For every positive integer , let have a central vertex , adjacent to vertices , with four further leaves adjacent to each . There are no other edges. Thus is a tree of order .
Put
The subtree polynomial is exactly
Indeed, a subtree containing makes an independent choice in each branch: either omit that whole branch, or include and any subset of its four leaves. This gives . A subtree avoiding lies within one of the copies of . Each copy has polynomial , giving the other term in (1).
A regular point inside the forbidden disk
Let be the unique real solution in of
Existence follows because the left side is at zero and at . Uniqueness follows from its strictly positive derivative on that interval. Define
This point satisfies .
For , write and . Since ,
Equations (2)–(3) give . Moreover,
so , because is nonreal. Finally,
and therefore .
Local zero lemma
The general phenomenon that competing exponential terms produce limiting zeros is established prior mathematics. Brown and Otto's 2025 generalized Beraha–Kahane–Weiss theorem permits coefficients polynomial in the sequence index; its published applications concern other graph polynomials. The short local argument below is included for completeness, with the nonzero derivative hypothesis stated explicitly. The new application here is the tree family and the interior point above, not a claim to a new zero-limit principle. See SOURCES.md and ALGEBRA_PRIOR_AUDIT.md for the precise comparison.
Lemma. Let be holomorphic near a point . Suppose
Then, for every sufficiently large positive integer , the function has a zero , and the zeros can be chosen so that .
Proof. Choose a holomorphic branch near , with for some real . Since , the holomorphic inverse function theorem gives an inverse near .
Choose small enough that is holomorphic on a neighborhood of the closed disk and has no zeros there. The simply connected disk therefore has a holomorphic logarithm
Let . For each , choose an integer with , and put
For all sufficiently large ,
On the boundary of we then have
Rouché's theorem shows that has exactly one zero in the disk, since is inside it by (4). At that zero,
Thus is a zero of . Moreover,
so . This proves the lemma.
Disproof
Apply the lemma to the polynomials above and the point from (2). Since the open disk contains , it also contains for every sufficiently large . These points are nonzero because their limit is nonzero. Equation (1) makes them subtree roots of the trees .
Consequently, for every sufficiently large positive integer , the tree violates the inner inequality in Brown–Mol's annulus conjecture. The construction is an infinite counterfamily to the entire universal assertion.
The proof uses exact identities and a local analytic argument. Numerical root approximations are unnecessary for its validity. The phrase “sufficiently large” is an ordinary quantified existence statement proved by (4); no computational search or unproved numerical threshold is used.
Supplementary exact finite witness
The preceding argument already proves the infinite counterfamily. For a separate concrete witness, take , so has vertices. Let
All the following checks are rational and are reproduced by check.py:
For the first inequality the verifier bounds the modulus by the sum of the absolute real and imaginary parts. For the second it bounds the modulus below by the larger absolute component. The values of and are evaluated as exact Gaussian rationals, without root approximation.
On , elementary squared-modulus checks and the triangle inequality give
Using , , and , set
Then , , and on this disk. Consequently,
The last comparison is again an exact rational inequality. The Taylor remainder bound from (6) gives, on ,
Rouché's theorem therefore gives exactly one zero of in this disk. Finally,
The entire certificate disk lies strictly inside the forbidden inner disk and does not contain zero. Hence this zero is a subtree root of violating the conjecture. The verifier also checks the subtree identity by independent connected-set enumeration for and checks (3) as a formal polynomial identity. These finite checks support the construction; the infinite-family conclusion rests on the analytic proof above.