Minimal systems of generators for ideals of semigroups
E Briales, A Campillo, C Marijuán, P Pisón - Journal of Pure and Applied …, 1998 - Elsevier
E Briales, A Campillo, C Marijuán, P Pisón
Journal of Pure and Applied Algebra, 1998•Elsevier… The purpose of the present paper is to study completely an algorithmic method (based on
the method in [8]) computing a minimal system of binomial generators for I, in the general
case of a subsemigroup S of a finitely generated abelian group, such that S•(- S) = {0}. The
existence of such an algorithm was stated in [8]. The essential advantage of the considered
method is that the number of … Finally in Section 5, we apply everything to give the
algorithm to describe a minimal system of homogeneus binomial generators for I. … In this …
the method in [8]) computing a minimal system of binomial generators for I, in the general
case of a subsemigroup S of a finitely generated abelian group, such that S•(- S) = {0}. The
existence of such an algorithm was stated in [8]. The essential advantage of the considered
method is that the number of … Finally in Section 5, we apply everything to give the
algorithm to describe a minimal system of homogeneus binomial generators for I. … In this …
We give an algorithmic method to compute a minimal system of generators for I, in the general case of a subsemigroup S of a finitely generated abelian group, such that S∩(—S) = 0.
Elsevier
以上显示的是最相近的搜索结果。 查看全部搜索结果