加载中…
We approximate intersection numbers $\big\langle \psi_1^{d_1}\cdots \psi_n^{d_n}\big\rangle_{g,n}\overline{\mathcal M}_{g,n}gnd_1,\dots,d_n$. Conjecturally, these approximations become asymptotically exact uniformly in when and remains bounded or grows slowly. In this note we prove a lower bound for the intersection numbers in terms of the above-mentioned approximatingexpressions multiplied by an explicit factor , which tends to when and .

生成讲解博客的中文版本

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