A fast algorithm for constructing Arf closure and a conjecture
A fast algorithm for constructing Arf closure and a conjecture
复制标题
一种快速构造Arf闭包的算法及猜想
DOI：
10.1016/j.jalgebra.2014.06.023
复制
发表时间：
2014
影响因子：
0.9
通讯作者：
Nil Sahin
中科院分区：
文献类型：
--
作者：
Feza Arslan;Nil Sahin
本文给出了一个计算不可约代数体曲线（或分支）的Arf闭包的快速算法。此外，我们还研究了具有相同Arf闭包的分支与其正则性指标之间的关系。我们给出了一些结果和一个猜想，这是一个具体的方式驯服的奇异性的Arf封闭的解释步骤。
In this article, we give a fast and an easily implementable algorithm for computing the Arf closure of an irreducible algebroid curve (or a branch). Moreover, we study the relation between the branches having the same Arf closure and their regularity indices. We give some results and a conjecture, which are steps towards the interpretation of Arf closure as a specific way of taming the singularity.