arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1104.0968math.GT
收藏

关于分离曲线的Dehn twists根

Roots of Dehn twists about separating curves

Kashyap Rajeevsarathy

摘要:

令$C$是亏格为$g \geq 2$的可定向闭曲面$F$中的曲线,该曲面将$F$分成亏格为$g_i$的子曲面$\widetilde {F_i}$,其中,对于$i = 1,2$。研究了Dehn扭$t_C$关于$C$的$\Mod(F)$中的根的集合.所有的根都来自于$\widetilde{F_i}$上的$C_{n_i}$ -作用对,其中$n=\lcm(n_1,n_2)$是根的次数,满足一定的相容性条件。$C_{n_i}$动作是一种我们称之为嵌套动作的动作,我们使用我们称之为数据集的元组对它们进行分类。相容性条件可以由一个简单的公式表示,允许通过相容的数据集对PDMATHAMT的所有根进行分类。我们使用这些数据集对所有的根分类为$g = 2$和$g = 3$。我们证明了,总有一个根的程度至少$2g^2+2g$,而$n \leq 4g^2+2g$。我们还提供了一些额外的应用程序。

英文摘要:

Let $C$ be a curve in a closed orientable surface $F$ of genus $g \geq 2$ that separates $F$ into subsurfaces $\widetilde {F_i}$ of genera $g_i$, for $i = 1,2$. We study the set of roots in $\Mod(F)$ of the Dehn twist $t_C$ about $C$. All roots arise from pairs of $C_{n_i}$-actions on the $\widetilde{F_i}$, where $n=\lcm(n_1,n_2)$ is the degree of the root, that satisfy a certain compatibility condition. The $C_{n_i}$ actions are of a kind that we call nestled actions, and we classify them using tuples that we call data sets. The compatibility condition can be expressed by a simple formula, allowing a classification of all roots of $t_C$ by compatible pairs of data sets. We use these data set pairs to classify all roots for $g = 2$ and $g = 3$. We show that there is always a root of degree at least $2g^2+2g$, while $n \leq 4g^2+2g$. We also give some additional applications.

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

↑