A fast algorithm for constructing Arf closure and a conjecture

Simple item page
dc.citation.epage160en_US
dc.citation.spage148en_US
dc.citation.volumeNumber417en_US
dc.contributor.authorArslan, F.en_US
dc.contributor.authorŞahin, N.en_US
dc.date.accessioned2016-02-08T10:39:29Z
dc.date.available2016-02-08T10:39:29Z
dc.date.issued2014en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractIn 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.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:39:29Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2014en
dc.identifier.doi10.1016/j.jalgebra.2014.06.023en_US
dc.identifier.eissn1090-266X
dc.identifier.issn0021-8693
dc.identifier.urihttp://hdl.handle.net/11693/25124
dc.language.isoEnglishen_US
dc.publisherAcademic Pressen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.jalgebra.2014.06.023en_US
dc.source.titleJournal of Algebraen_US
dc.subjectArf closureen_US
dc.subjectArf ringen_US
dc.subjectArf semigroupen_US
dc.subjectBranchen_US
dc.subjectHilbert functionen_US
dc.titleA fast algorithm for constructing Arf closure and a conjectureen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
A_fast_algorithm_for_constructing_Arf_closure_and_a_conjecture.pdf
Size:
346.14 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Industrial Engineering