A fast algorithm for constructing Arf closure and a conjecture

Date
2014
Authors
Arslan, F.
Şahin, N.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Journal of Algebra
Print ISSN
0021-8693
Electronic ISSN
1090-266X
Publisher
Academic Press
Volume
417
Issue
Pages
148 - 160
Language
English
Journal Title
Journal ISSN
Volume Title
Series
Abstract

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.

Course
Other identifiers
Book Title
Citation
Published Version (Please cite this version)