An algorithm to compute the primitive elements of an embedding dimension three numerical semigroup.
From MaRDI portal
Publication:283697
DOI10.1016/j.endm.2014.08.025zbMath1337.20066OpenAlexW2025275294MaRDI QIDQ283697
F. Aguiló-Gost, David Llena, Pedro A. García Sánchez
Publication date: 13 May 2016
Full work available at URL: http://hdl.handle.net/2117/27055
Symbolic computation and algebraic computation (68W30) Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) Software, source code, etc. for problems pertaining to group theory (20-04)
Related Items
Delta sets for nonsymmetric numerical semigroups with embedding dimension three ⋮ On the number of L-shapes in embedding dimension four numerical semigroups
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids.
- Factoring in embedding dimension three numerical semigroups
- Triple-loop networks with arbitrarily many minimum distance diagrams
- Numerical semigroups.
- The catenary and tame degree in finitely generated commutative cancellative monoids.
- Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations.
- numericalsgps, a GAP package for numerical semigroups
This page was built for publication: An algorithm to compute the primitive elements of an embedding dimension three numerical semigroup.