AN ALGORITHMIC METHOD TO COMPUTE A MINIMAL RELATION FOR ANY NUMERICAL SEMIGROUP

DOI10.1142/S021819679600026XzbMath0863.20026MaRDI QIDQ3837511

No author found.

Publication date: 8 April 1997

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

numerical semigroupsminimal generatorsminimal relations

Mathematics Subject Classification ID

Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05)

Related Items

Balanced numerical semigroups, PRESENTATIONS OF FINITELY GENERATED SUBMONOIDS OF FINITELY GENERATED COMMUTATIVE MONOIDS, Minimal systems of generators for ideals of semigroups, Irreducible numerical semigroups with arbitrary multiplicity and embedding dimension, Minimal presentations of full subsemigroups of \(\mathbb{N}^2\), Unnamed Item, The Frobenius number for sequences of triangular and tetrahedral numbers, Symmetric numerical semigroups with arbitrary multiplicity and embedding dimension, Isolated factorizations and their applications in simplicial affine semigroups, Numerical semigroups with Apéry sets of unique expression, Numerical semigroups generated by concatenation of arithmetic sequences, On Cohen-Macaulay and Gorenstein simplicial affine semigroups, The catenary and tame degree of numerical monoids, Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations., On numerical semigroups, On the Type and the Minimal Presentation of Certain Numerical Semigroups, On numerical semigroups with high embedding dimension, On free affine semigroups, ON PRESENTATIONS OF COMMUTATIVE MONOIDS