Abstract

The so-called Frobenius number in the famous linear Diophantine problem of Frobenius is the largest integer such that the linear equation [Formula: see text] ([Formula: see text] are given positive integers with [Formula: see text]) does not have a non-negative integer solution [Formula: see text]. The generalized Frobenius number (called the [Formula: see text]-Frobenius number) is the largest integer such that this linear equation has at most [Formula: see text] solutions. That is, when [Formula: see text], the [Formula: see text]-Frobenius number is the original Frobenius number. In this paper, we introduce and discuss [Formula: see text]-numerical semigroups by developing a generalization of the theory of numerical semigroups based on this flow of the number of representations. That is, for a certain non-negative integer [Formula: see text], [Formula: see text]-gaps, [Formula: see text]-symmetric semigroups, [Formula: see text]-pseudo-symmetric semigroups, and the like are defined, and their properties are obtained. When [Formula: see text], they correspond to the original gaps, symmetric semigroups and pseudo-symmetric semigroups, respectively.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call