A deterministic algorithm to decide if a finitely presented abelian monoid is cancellative
DOI10.1080/00927879608825809zbMATH Open0940.20058OpenAlexW2045960680WikidataQ58843172 ScholiaQ58843172MaRDI QIDQ4370002FDOQ4370002
Authors: 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
Recommendations
- Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations.
- Presentations of finitely generated cancellative monoids and natural solutions of linear systems of equations.
- PRESENTATIONS OF FINITELY GENERATED SUBMONOIDS OF FINITELY GENERATED COMMUTATIVE MONOIDS
- Presentations of cancellative monoids
algorithmscommutative semigroupsfinite presentationscancellative monoidsfinitely generated commutative monoidsfinitely presented commutative monoids
Cites Work
- Rational sets in commutative monoids
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generators and relations of abelian semigroups and semigroup rings
- Title not available (Why is that?)
- A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
- Cancellativity in finitely presented semigroups
- Function minimum associated to a congruence on integral \(n\)-tuple space
Cited In (13)
- Irreducible ideals of finitely generated commutative monoids
- ON PRESENTATIONS OF COMMUTATIVE MONOIDS
- Presentations of cancellative monoids
- Principal ideals of finitely generated commutative monoids
- On normal affine semigroups
- A polynomial time algorithm to compute the Abelian kernel of a finite monoid
- A cancellativity criterion for presented monoids
- Title not available (Why is that?)
- On finitely presented, cancellative and commutative ordered monoids
- Presentations of finitely generated cancellative monoids and natural solutions of linear systems of equations.
- Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations.
- The global determinism of finitely generated free Abelian monoid.
- Presentations for subsemigroups of finitely generated commutative semigroups
This page was built for publication: A deterministic algorithm to decide if a finitely presented abelian monoid is cancellative
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4370002)
