arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2108.00050math.COmath.AG
收藏

$\overline{M}_{0,n}$的投影嵌入的惰性竞赛图和多重度

Lazy tournaments and multidegrees of a projective embedding of $\overline{M}_{0,n}$

Maria Gillespie, Sean T. Griffin, Jake Levinson

摘要:

我们提供了一个新的几何解释的(迭代)Kapranov嵌入$Φ_n:\overline{M}_{0,n+3}\hookrightarrow \mathbb{P}^1\times \mathbb{P}^2\times \cdots \times \mathbb{P}^n$,其中$\overline{M}_{0,n+3}$是模空间的稳定亏格$0$曲线与$n+3$标记点的多度。我们列举的多度不相交的边界点的$\overline{M}_{0,n+3}$通过组合算法的三价树,我们称之为一个懒惰的比赛。这些集合与Gillespie,Cavalieri和Monin在2020年证明的用于推导多度递归的遗忘映射兼容。懒惰的比赛点很容易看到总$(2n-1)!!=(2n-1)\cdot (2n-3) \cdots 5 \cdot 3 \cdot 1$,给出了一个自然的证明,即$Φ_n$的全次数是奇数倍阶乘。这一事实首先证明了使用插入算法在某些停车功能,我们另外给那些停车功能的双射。

英文摘要:

We provide a new geometric interpretation of the multidegrees of the (iterated) Kapranov embedding $Φ_n:\overline{M}_{0,n+3}\hookrightarrow \mathbb{P}^1\times \mathbb{P}^2\times \cdots \times \mathbb{P}^n$, where $\overline{M}_{0,n+3}$ is the moduli space of stable genus $0$ curves with $n+3$ marked points. We enumerate the multidegrees by disjoint sets of boundary points of $\overline{M}_{0,n+3}$ via a combinatorial algorithm on trivalent trees that we call a lazy tournament. These sets are compatible with the forgetting maps used to derive the recursion for the multidegrees proven in 2020 by Gillespie, Cavalieri, and Monin. The lazy tournament points are easily seen to total $(2n-1)!!=(2n-1)\cdot (2n-3) \cdots 5 \cdot 3 \cdot 1$, giving a natural proof of the fact that the total degree of $Φ_n$ is the odd double factorial. This fact was first proven using an insertion algorithm on certain parking functions, and we additionally give a bijection to those parking functions.

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

↑