加载中…
We show that the largest size of a collection of simple closed curves pairwise intersecting at most once on an orientable surface of Euler characteristic grows quadratically in . This resolves a longstanding question of Farb-Leininger, up to multiplicative constants. Inspired by the work of Przytycki in the setting of arcs, we introduce the concepts of , , and in order to account for how certain polygons built from pairs of curves in the collection distribute their area over the surface.

生成讲解博客的中文版本

生成AI智能校验的中文版本