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

BUIR Usage Stats
7
views
19
downloads

Citation Stats

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.

Source Title

Journal of Algebra

Publisher

Academic Press

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)

Language

English