Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations.

DOI10.1016/j.dam.2006.03.013zbMath1106.20046OpenAlexW2095956808WikidataQ58842810 ScholiaQ58842810MaRDI QIDQ2506358

Pedro A. García Sánchez, Scott Thomas Chapman, David Llena, José Carlos Rosales

Publication date: 28 September 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://digitalcommons.trinity.edu/math_faculty/81

zbMATH Keywords

algorithmspresentationsnumerical semigroupscomputationsystems of linear equationsfinitely generated commutative cancellative monoids

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) Computer solution of Diophantine equations (11Y50)

Related Items

The catenary and tame degree of numerical monoids generated by generalized arithmetic sequences, An algorithm to compute the primitive elements of an embedding dimension three numerical semigroup., The canonical ring of a stacky curve, A characterization of arithmetical invariants by the monoid of relations., Strongly taut finitely generated monoids., The catenary and tame degree in finitely generated commutative cancellative monoids., NORMAL DOMAINS WITH MONOMIAL PRESENTATIONS, A characterization of arithmetical invariants by the monoid of relations. II: The monotone catenary degree and applications to semigroup rings.

Uses Software

• GAP
• numericalsgps

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient solution of linear diophantine equations
• An efficient incremental algorithm for solving systems of linear diophantine equations
• On finitely generated submonoids of \(\mathbb{N}^ k\)
• Nonnegative elements of subgroups of \(\mathbb{Z}^ n\)
• Minimal systems of generators for ideals of semigroups
• Gröbner bases of toric varieties
• \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\)
• Generators and relations of abelian semigroups and semigroup rings
• AN ALGORITHMIC METHOD TO COMPUTE A MINIMAL RELATION FOR ANY NUMERICAL SEMIGROUP
• A deterministic algorithm to decide if a finitely presented abelian monoid is cancellative
• ON PRESENTATIONS OF COMMUTATIVE MONOIDS
• PRESENTATIONS OF FINITELY GENERATED SUBMONOIDS OF FINITELY GENERATED COMMUTATIVE MONOIDS
• An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms
• Minimal solutions of linear diophantine systems : bounds and algorithms
• Computing the elasticity of a Krull monoid