Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 87 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 17 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 102 tok/s Pro
Kimi K2 166 tok/s Pro
GPT OSS 120B 436 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Maximal Denumerant of a Numerical Semigroup With Embedding Dimension Less Than Four (1102.5518v2)

Published 27 Feb 2011 in math.AC

Abstract: Given a numerical semigroup $S = < a_1, a_2,..., a_t>$ and $s\in S$, we consider the factorization $s = c_1 a_1 + c_2 a_2 +... + c_t a_t$ where $c_i\ge0$. Such a factorization is {\em maximal} if $c_1+c_2+...+c_t$ is a maximum over all such factorizations of $s$. We show that the number of maximal factorizations, varying over the elements in $S$, is always bounded. Thus, we define $\dx(S)$ to be the maximum number of maximal factorizations of elements in $S$. We study maximal factorizations in depth when $S$ has embedding dimension less than four, and establish formulas for $\dx(S)$ in this case.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.