Maximal Denumerant of a Numerical Semigroup With Embedding Dimension Less Than Four

preprint2012arXivOpen access

Abstract

Given a numerical semigroup S=<a1,a2,...,at>S = < a_1, a_2,..., a_t> and s∈Ss\in S, we consider the factorization s=c1a1+c2a2+...+ctats = c_1 a_1 + c_2 a_2 +... + c_t a_t where ci≥0c_i\ge0. Such a factorization is {\em maximal} if c1+c2+...+ctc_1+c_2+...+c_t is a maximum over all such factorizations of ss. We show that the number of maximal factorizations, varying over the elements in SS, is always bounded. Thus, we define $\dx(S)$ to be the maximum number of maximal factorizations of elements in SS. We study maximal factorizations in depth when SS has embedding dimension less than four, and establish formulas for $\dx(S)$ in this case.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.