The Square Frobenius Number
arXiv:2006.14219
Abstract
Let be a numerical semigroup generated by the relatively prime positive integers . Let be an integer. In this paper, we consider the following -power variant of the Frobenius number of defined as In this paper, we investigate the case . We give an upper bound for for an infinite family of semigroups generated by {\em arithmetic progressions}. The latter turns out to be the exact value of under certain conditions. We present an exact formula for when and , study and and put forward two relevant conjectures. We finally discuss some related questions.