Horizon-map determination of the set of minima

From papers

For a set of minima, let CmaxC_{\mathrm{max}} be the largest set of curves containing CC for which every nonfilling subset CC' of CmaxC_{\mathrm{max}} gives Min(C)\mathrm{Min}(C')^{\infty} adherent to Min(C)\mathrm{Min}(C). The set CmaxC_{\mathrm{max}} need not have the property that its curves intersect pairwise at most once. Horizon-map determination conjecture. The image of the horizon map uniquely determines the set of minima

Min(C)=Min(Cmax).\mathrm{Min}(C)=\mathrm{Min}(C_{\mathrm{max}}).

Intuitively, a set of minima behaves like a convex hull of the minima on its boundary, and the horizon map determines this boundary. The supplied text does not state whether the conjecture has been resolved.

Progress summary

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

Sources & referencesView supporting material

Primary source

Ingrid Irmer, “Schmutz-Thurston Duality”, arXiv:2508.04587 (2025).

Solutions 0

No solutions have been posted yet.