Let be the monoid generated by $ = {_1, …, _n} \subseteq ^d.$ We introduce the homogeneous catenary degree of as the smallest $N \in \mathbb N \in , = _1, …, _t = k, (k, {k+1}) \leq N,$ is the usual distance between factorizations, and the length of $_k, |_k|,\max{||, ||}. $ improves the monotone catenary degree as upper bound for the ordinary catenary degree, and we show that it can be effectively computed. We also prove that for half-factorial monoids, the tame degree and the -primality coincide, and that all possible catenary degrees of the elements of an affine semigroup of this kind occur as the catenary degree of one of its Betti elements.

生成讲解博客的中文版本

生成AI智能校验的中文版本