Abstract
Given a numerical semigroup and , we consider the factorization where . Such a factorization is {\em maximal} if is a maximum over all such factorizations of . We show that the number of maximal factorizations, varying over the elements in , is always bounded. Thus, we define $\dx(S)$ to be the maximum number of maximal factorizations of elements in . We study maximal factorizations in depth when has embedding dimension less than four, and establish formulas for $\dx(S)$ in this case.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.