A deterministic algorithm to decide if a finitely presented abelian monoid is cancellative

DOI10.1080/00927879608825809zbMath0940.20058OpenAlexW2045960680WikidataQ58843172 ScholiaQ58843172MaRDI QIDQ4370002

J. M. Urbano-Blanco, José Carlos Rosales

Publication date: 3 May 2000

Published in: Communications in Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00927879608825809

zbMATH Keywords

algorithmscommutative semigroupsfinitely generated commutative monoidscancellative monoidsfinite presentationsfinitely presented commutative monoids

Mathematics Subject Classification ID

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

Related Items (6)

Presentations for subsemigroups of finitely generated commutative semigroups ⋮ Irreducible ideals of finitely generated commutative monoids ⋮ Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations. ⋮ On normal affine semigroups ⋮ ON PRESENTATIONS OF COMMUTATIVE MONOIDS ⋮ Principal ideals of finitely generated commutative monoids

Cites Work

• Cancellativity in finitely presented semigroups
• Function minimum associated to a congruence on integral \(n\)-tuple space
• Rational sets in commutative monoids
• Generators and relations of abelian semigroups and semigroup rings
• A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A deterministic algorithm to decide if a finitely presented abelian monoid is cancellative