Identify the optimal double-comet parameter and establish uniqueness

Determine the exact integer k minimizing the adjacency spectral gap g(C(k,n-2k)) among balanced double comets of order n, and prove or disprove uniqueness of that minimizing integer.

Background

The main theorem identifies balanced double comets as the only possible minimizer family for orders n≥200, but it does not identify which leaf-cluster size k is optimal. The proof uses a continuous maximizer defined by ν_b(1+log ν_b)=b, with b=n/2−2, and then rounds this value to obtain a comparison tree.

The rounding argument supplies an effective near-optimal parameter but does not determine the exact minimizer of g(C(k,n−2k)). Establishing the exact integer choice, together with whether that choice is unique, would strengthen the main theorem.

References

Its rounding does not by itself determine the exact minimizer of $g(C(k,n-2k))$. Establishing that integer choice and any uniqueness statement would strengthen Theorem~\ref{thm:main}.

— A finite threshold for the double-comet conjecture  (2610.02913 - Cai et al., 2 Oct 2026) in Section 7 (Further questions)