AN ALGORITHMIC METHOD TO COMPUTE A MINIMAL RELATION FOR ANY NUMERICAL SEMIGROUP
From MaRDI portal
Publication:3837511
Recommendations
Cited in
(21)- Symmetric numerical semigroups with arbitrary multiplicity and embedding dimension
- Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations.
- On Cohen-Macaulay and Gorenstein simplicial affine semigroups
- The catenary and tame degree of numerical monoids
- Irreducible numerical semigroups with arbitrary multiplicity and embedding dimension
- PRESENTATIONS OF FINITELY GENERATED SUBMONOIDS OF FINITELY GENERATED COMMUTATIVE MONOIDS
- Numerical semigroups with Apéry sets of unique expression
- ON PRESENTATIONS OF COMMUTATIVE MONOIDS
- On numerical semigroups with high embedding dimension
- An algorithm to minimize representations of finite order relations
- Minimal presentations of full subsemigroups of \(\mathbb{N}^2\)
- The Frobenius number for sequences of triangular and tetrahedral numbers
- On the Type and the Minimal Presentation of Certain Numerical Semigroups
- On free affine semigroups
- Balanced numerical semigroups
- Minimal systems of generators for ideals of semigroups
- Numerical semigroups generated by concatenation of arithmetic sequences
- Isolated factorizations and their applications in simplicial affine semigroups
- Minimal presentations of shifted numerical monoids
- On numerical semigroups
- scientific article; zbMATH DE number 7688262 (Why is no real title available?)
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)
