arXiv Analytics

Sign in

arXiv:2207.08962 [math.CO]AbstractReferencesReviewsResources

$p$-numerical semigroups with $p$-symmetric properties

Takao Komatsu, Haotian Ying

Published 2022-07-18Version 1

e largest integer such that the linear equation $a_1 x_1+\cdots+a_k x_k=n$ ($a_1,\dots,a_k$ are given positive integers with $\gcd(a_1,\dots,a_k)=1$) does not have a non-negative integer solution $(x_1,\dots,x_k)$. The generalized Frobenius number (called the $p$-Frobenius number) is the largest integer such that this linear equation has at most $p$ solutions. That is, when $p=0$, the $0$-Frobenius number is the original Frobenius number. In this paper, we introduce and discuss $p$-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 $p$, $p$-gaps, $p$-symmetric semigroups, $p$-pseudo-symmetric semigroups, and the like are defined, and their properties are obtained. When $p=0$, they correspond to the original gaps, symmetric semigroups, and pseudo-symmetric semigroups, respectively.

Related articles: Most relevant | Search more
arXiv:1801.07135 [math.CO] (Published 2018-01-22)
Maximising the number of solutions to a linear equation in a set of integers
arXiv:1611.08498 [math.CO] (Published 2016-11-25)
A note on solution-free sets of integers
arXiv:2501.17136 [math.CO] (Published 2025-01-28, updated 2025-02-04)
On Monochromatic Solutions of Linear Equations Using At Least Three Colors