AbstractWe study those numerical semigroups that are intersections of symmetric numerical semigroups and we construct an algorithm to find this decomposition. These semigroups are characterized from their pseudo-Frobenius numbers
The thesis is made up of two parts. We study in the first part Wilf’s conjecture for numerical semig...
Both authors are supported by the Project MTM2017-84890-P (funded by Ministerio de Economía, Industr...
The thesis is made up of two parts. We study in the first part Wilf’s conjecture for numerical semig...
AbstractWe study those numerical semigroups that are intersections of symmetric numerical semigroups...
Producción CientíficaWe give two algorithmic procedures to compute the whole set of almost symmetric...
AbstractThis paper gives a solution to the Diophantine Frobenius problem for pseudo-symmetric numeri...
AbstractIn this paper, we present an efficient algorithm to compute the whole set of numerical semig...
AbstractGiven a positive integer g, we denote by F(g) the set of all numerical semigroups with Frobe...
Producción CientíficaWe establish a one-to-one correspondence between numerical semigroups of genus ...
Every numerical semigroup S admits a decomposition S = S1 \· · ·\Sn with Si irreducible (that is, Si...
Cette thèse est composée de deux parties. Nous étudions dans la première la conjecture de Wilf pour ...
We establish a one-to-one correspondence between numerical semigroups of genus g and almost symmetri...
The so-called Frobenius number in the famous linear Diophantine problem of Frobenius is the largest ...
We give two algorithmic procedures to compute the whole set of almost symmetric numerical semigroups...
We thank the anonymous referees for their detailed suggestions and comments, which have greatly imp...
The thesis is made up of two parts. We study in the first part Wilf’s conjecture for numerical semig...
Both authors are supported by the Project MTM2017-84890-P (funded by Ministerio de Economía, Industr...
The thesis is made up of two parts. We study in the first part Wilf’s conjecture for numerical semig...
AbstractWe study those numerical semigroups that are intersections of symmetric numerical semigroups...
Producción CientíficaWe give two algorithmic procedures to compute the whole set of almost symmetric...
AbstractThis paper gives a solution to the Diophantine Frobenius problem for pseudo-symmetric numeri...
AbstractIn this paper, we present an efficient algorithm to compute the whole set of numerical semig...
AbstractGiven a positive integer g, we denote by F(g) the set of all numerical semigroups with Frobe...
Producción CientíficaWe establish a one-to-one correspondence between numerical semigroups of genus ...
Every numerical semigroup S admits a decomposition S = S1 \· · ·\Sn with Si irreducible (that is, Si...
Cette thèse est composée de deux parties. Nous étudions dans la première la conjecture de Wilf pour ...
We establish a one-to-one correspondence between numerical semigroups of genus g and almost symmetri...
The so-called Frobenius number in the famous linear Diophantine problem of Frobenius is the largest ...
We give two algorithmic procedures to compute the whole set of almost symmetric numerical semigroups...
We thank the anonymous referees for their detailed suggestions and comments, which have greatly imp...
The thesis is made up of two parts. We study in the first part Wilf’s conjecture for numerical semig...
Both authors are supported by the Project MTM2017-84890-P (funded by Ministerio de Economía, Industr...
The thesis is made up of two parts. We study in the first part Wilf’s conjecture for numerical semig...
DOI
Add to ORKG