Frobenius Allowable Gaps of Generalized Numerical Semigroups

  • Deepesh Singhal
  • Yuxin Lin


A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ for which the complement $\mathbb{N}^d\setminus S$ is finite. The points in the complement $\mathbb{N}^d\setminus S$ are called gaps. A gap $F$ is considered Frobenius allowable if there is some relaxed monomial ordering on $\mathbb{N}^d$ with respect to which $F$ is the largest gap. We characterize the Frobenius allowable gaps of a generalized numerical semigroup. A generalized numerical semigroup that has only one maximal gap under the natural partial ordering of $\mathbb{N}^d$ is called a Frobenius generalized numerical semigroup. We show that Frobenius generalized numerical semigroups are precisely those whose Frobenius gap does not depend on the relaxed monomial ordering. We estimate the number of Frobenius generalized numerical semigroup with a given Frobenius gap $F=(F^{(1)},\dots,F^{(d)})\in\mathbb{N}^d$ and show that it is close to $\sqrt{3}^{(F^{(1)}+1)\cdots (F^{(d)}+1)}$ for large $d$. We define notions of quasi-irreducibility and quasi-symmetry for generalized numerical semigroups. While in the case of $d=1$ these notions coincide with irreducibility and symmetry, they are distinct in higher dimensions.

Article Number