For an integral domain$R$and a non-zero non-unit$a$ε$R$we consider the number of distinct factorizations of$a$^{$n$}into irreducible elements of$R$for large$n$. Precise results are obtained for Krull domains and certain noetherian domains. In fact, we prove results valid for certain classes of monoids which then apply to the above-mentioned classes of domains.

No abstract uploaded!

This paper introduces a new efficient algorithm, called MXL_3, for computing Gröbner bases of zero-dimensional ideals. The MXL_3 is based on XL algorithm, mutant strategy, and a new sufficient condition for a set of polynomials to be a Gröbner basis. We present experimental results comparing the behavior of MXL_3 to F_4 on HFE and random generated instances of the MQ problem. In both cases the first implementation of the MXL_3 algorithm succeeds faster and uses less memory than Magma’s implementation of F_4.

No abstract uploaded!

No abstract uploaded!