Mostra el registre d'ítem simple
Computing denumerants in numerical 3-semigroups
dc.contributor.author | Aguiló Gost, Francisco de Asis L. |
dc.contributor.author | Llena, David |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2018-12-11T08:44:42Z |
dc.date.available | 2019-12-01T01:26:13Z |
dc.date.issued | 2018 |
dc.identifier.citation | Aguilo, F., Llena, D. Computing denumerants in numerical 3-semigroups. "Quaestiones mathematicae", 2018, vol. 41, núm. 8, p. 1-32. |
dc.identifier.issn | 1607-3606 |
dc.identifier.uri | http://hdl.handle.net/2117/125599 |
dc.description | This 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.abstract | As 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.extent | 32 p. |
dc.language.iso | eng |
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.lcsh | Teoria de grafs |
dc.subject.lcsh | Diophantine equations |
dc.subject.lcsh | Partitions (Mathematics) |
dc.subject.other | Denumerant |
dc.subject.other | numerical semigroup |
dc.subject.other | Diophantine equation |
dc.subject.other | L-shape |
dc.title | Computing denumerants in numerical 3-semigroups |
dc.type | Article |
dc.subject.lemac | Grafs, Teoria de |
dc.subject.lemac | Equacions diofàntiques |
dc.subject.lemac | Particions (Matemàtica) |
dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.identifier.doi | 10.2989/16073606.2017.1419998 |
dc.description.peerreviewed | Peer Reviewed |
dc.subject.ams | Classificació AMS::05 Combinatorics::05C Graph theory |
dc.subject.ams | Classificació AMS::11 Number theory::11D Diophantine equations |
dc.subject.ams | Classificació AMS::11 Number theory::11P Additive number theory; partitions |
dc.relation.publisherversion | https://www.tandfonline.com/doi/pdf/10.2989/16073606.2017.1419998 |
dc.rights.access | Open Access |
local.identifier.drac | 22329324 |
dc.description.version | Postprint (author's final draft) |
local.citation.author | Aguilo, F.; Llena, D. |
local.citation.publicationName | Quaestiones mathematicae |
local.citation.volume | 41 |
local.citation.number | 8 |
local.citation.startingPage | 1 |
local.citation.endingPage | 32 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [3.234]
-
Articles de revista [290]