The sharp upper-bound conjecture for the Yokota invariant

Let Γ\Gamma be a planar 33-connected graph, let Γ\overline{\Gamma} denote the associated maximal-volume proper generalized hyperbolic polyhedron, and let colcol be any rr-admissible coloring of the edges of Γ\Gamma. The sharp upper-bound conjecture.

πrlogYr(Γ,col)Vol(Γ)+O(log(r)r).\frac{\pi}{r}\log\left\lvert Y_r(\Gamma,col)\right\rvert\leq \operatorname{Vol}(\overline{\Gamma})+O\left(\frac{\log(r)}{r}\right).

Moreover, the inequality is sharp, with equality attained by the sequence of colorings assigning r2±12\frac{r-2\pm1}{2} to every edge, with the sign chosen so that the colors are even. This is presented as a sharper conjecture following the maximum volume conjecture. Its general status is not resolved in the supplied text.

Sources & referencesView supporting material

Primary source

Giulio Belletti, “An upper bound conjecture for the Yokota invariant”, arXiv:2002.01904 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.