The anchor-cell excess conjecture for canonical systems on metric graphs with skeleton K_4

About 10 years old · traced to

Let Γ\Gamma be a metric graph whose skeleton is the complete graph K4K_4, and let D=KD=K be its canonical divisor. Write ∣D∣|D| for the associated linear system, and call the cells in ∣D∣|D| anchor cells and vertices in ∣D∣|D| vertices. Anchor-cell excess conjecture. The number of anchor cells in ∣D∣|D| minus the number of vertices in ∣D∣|D| is always 1616. This is an observed computational pattern for the listed metrics on K4K_4; whether it holds for every metric on a trivalent graph with skeleton K4K_4 remains to be established.

References

Primary source

Bo Lin, “Computing Linear Systems on Metric Graphs”, arXiv:1603.00547 (2016).

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.