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

关于秩为2的自由群自同构的几个问题

On several problems about automorphisms of the free group of rank two

Donghi Lee

摘要:

设$F_n$是秩为$n$的自由群。本文讨论了与$F_2$的自同构有关的三个算法问题。如果$u$不具有负指数,则$F_n$的字$u$被称为正。如果$ϕ(u)$对于$F_n$的某个自同构$ϕ$是正的,则$F_n$中的字$u$被称为潜在正的。本文证明了在$F_2$中存在一个判定给定词是否为潜在正的算法,从而给出了[1]中问题F34 a在$F_2$情形下的肯定解.如果对于$F_n$的每个自同构$ϕ$,$ϕ(u)$和$ϕ(v)$的循环长度之比有界远离0和$\infty$,则称$F_n$中的两个元素$u$和$v$是有界平移等价的。我们提供了一个算法来确定$F_2$的两个给定元素是否是有界翻译等价的,从而回答了[1]在线版本中关于$F_2$的问题F38 c。进一步证明了存在一个判定$F_2$的一个给定的生成子群是否是$F_2$的某个自同构的不动点群的算法,从而在$F_2$的情况下肯定地解决了[1]中的问题F1b.

英文摘要:

Let $F_n$ be a free group of rank $n$. In this paper we discuss three algorithmic problems related to automorphisms of $F_2$. A word $u$ of $F_n$ is called positive if $u$ does not have negative exponents. A word $u$ in $F_n$ is called potentially positive if $ϕ(u)$ is positive for some automorphism $ϕ$ of $F_n$. We prove that there is an algorithm to decide whether or not a given word in $F_2$ is potentially positive, which gives an affirmative solution to problem F34a in [1] for the case of $F_2$. Two elements $u$ and $v$ in $F_n$ are said to be boundedly translation equivalent if the ratio of the cyclic lengths of $ϕ(u)$ and $ϕ(v)$ is bounded away from 0 and from $\infty$ for every automorphism $ϕ$ of $F_n$. We provide an algorithm to determine whether or not two given elements of $F_2$ are boundedly translation equivalent, thus answering question F38c in the online version of [1] for the case of $F_2$. We further prove that there exists an algorithm to decide whether or not a given finitely generated subgroup of $F_2$ is the fixed point group of some automorphism of $F_2$, which settles problem F1b in [1] in the affirmative for the case of $F_2$.

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

↑