|
Title:
|
Computing denumerants in numerical 3-semigroups
|
|
Author:
|
Aguiló Gost, Francisco de Asis L.; Llena, David
|
|
Other authors:
|
Universitat Politècnica de Catalunya. Departament de Matemàtiques; Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
|
Abstract:
|
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. |
|
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. |
|
Abstract:
|
Peer Reviewed |
|
Subject(s):
|
-Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria
-Àrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi matemàtica
-Teoria de grafs
-Diophantine equations
-Partitions (Mathematics)
-Denumerant
-numerical semigroup
-Diophantine equation
-L-shape
-Grafs, Teoria de
-Equacions diofàntiques
-Particions (Matemàtica)
-Classificació AMS::05 Combinatorics::05C Graph theory
-Classificació AMS::11 Number theory::11D Diophantine equations
-Classificació AMS::11 Number theory::11P Additive number theory; partitions |
|
Rights:
|
|
|
Document type:
|
Article - Submitted version
Article |
|
Share:
|
|
