arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1807.05658math.GTmath.CO
收藏

关于至多相交一次的曲线

On curves intersecting at most once

Joshua Evan Greene

摘要:

证明了在亏格$g$的闭曲面上,任意两条曲线不同伦且至多相交一次的简单闭曲线集的基数为$\lesssim g^2 \log(g)$ .这个界限与已知的最大构造在对数因子内相匹配。这个证明使用了图论中的概率论证。它也推广到曲线相交最多$k$次的情况。

英文摘要:

We prove that on a closed surface of genus $g$, the cardinality of a set of simple closed curves in which any two are non-homotopic and intersect at most once is $\lesssim g^2 \log(g)$. This bound matches the largest known constructions to within a logarithmic factor. The proof uses a probabilistic argument in graph theory. It generalizes as well to the case of curves that intersect at most $k$ times in pairs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑