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

References

• Clifford , A.H. and Preston , G.B. 1961 . The Algebraic Theory of Semigroups . American Mathematical Society , 7 Mathematical surveys
   Google Scholar
• Cox , D. , Little , J. and Oshea , D. 1992 . Ideals, Varieties and Algorithms , Springer-Verlag .
   Google Scholar
• Eilenberg , S. and Schützenberger , M.P. 1969 . Rationsal Sets in Commutative Monoids . Journal of Algebra , 13 : 173 – 191 .
   Web of Science ®Google Scholar
• Gilmer , R. 1984 . Commutative Semigroup Rings , The University of Chicago Press .
   Google Scholar
• Herzog , J. 1970 . Generators and Relations of Abelian Semigroups and Semigroup Rings . Manuscripta Math , 3 : 175 – 1993 .
   Web of Science ®Google Scholar
• Huynh , D.T. 1986 . A Superexponential Lower Bound for Gröbner Bases and Church-Rosser Commutative Thue Systems . Information and Control , 68 : 196 – 206 .
   Google Scholar
• Jacobson , N. 1974 . Basic Algebra 1 , W. H. Freeman and Company .
   Google Scholar
• Jantzen , M. 1988 . Confluent String Rewriting , Springer-Verlag .
   Google Scholar
• Naicedkan , P. and ODúnlaing , C. 1989 . Cancellativity m Finitely Presented Semigroups . J. Symbolic Camputation , 7 : 457 – 472 .
   Google Scholar
• Rédei , L. 1965 . The Theory ofFinitely Generated Commutative Semigroups . Porgamon , 7
   Google Scholar
• Rosaiks , J.C. 1995 . Function Minimum Associated to a Congruence on Integral n-tuple space . Semigroup Forum , 51 : 87 – 95 .
   Google Scholar
• Rosalks , J.C. and Garcí Sanclirz , P.A. 1995 . An algorithm to Compute a Minimal Relation for Afline Semigroups , 51 Submitted
   Google Scholar
• Stukmfels , B. 1994 . Gröbner Bases and Convox Polytopes . Expanded Lecture Notes from the Holiday Symposium at New Mexico State University . December 27-31 1994 , Las Cruces.
   Google Scholar