Kapovich–Nagnibeda–Lim minimal volume entropy conjecture
Let be a connected finite metric graph of first Betti number , and let be a trivalent graph of the same first Betti number whose edges all have unit length. If , then there exists a vertex in the universal cover such that, for every radius , the metric length of the ball is at least the metric length of the radius- ball in the trivalent tree whose edges all have length . Equivalently, the universal cover contains a point whose balls at every scale dominate those in the universal cover of the correspondingly rescaled trivalent graph.
References
- Ball growth at all scales in universal covers of short metric graphs — arXiv — Steve Karam
Source: arXiv
Progress summary
A new paper gives stronger geometric estimates relevant to the conjecture, but does not prove the conjecture, which remains open.
The Kapovich–Nagnibeda–Lim conjecture concerns minimizing volume entropy in the relevant geometric setting. The retrieved literature includes related entropy-minimization theorems, but no proof or counterexample for the specifically named conjecture.
Known results
For free groups of rank , the minimum among volume-one metric graphs without degree-one or degree-two vertices is , attained exactly by regular trivalent graphs with equal edge lengths; the entropy supremum is infinite. This is related work, not a stated resolution of the named conjecture.
October 2026 all-scale bounds
Steve Karam’s paper replaces an earlier lossy estimate with an all-radius comparison for universal covers of short metric graphs, improves an exponential-growth application to small-area surfaces, and gives explicit constants relevant to Guth’s question. Its abstract proposes a sharp all-scale conjecture rather than proving the full minimal-entropy conjecture; the advance is therefore unverified as a resolution.
Current status (as of October 2026): Related geometric progress has been claimed, but the Kapovich–Nagnibeda–Lim minimal volume entropy conjecture remains open.
Solutions 0
No solutions have been posted yet.