The catenary and tame degree of numerical monoids generated by generalized arithmetic sequences

Details The catenary and tame degree of numerical monoids generated by generalized arithmetic sequences The catenary and tame degree of numerical monoids generated by generalized arithmetic sequences

2010-01-11

arxiv.org/abs/1001.1646v2

Mathematics

Number Theory

13 Pages

Scientific paper

Studying ceratin combinatorial properties of non-unique factorizations have been a subject of recent literatures. Little is known about two combinatorial invariants, namely the catenary degree and the tame degree, even in the case of numerical monoids. In this paper we compute these invariants for a certain class of numerical monoids generated by generalized arithmetic sequences. We also show that the difference between the tame degree and the catenary degree can be arbitrary large even if the number of minimal generators is fixed.

Affiliated with

Also associated with

No associations

Rating

The catenary and tame degree of numerical monoids generated by generalized arithmetic sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The catenary and tame degree of numerical monoids generated by generalized arithmetic sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The catenary and tame degree of numerical monoids generated by generalized arithmetic sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-719091