Show simple item record

dc.contributor.authorAguiló Gost, Francisco de Asis L.
dc.contributor.authorLlena, David
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2018-12-11T08:44:42Z
dc.date.available2019-12-01T01:26:13Z
dc.date.issued2018
dc.identifier.citationAguilo, F., Llena, D. Computing denumerants in numerical 3-semigroups. "Quaestiones mathematicae", 2018, vol. 41, núm. 8, p. 1-32.
dc.identifier.issn1607-3606
dc.identifier.urihttp://hdl.handle.net/2117/125599
dc.descriptionThis is an Accepted Manuscript of an article published by Taylor & Francis Group in Quaestiones mathematicae on 2018, available online at: http://www.tandfonline.com/10.2989/16073606.2017.1419998.
dc.description.abstractAs far as we know, usual computer algebra packages can not compute denumerants for almost medium (about a hundred digits) or almost medium-large (about a thousand digits) input data in a reasonably time cost on an ordinary computer. Implemented algorithms can manage numerical n-semigroups for small input data. Basically, the denumerant of a non-negative element s ¿ N is the number of non-negative integer solutions of certain linear non-negative Diophantine equation which constant term is equal to s. Here we are interested in denumerants of numerical 3-semigroups which have almost medium input data. A new algorithm for computing denumerants is given for this task. It can manage almost medium input data in the worst case and medium-large or even large input data in some cases.
dc.format.extent32 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi matemàtica
dc.subject.lcshTeoria de grafs
dc.subject.lcshDiophantine equations
dc.subject.lcshPartitions (Mathematics)
dc.subject.otherDenumerant
dc.subject.othernumerical semigroup
dc.subject.otherDiophantine equation
dc.subject.otherL-shape
dc.titleComputing denumerants in numerical 3-semigroups
dc.typeArticle
dc.subject.lemacGrafs, Teoria de
dc.subject.lemacEquacions diofàntiques
dc.subject.lemacParticions (Matemàtica)
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.identifier.doi10.2989/16073606.2017.1419998
dc.description.peerreviewedPeer Reviewed
dc.subject.amsClassificació AMS::05 Combinatorics::05C Graph theory
dc.subject.amsClassificació AMS::11 Number theory::11D Diophantine equations
dc.subject.amsClassificació AMS::11 Number theory::11P Additive number theory; partitions
dc.relation.publisherversionhttps://www.tandfonline.com/doi/pdf/10.2989/16073606.2017.1419998
dc.rights.accessOpen Access
local.identifier.drac22329324
dc.description.versionPostprint (author's final draft)
local.citation.authorAguilo, F.; Llena, D.
local.citation.publicationNameQuaestiones mathematicae
local.citation.volume41
local.citation.number8
local.citation.startingPage1
local.citation.endingPage32


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record