Now showing items 1-2 of 2

    • A fast algorithm for constructing Arf closure and a conjecture 

      Arslan, F.; Şahin, N. (Academic Press, 2014)
      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 ...
    • On Arf rings 

      Arslan, Sefa Feza (Bilkent University, 1994)
      In this thesis, we worked with curves which have cusp type singularities. We described the Arf theory, which solves the problem of understanding and finding the multiplicity sequence of a curve branch algebraically. We ...