Please use this identifier to cite or link to this item:

Title: Study of algorithms for decomposition of a numerical semigroup
Authors: Branco, M.B.
Franco, Nuno
Keywords: intersection of irreducible
complexity of Algorithm Intersection
Issue Date: 2007
Publisher: NAUN Journals
Abstract: We study two algorithms to decompose a numerical semigroup S as intersection of irreducible numerical semigroups. We also present a compared study of two algorithms to compute the intersection of two numerical semigroups with embedding dimension two and the same multiplicity.
Type: article
Appears in Collections:CIMA - Publicações - Artigos em Revistas Internacionais Com Arbitragem Científica

Files in This Item:

File Description SizeFormat
Study of algorithms for decomposition of a numerical semigroup.pdf258.11 kBAdobe PDFView/OpenRestrict Access. You can Request a copy!
FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpaceOrkut
Formato BibTex mendeley Endnote Logotipo do DeGóis 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Dspace Dspace
DSpace Software, version 1.6.2 Copyright © 2002-2008 MIT and Hewlett-Packard - Feedback
UEvora B-On Curriculum DeGois