Longest and shortest factorizations in embedding dimension three

Abstract: For a numerical monoid

l a n g l e n_{1}, d o t s, n_{k} a n g l e

minimally generated by

n_{1}, d o t s, n_{k} i n m a t h b b N

with

n_{1} < c d o t s < n_{k}

, the longest and shortest factorization lengths of an element

x

, denoted as

L (x)

and

e l l (x)

, respectively, follow the identities

L (x + n_{1}) = L (x) + 1

and

e l l (x + n_{k}) = e l l (x) + 1

for sufficiently large elements

x

. We characterize when these identities hold for all elements of numerical monoids of embedding dimension three.

Recommendations

Cites work

This page was built for publication: Longest and shortest factorizations in embedding dimension three