AN ALGORITHMIC METHOD TO COMPUTE A MINIMAL RELATION FOR ANY NUMERICAL SEMIGROUP
From MaRDI portal
Publication:3837511
DOI10.1142/S021819679600026XzbMATH Open0863.20026MaRDI QIDQ3837511FDOQ3837511
Authors:
Publication date: 8 April 1997
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Recommendations
Cited In (20)
- The catenary and tame degree of numerical monoids
- On the Type and the Minimal Presentation of Certain Numerical Semigroups
- Irreducible numerical semigroups with arbitrary multiplicity and embedding dimension
- PRESENTATIONS OF FINITELY GENERATED SUBMONOIDS OF FINITELY GENERATED COMMUTATIVE MONOIDS
- Minimal presentations of full subsemigroups of \(\mathbb{N}^2\)
- ON PRESENTATIONS OF COMMUTATIVE MONOIDS
- Numerical semigroups generated by concatenation of arithmetic sequences
- Title not available (Why is that?)
- Balanced numerical semigroups
- Symmetric numerical semigroups with arbitrary multiplicity and embedding dimension
- Isolated factorizations and their applications in simplicial affine semigroups
- On numerical semigroups
- An algorithm to minimize representations of finite order relations
- Minimal systems of generators for ideals of semigroups
- On Cohen-Macaulay and Gorenstein simplicial affine semigroups
- Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations.
- Numerical semigroups with Apéry sets of unique expression
- The Frobenius number for sequences of triangular and tetrahedral numbers
- On numerical semigroups with high embedding dimension
- On free affine semigroups
This page was built for publication: AN ALGORITHMIC METHOD TO COMPUTE A MINIMAL RELATION FOR ANY NUMERICAL SEMIGROUP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3837511)
