Given a numerical semigroup S(A), generated by A = {a,b,N} ⊂ N with 0 < a < b < N and gcd(a,b,N) = 1, we give a parameterization of the set F(m;A) = {(x, y, z) ∈ $N^3$ | xa + yb + zN = m} for any m ∈ S(A). We also give the catenary degree of S(A), c(A). Boths results need the computation of an L-shaped tile, related to the set A, that has time-complexity O(logN) in the worst case
We recall L-shapes, which are minimal distance diagrams, related to weighted 2-Cayley digraphs, and ...
A generalization of a non-symmetric numerical semigroup generated by three elements (Jiryo Komeda) K...
AbstractWe compute the number of elements of a minimal system of generators for the congruence of a ...
Let S = a, b,N be a numerical semigroup generated by a, b,N ∈ N with 1 < a < b < N and gcd(a, b,N)...
ABSTRACT. We construct an algorithm which computes the catenary and tame degree of a numerical semig...
We characterize numerical semigroups of embedding dimension three having the same catenary and tame ...
Electronic version of an article published as Journal of Algebra and Its Applications, 15, 1, 2016, ...
We give an algorithm to compute the set of primitive elements for an embedding dimension three numer...
This book is an extended and revised version of "Numerical Semigroups with Applications," published ...
AbstractLet H=〈a,b,c〉 be a numerical semigroup generated by three elements and let R=k[H] be its sem...
In this paper, we characterize those numerical semigroups containing 〈n1,n2〉. From this characteriza...
AbstractIn this paper, we characterize those numerical semigroups containing 〈n1,n2〉. From this char...
This is an Accepted Manuscript of an article published by Taylor & Francis Group in Quaestiones math...
Minimum distance diagrams, also known as L-shapes, have been used to study some properties related t...
We recall L-shapes, which are minimal distance diagrams, related to weighted 2-Cayley digraphs, and ...
We recall L-shapes, which are minimal distance diagrams, related to weighted 2-Cayley digraphs, and ...
A generalization of a non-symmetric numerical semigroup generated by three elements (Jiryo Komeda) K...
AbstractWe compute the number of elements of a minimal system of generators for the congruence of a ...
Let S = a, b,N be a numerical semigroup generated by a, b,N ∈ N with 1 < a < b < N and gcd(a, b,N)...
ABSTRACT. We construct an algorithm which computes the catenary and tame degree of a numerical semig...
We characterize numerical semigroups of embedding dimension three having the same catenary and tame ...
Electronic version of an article published as Journal of Algebra and Its Applications, 15, 1, 2016, ...
We give an algorithm to compute the set of primitive elements for an embedding dimension three numer...
This book is an extended and revised version of "Numerical Semigroups with Applications," published ...
AbstractLet H=〈a,b,c〉 be a numerical semigroup generated by three elements and let R=k[H] be its sem...
In this paper, we characterize those numerical semigroups containing 〈n1,n2〉. From this characteriza...
AbstractIn this paper, we characterize those numerical semigroups containing 〈n1,n2〉. From this char...
This is an Accepted Manuscript of an article published by Taylor & Francis Group in Quaestiones math...
Minimum distance diagrams, also known as L-shapes, have been used to study some properties related t...
We recall L-shapes, which are minimal distance diagrams, related to weighted 2-Cayley digraphs, and ...
We recall L-shapes, which are minimal distance diagrams, related to weighted 2-Cayley digraphs, and ...
A generalization of a non-symmetric numerical semigroup generated by three elements (Jiryo Komeda) K...
AbstractWe compute the number of elements of a minimal system of generators for the congruence of a ...