On Some Properties for Cofiniteness of Submonoids and Ideals of an Affine Semigroup

Abstract

Let S and $\mathcal{C}$ be affine semigroups in ${\mathbb{N}}^d$ such that $S\subseteq \mathcal{C}$. We provide a characterization for the set $\mathcal{C}\setminus S$ to be finite, together with a procedure and computational tools to check whether such a set is finite and, if so, compute its elements. As a consequence of this result, we provide a characterization for an ideal I of an affine semigroup S so that $S\setminus I$ is a finite set. If so, we provide some procedures to compute the set $S\setminus I$.

1. Introduction

Let $\mathbb{N}$ be the set of non-negative integers. A monoid S is called an affine semigroup if it is a finitely generated submonoid of the additive monoid ${\mathbb{N}}^d$, for some positive integer d. Equivalently, up to isomorphism, S is a monoid that is finitely generated, cancellative, torsion free and reduced (see [1] for an overview on affine semigroups). We recall that a monoid $S\subseteq {\mathbb{Z}}^d$ is finitely generated if there exists a finite set $A\subseteq {\mathbb{Z}}^d$ contained in S such that $S=⟨A⟩$, where

$$⟨A⟩=\left\{\sum _{i=1}^n{\lambda }_i{\mathbf{a}}_i\mid n\in \mathbb{N},{\mathbf{a}}_i\in A,{\lambda }_i\in \mathbb{N}\mathrm{for}\mathrm{all}i\in \{1,\dots ,n\}\right\}.$$

In particular, $S=⟨A⟩$ is called the monoid generated by A and A is a set of generators of S. It is known that, for every submonoid S of ${\mathbb{N}}^d$, there exists a unique minimal set that generates S, that is $(S\setminus \{\mathbf{0}\left\}\right)\setminus (S\setminus \{\mathbf{0}\}+S\setminus \{\mathbf{0}\left\}\right)$. In particular, if S is an affine semigroup, such a set is finite.

Let ${\mathbb{Q}}_{+}$ be the the set of non-negative rational numbers. If $S=⟨A⟩\subseteq {\mathbb{N}}^d$ is an affine semigroup, we consider the sets $\mathrm{cone}\left(S\right)=\{{\sum }_{i=1}^n{q}_i{\mathbf{a}}_i\mid n\in \mathbb{N},{\mathbf{a}}_i\in A,q_i\in {\mathbb{Q}}_{+}\mathrm{for}\mathrm{all}i\in \{1,\dots ,n\}\}$, that is the cone spanned by S, and $\mathrm{Group}\left(S\right)=\{\mathbf{a}-\mathbf{b}\in {\mathbb{Z}}^d\mid \mathbf{a},\mathbf{b}\in S\}$, that is called the group generated by S. The sets $\mathcal{N}\left(S\right)=\mathrm{cone}\left(S\right)\cap \mathrm{Group}\left(S\right)$, called the normalization of S, and ${\mathcal{C}}_S=\mathrm{cone}\left(S\right)\cap {\mathbb{N}}^d$ are affine semigroups (by Gordan’s Lemma, see for instance [2] (Lemma 2.9). Since S is finitely generated, if $\{{\mathbf{g}}_1,\dots ,{\mathbf{g}}_n\}\subseteq {\mathbb{N}}^d$ is its minimal set of generators, by relabeling if necessary, without loss of generality, we may assume that there exists $r\le n$ such that $\mathrm{cone}\left(S\right)=\mathrm{cone}\left(\{{\mathbf{g}}_1,\dots ,{\mathbf{g}}_r\}\right)$. For minimality, we may also assume that $\mathrm{cone}(\{{\mathbf{g}}_1,\dots ,{\mathbf{g}}_r\}\setminus \left\{{\mathbf{g}}_i\right\})\ne \mathrm{cone}\left(S\right)$ for each $i\in \{1,\dots ,r\}$. In such a case, ${\mathbf{g}}_i\notin \mathrm{cone}(\{{\mathbf{g}}_1,\dots ,{\mathbf{g}}_r\}\setminus \left\{{\mathbf{g}}_i\right\})$ for each $i\in \{1,\dots ,r\}$ (otherwise $\mathrm{cone}(\{{\mathbf{g}}_1,\dots ,{\mathbf{g}}_r\}\setminus \left\{{\mathbf{g}}_i\right\})=\mathrm{cone}(\{{\mathbf{g}}_1,\dots ,{\mathbf{g}}_r\}=\mathrm{cone}\left(S\right)$). We say that $\{{\mathbf{g}}_1,\dots ,{\mathbf{g}}_r\}$ is a set of extreme rays of S.

One of the motivations for studying affine semigroups is to extend the notion of numerical semigroup and some of its properties. A numerical semigroup is a submonoid S of $\mathbb{N}$ such that $\mathbb{N}\setminus S$ is finite. It is known that every numerical semigroup is a finitely generated monoid (so it is an affine semigroup) and every submonoid of $\mathbb{N}$ is isomorphic to a numerical semigroup. Moreover, it is known that, if $S=⟨g_1,\dots ,g_n⟩\subseteq \mathbb{N}$, then S is a numerical semigroup if and only if $\gcd (g_1,\dots ,g_n)=1$. The monographs [3,4] are very good references for this and other interesting properties of numerical semigroups.

A possible way to generalize the notion of numerical semigroup to submonoids in ${\mathbb{N}}^d$ is to focus on the property of cofiniteness. In general, we say that a set A is cofinite in B if $A\subseteq B$ and $B\setminus A$ is a finite set. In particular, a numerical semigroup is a cofinite monoid in $\mathbb{N}$. A straightforward step in this direction is to consider submonoids S of ${\mathbb{N}}^d$ such that ${\mathbb{N}}^d\setminus S$ is finite. These kinds of monoids have been introduced in [5], where they are called generalized numerical semigroups. The study of the properties of these monoids is still an active area of research (for some recent works, see for instance [6,7]). A more general situation is considered in [8], where the authors introduce the class of monoids S such that ${\mathcal{C}}_S\setminus S$ is finite. A monoid S of such a family is called a ${\mathcal{C}}_S$-semigroup. In particular, a generalized numerical semigroup is a ${\mathcal{C}}_S$-semigroup such that ${\mathcal{C}}_S={\mathbb{N}}^d$. Some recent results on ${\mathcal{C}}_S$-semigroups are contained, for instance, in [9,10,11]. It is known that, if S is a ${\mathcal{C}}_S$-semigroup, then S is finitely generated (so, the same occurs when S is a generalized numerical semigroup), that is, the mentioned families of submonoids of ${\mathbb{N}}^d$ are classes of affine semigroups.

A natural problem is to consider a set $A\subseteq {\mathbb{N}}^d$ and characterize when the set $S=⟨A⟩$ is a ${\mathcal{C}}_S$-semigroup. A result of this type has been provided firstly in [12] (Theorem 2.8) for generalized numerical semigroups and later in [13] (Theorem 9) for the general case of ${\mathcal{C}}_S$-semigroups. Having in mind these results, in this paper, we consider a further generalization for the property of cofiniteness of an affine semigroup $S\subseteq {\mathbb{N}}^d$, considering that the case S is cofinite in another affine semigroup $\mathcal{C}\subseteq {\mathbb{N}}^d$. In particular, in the main result of this work, we provide a characterization for an affine semigroup $S\subseteq {\mathbb{N}}^d$ to be cofinite in an affine semigroup $\mathcal{C}\subseteq {\mathbb{N}}^d$, in terms of the generators of $\mathcal{C}$. We call this kind of monoids $\mathcal{C}$-cofinite. We provide such a result in Section 2, together with a procedure and computational tools to check whether an affine semigroup is $\mathcal{C}$-cofinite for a fixed affine monoid $\mathcal{C}$ and, if so, to compute the set $\mathcal{C}\setminus S$.

As a consequence of the previous result, we obtain a characterization for an ideal of an affine semigroup to be cofinite in it. We recall that, if S is an affine semigroup, an ideal I of S is a subset $I\subseteq S$ such that $I+S\subseteq I$ (in general, for $X,Y\subseteq {\mathbb{N}}^d$, set $X+Y=\{\mathbf{x}+\mathbf{y}\mid \mathbf{x}\in X,\mathbf{y}\in Y\}$). In Section 3, we give such a characterization so that $S\setminus I$ is finite. Furthermore, for a given affine semigroup S and an ideal I of it, we provide two different approaches in order to check whether $S\setminus I$ is finite and, if so, to compute its elements: the first one uses similar procedures to those suggested for $\mathcal{C}$-cofinite submonoids, the second one uses tools from commutative algebra. Finally, we conclude with some remarks about a relation of this subject with the Apéry set of a subset of an affine semigroup.

2. Cofinite Submonoids of an Affine Semigroup

The first aim of this section is to provide a characterization, for a submonoid S of an affine semigroup $\mathcal{C}$, to have finite complement in it. After giving a definition for this kind of monoids and showing that they are also affine semigroups, we introduce some useful tools to prove the mentioned characterization.

Definition 1. 

Let $\mathcal{C}\subseteq {\mathbb{N}}^d$ be an affine semigroup. A submonoid S of $\mathcal{C}$ is called $\mathcal{C}$-cofinite if the set $\mathcal{C}\setminus S$ is finite.

For the next result, we recall that a term order ⪯ (or monomial order) on ${\mathbb{N}}^d$ is a total order such that $\mathbf{0}⪯\mathbf{v}$ for all $\mathbf{v}\in {\mathbb{N}}^d$ and if $\mathbf{v}⪯\mathbf{w}$, then the inequality $\mathbf{v}+\mathbf{u}⪯\mathbf{w}+\mathbf{u}$ holds for all $\mathbf{u}\in {\mathbb{N}}^d$ (see Chapter 2, §2 of [14], also, for some concrete examples of term orders). We use the notation $\mathbf{v}\prec \mathbf{w}$ for $\mathbf{v}⪯\mathbf{w}$ and $\mathbf{v}\ne \mathbf{w}$.

Proposition 1. 

Let $\mathcal{C}\subseteq {\mathbb{N}}^d$ be an affine semigroup and $S\subseteq \mathcal{C}$ be a $\mathcal{C}$-cofinite submonoid. Then, S is finitely generated.

Proof. 

Let $\mathcal{C}\setminus S=\{{\mathbf{h}}_1\prec \cdots \prec {\mathbf{h}}_r\}$ for some term order ⪯, with $\mathcal{C}=⟨{\mathbf{g}}_1,{\mathbf{g}}_2,\dots ,{\mathbf{g}}_n⟩$. We show that ${\mathbf{h}}_1$ is a minimal generator of $\mathcal{C}$. In fact, we suppose that ${\mathbf{h}}_1=\mathbf{a}+\mathbf{b}$ with $\mathbf{a},\mathbf{b}\in \mathcal{C}\setminus \left\{\mathbf{0}\right\}$. In particular, ${\mathbf{h}}_1\ne \mathbf{a}$ and ${\mathbf{h}}_1\ne \mathbf{b}$. If ${\mathbf{h}}_1\prec \mathbf{a}$, then ${\mathbf{h}}_1\prec {\mathbf{h}}_1+\mathbf{b}\prec \mathbf{a}+\mathbf{b}$, which contradicts ${\mathbf{h}}_1=\mathbf{a}+\mathbf{b}$. Hence, $\mathbf{a}\prec {\mathbf{h}}_1$ and, by a similar argument, $\mathbf{b}\prec {\mathbf{h}}_1$. As a consequence, by the minimality of ${\mathbf{h}}_1$ we have $\mathbf{a},\mathbf{b}\in S$, obtaining ${\mathbf{h}}_1\in S$, a contradiction. So, ${\mathbf{h}}_1$ is a minimal generator of $\mathcal{C}$ and we can suppose ${\mathbf{h}}_1={\mathbf{g}}_1$. We can argue that $\mathcal{C}\setminus \left\{{\mathbf{h}}_1\right\}=⟨{\mathbf{g}}_2,\dots ,{\mathbf{g}}_n,{\mathbf{g}}_2+{\mathbf{h}}_1,\dots ,{\mathbf{g}}_n+{\mathbf{h}}_1,2{\mathbf{h}}_1,3{\mathbf{h}}_1⟩$. We can use the same argument to show that ${\mathbf{h}}_2$ is a minimal generator of $\mathcal{C}\setminus \left\{{\mathbf{h}}_1\right\}$ and so on, until we provide a finite set of generators of $\mathcal{C}\setminus \{{\mathbf{h}}_1,\dots ,{\mathbf{h}}_r\}$.    □

Let $\mathcal{C}=⟨{\mathbf{g}}_1,{\mathbf{g}}_2,\dots ,{\mathbf{g}}_n⟩\subseteq {\mathbb{N}}^d$ be an affine semigroup. We denote by ${\mathbf{e}}_1,\dots ,{\mathbf{e}}_n$ the standard basis vectors of the vector space ${\mathbb{R}}^n$; in particular, ${\mathbb{N}}^n=⟨{\mathbf{e}}_1,\dots ,{\mathbf{e}}_n⟩$ as a monoid. We consider the following map:

$$f_{\mathcal{C}}:{\mathbb{N}}^n⟶\mathcal{C},\sum _{i=1}^n{a}_i{\mathbf{e}}_i⟼\sum _{i=1}^n{a}_i{\mathbf{g}}_i.$$

Then, $f_{\mathcal{C}}$ is a monoid epimorphism. We observe that, if $\mathbf{a}\in \mathcal{C}$, then $f_{\mathcal{C}}^{-1}\left(\mathbf{a}\right)$ is the set of factorizations of $\mathbf{a}$ as combination of vectors in the set $\{{\mathbf{g}}_1,{\mathbf{g}}_2,\dots ,{\mathbf{g}}_n\}$.

Lemma 1. 

Let $\mathcal{C}=⟨{\mathbf{g}}_1,{\mathbf{g}}_2,\dots ,{\mathbf{g}}_n⟩\subseteq {\mathbb{N}}^d$ be an affine semigroup. We suppose S is a submonoid of $\mathcal{C}$. Then,

1. 

$\mathcal{C}\setminus S$ is a finite set if and only if ${\mathbb{N}}^n\setminus f_{\mathcal{C}}^{-1}\left(S\right)$ is a finite set.

2. 

$\mathcal{C}\setminus S=\{f_{\mathcal{C}}\left(\mathbf{h}\right)\mid \mathbf{h}\in {\mathbb{N}}^n\setminus f_{\mathcal{C}}^{-1}\left(S\right)\}$.

Proof. 

We denote $T=f_{\mathcal{C}}^{-1}\left(S\right)$. We observe that T is a submonoid of ${\mathbb{N}}^n$. Moreover, since $f_{\mathcal{C}}$ is a surjective function, we have ${\mathbb{N}}^n\setminus T=f_{\mathcal{C}}^{-1}\left(\mathcal{C}\right)\setminus f_{\mathcal{C}}^{-1}\left(S\right)=f_{\mathcal{C}}^{-1}(\mathcal{C}\setminus S)$. From this equality, we easily obtain that $|\mathcal{C}\setminus S|\le |{\mathbb{N}}^n\setminus T|$. Therefore, if T is ${\mathbb{N}}^n$-cofinite, then $\mathcal{C}\setminus S$ is a finite set. Moreover, for all $\mathbf{x}\in \mathcal{C}$, the set $f_{\mathcal{C}}^{-1}\left(\mathbf{x}\right)=\{\mathbf{h}\in {\mathbb{N}}^n\mid f_{\mathcal{C}}\left(\mathbf{h}\right)=\mathbf{x}\}$ is finite. In fact, each element of an affine semigroup has a finite number of factorizations. In particular, if $\mathcal{C}\setminus S$ is finite, then ${\mathbb{N}}^n\setminus T={\bigcup }_{\mathbf{x}\in \mathcal{C}\setminus S}{f}_{\mathcal{C}}^{-1}\left(\mathbf{x}\right)$ is finite. So, claim (1) is proved. Furthermore, by ${\mathbb{N}}^n\setminus T=f_{\mathcal{C}}^{-1}(\mathcal{C}\setminus S)$, since $f_{\mathcal{C}}$ is surjective, we have $f_{\mathcal{C}}(\mathbb{N}\setminus T)=f_{\mathcal{C}}\left(f_{\mathcal{C}}^{-1}(\mathcal{C}\setminus S)\right)=\mathcal{C}\setminus S$. In particular, we obtain claim (2).    □

We remind that a characterization for a submonoid $T\subseteq {\mathbb{N}}^n$ to be ${\mathbb{N}}^n$-cofinite is provided in [12] (Theorem 2.8). For completeness, we state the result here, since it will be useful later.

Theorem 1 

([12]). Let $A\subseteq {\mathbb{N}}^n$. Then, $⟨A⟩$ is ${\mathbb{N}}^n$-cofinite if and only if the set A fulfills each one of the following conditions:

1. 

For all $i\in \{1,\dots ,n\}$ there exist $a_1^{\left(i\right)}{\mathbf{e}}_i,a_2^{\left(i\right)}{\mathbf{e}}_i,\dots ,a_{s_i}^{\left(i\right)}{\mathbf{e}}_i\in A$, with $s_i\in \mathbb{N}\setminus \left\{0\right\}$, $a_j^{\left(i\right)}\in \mathbb{N}\setminus \left\{0\right\}$, such that $\gcd (a_1^{\left(i\right)},a_2^{\left(i\right)},\dots ,a_{s_i}^{\left(i\right)})=1$.

2.

For each $i,j\in \{1,\dots ,n\}$, with $i\ne j$, there exists $n_i^{\left(j\right)}\in \mathbb{N}$ such that ${\mathbf{e}}_i+n_i^{\left(j\right)}{\mathbf{e}}_j\in A$.

Next, we provide the mentioned characterization for a submonoid $S\subseteq \mathcal{C}$ to be $\mathcal{C}$-cofinite.

Theorem 2. 

Let $\mathcal{C}=⟨{\mathbf{g}}_1,{\mathbf{g}}_2,\dots ,{\mathbf{g}}_n⟩\subseteq {\mathbb{N}}^d$ be an affine semigroup and $S\subseteq \mathcal{C}$ be a submonoid. Then, S is $\mathcal{C}$-cofinite if and only if the following two conditions are verified:

1. 

For all $i\in \{1,\dots ,n\}$, the set $S_i=\{\lambda \in \mathbb{N}\mid \lambda {\mathbf{g}}_i\in S\}$ is a numerical semigroup.

2. 

For each $i,j\in \{1,\dots ,n\}$, with $i\ne j$, there exists $n_i^{\left(j\right)}\in \mathbb{N}$ such that ${\mathbf{g}}_i+n_i^{\left(j\right)}{\mathbf{g}}_j\in S$.

Proof. 

Necessity. It is not difficult to see that the set $S_i$ is a monoid for all $i\in \{1,\dots ,n\}$. If the first condition is not verified, then there exists i such that the set $\{\lambda \in \mathbb{N}\mid \lambda {\mathbf{g}}_i\notin S\}\subseteq \mathcal{C}\setminus S$ is not finite. If the second condition is not verified, then, for some $i,j$, with $i\ne j$, we have that ${\mathbf{g}}_i+\mu {\mathbf{g}}_j\notin S$ for all $\mu \in \mathbb{N}$.

Sufficiency. We assume that $S_i=⟨{\lambda }_1^{\left(i\right)},{\lambda }_2^{\left(i\right)},\dots ,{\lambda }_{s_i}^{\left(i\right)}⟩$ is a numerical semigroup for all $i\in \{1,\dots ,n\}$. In particular, $⟨{\lambda }_1^{\left(i\right)}{\mathbf{g}}_i,{\lambda }_2^{\left(i\right)}{\mathbf{g}}_i,\dots ,{\lambda }_{s_i}^{\left(i\right)}{\mathbf{g}}_i⟩\subseteq S$ and $\gcd ({\lambda }_1^{\left(i\right)},{\lambda }_2^{\left(i\right)},\dots ,{\lambda }_{s_i}^{\left(i\right)})=1$, for each $i\in \{1,\dots ,n\}$. Moreover, for all $i,j\in \{1,\dots ,n\}$, with $i\ne j$, we can consider $n_i^{\left(j\right)}=\min \{n\in \mathbb{N}\mid {\mathbf{g}}_i+n{\mathbf{g}}_j\in S\}$. For each $i\in \{1,\dots ,n\}$, we set $G_i=\{{\lambda }_1^{\left(i\right)}{\mathbf{e}}_i,{\lambda }_2^{\left(i\right)}{\mathbf{e}}_i,\dots ,{\lambda }_{s_i}^{\left(i\right)}{\mathbf{e}}_i\}\subseteq {\mathbb{N}}^n$. Let $\mathcal{G}=\left({\cup }_{i=1}^n{G}_i\right)\cup \{{\mathbf{e}}_i+n_i^{\left(j\right)}{\mathbf{e}}_j\mid i\ne j\}\subseteq {\mathbb{N}}^n$. The set $\mathcal{G}$ satisfies the conditions of Theorem 1, so $⟨\mathcal{G}⟩$ is ${\mathbb{N}}^n$-cofinite. We consider the monoid $T=f_{\mathcal{C}}^{-1}\left(S\right)\subseteq {\mathbb{N}}^n$. We observe that, if $\mathbf{x}\in \mathcal{G}$, then $f_{\mathcal{C}}\left(\mathbf{x}\right)\in S$, that is, $\mathcal{G}\subseteq T$. In particular, $⟨\mathcal{G}⟩\subseteq T$ and, as a consequence, ${\mathbb{N}}^n\setminus T\subseteq {\mathbb{N}}^n\setminus ⟨\mathcal{G}⟩$. Therefore, T is ${\mathbb{N}}^n$-cofinite and, by Lemma 1, $\mathcal{C}\setminus S$ is finite.    □

Let S and $\mathcal{C}$ be affine semigroups, $S\subseteq \mathcal{C}$. We recall that, for $\mathcal{C}={\mathcal{C}}_S$, a characterization so that $|{\mathcal{C}}_S\setminus S|<\infty$ has been provided in [13] (Theorem 9) and, in the same paper, the authors provide a procedure to compute ${\mathcal{C}}_S\setminus S$.

Theorem 2, in this form, can be viewed as a generalization of Theorem 1. The main difference is the following: in the case $\mathcal{C}={\mathbb{N}}^d$ (and the same can be trivially considered in the case $\mathcal{C}\cong {\mathbb{N}}^r$ for some positive integer r), the elements satisfying the two conditions of Theorem 1 belong to every set of generators of S. In particular, they belong to the minimal set of generators of S. In the case $\mathcal{C}⊊{\mathbb{N}}^d$ (and $\mathcal{C}\ncong {\mathbb{N}}^r$ for all positive integer r), instead, we have to look for these elements in the whole semigroup S. It is not possible, in general, to consider only a set of the generators of S: see, for instance, Example 1 and Example 2 below, where the elements $3{\mathbf{g}}_1,{\mathbf{g}}_1+2{\mathbf{g}}_3$ belong to S but they do not belong to its set of minimal generators.

Now, we want to suggest a possible way to verify computationally the two conditions of Theorem 2. We assume $\mathcal{C}=⟨{\mathbf{g}}_1,\dots ,{\mathbf{g}}_n⟩$ and suppose $S=⟨{\mathbf{n}}_1,{\mathbf{n}}_2,\dots ,{\mathbf{n}}_t⟩$. So, we focus on the following:

1.

For all $i\in \{1,\dots ,n\}$, the set $S_i=\{\lambda \in \mathbb{N}\mid \lambda {\mathbf{g}}_i\in S\}$ is a numerical semigroup.

2.

For each $i,j\in \{1,\dots ,n\}$, $i\ne j$, there exists $n_i^{\left(j\right)}\in \mathbb{N}$ such that ${\mathbf{g}}_i+n_i^{\left(j\right)}{\mathbf{g}}_j\in S$.

Condition 1. 

Let $i\in \{1,\dots ,n\}$. We observe that

$$\{\lambda \in \mathbb{N}\mid \lambda {\mathbf{g}}_i\in S\}=\left\{\lambda \in \mathbb{N}\mid \sum _{j=1}^t{\lambda }_j{\mathbf{n}}_j+\lambda (-{\mathbf{g}}_i)=0,\mathrm{for}\mathrm{some}{\lambda }_1,\dots ,{\lambda }_n\in \mathbb{N}\right\}.$$

Let $A^{\left(i\right)}=[{\mathbf{n}}_1,{\mathbf{n}}_2,\dots ,{\mathbf{n}}_t,-{\mathbf{g}}_i]$ be the matrix whose columns are the elements of the finite set of generators of S and the column vector related to $-{\mathbf{g}}_i\in {\mathbb{Z}}^d$. So $A^{\left(i\right)}$ has $t+1$ columns and entries in $\mathbb{Z}$. We identify every element $\mathbf{x}\in {\mathbb{N}}^{t+1}$ with its column vector and consider the Diophantine linear system $A^{\left(i\right)}\mathbf{x}=0$. It is easy to see that

$$\{\lambda \in \mathbb{N}\mid \lambda {\mathbf{g}}_i\in S\}=\{x_{t+1}\mid A^{\left(i\right)}\mathbf{x}=0\mathrm{with}\mathbf{x}=(x_1,\dots ,x_t,x_{t+1})\in {\mathbb{N}}^{t+1}\}.$$

Let $M_i\subseteq {\mathbb{N}}^{t+1}$ be the set of non-negative integer solutions of the homogeneous Diophantine linear system $A^{\left(i\right)}\mathbf{x}=0$. It is known that $M_i$ is an affine semigroup in ${\mathbb{N}}^{t+1}$ (see for instance [15] (Section 1)), so there exists a finite set $B_i\subseteq {\mathbb{N}}^{t+1}$, such that $M_i=⟨B_i⟩$. Hence, $S_i=⟨\{x_{t+1}\in \mathbb{N}\mid (x_1,\dots ,x_t,x_{t+1})\in B_i\}⟩$. It is possible to perform these computations in the computer algebra software GAP [16] with the package numericalsgps [17]. It is also recommended to use the package NormalizInterface (that is an interface in GAP for the software Normaliz, see [18,19]), in order to speed up the computation time.

Example 1. 

We consider the affine semigroups $\mathcal{C}=⟨(1,1),(1,2),(2,1),(3,1)⟩$ and $S=\mathcal{C}\setminus \left\{\right(1,1),(3,2),(2,3\left)\right\}=⟨(1,2),(2,1),(2,2),(3,1),(3,5)⟩$. Let us compute a finite set of generators of $S_1=\{\lambda \in \mathbb{N}\mid \lambda {\mathbf{g}}_1\in S\}$, where ${\mathbf{g}}_1=(1,1)$. We need to find the non-negative integer solutions of the linear Diophantine system $A\mathbf{x}=0$, where A has column vectors $(1,2),(2,1),(2,2),(3,1),(3,5),(-1,-1)$.

gap> LoadPackage(“num”);;

gap> NumSgpsUseNormaliz();;

gap> A:=[[1,2],[2,1],[2,2],[3,1],[3,5],[-1,-1]];;

gap> n:=Length(A);;

gap> A:=TransposedMat(A);

[ [ 1, 2, 2, 3, 3, -1 ], [ 2, 1, 2, 1, 5, -1 ] ]

gap> sol:=HilbertBasisOfSystemOfHomogeneousEquations(A,[]);

[ [ 0, 0, 0, 1, 1, 6 ], [ 0, 0, 1, 0, 0, 2 ], [ 0, 2, 0, 0, 1, 7 ],

  [ 1, 1, 0, 0, 0, 3 ], [ 2, 0, 0, 1, 0, 5 ] ]

gap> B:=List(sol,i->i[n]);

[ 6, 2, 7, 3, 5 ]

gap> Gcd(B);

1

gap> MinimalGenerators(NumericalSemigroup(B));

[ 2, 3 ]

• Therefore, the previous computations allow to check that $S_1=⟨2,3⟩$.

In order to verify the first condition of Theorem 2 for elements related to an extreme ray $\mathbf{g}$ of $\mathcal{C}$ having the greatest common divisor of its coordinates equal to 1, it suffices to perform an easier check on a finite set of generators of S, as stated by the following result.

Proposition 2. 

Let $\mathcal{C}=⟨{\mathbf{g}}_1,{\mathbf{g}}_2,\dots ,{\mathbf{g}}_r,{\mathbf{g}}_{r+1},{\mathbf{g}}_{r+2},\dots ,{\mathbf{g}}_{r+m}⟩\subseteq {\mathbb{N}}^d$ be an affine semigroup such that $\mathrm{cone}\left(\mathcal{C}\right)=\mathrm{cone}\left(\{{\mathbf{g}}_1,\dots ,{\mathbf{g}}_r\}\right)$. We assume that ${\mathbf{g}}_i\notin \mathrm{cone}(\{{\mathbf{g}}_1,\dots ,{\mathbf{g}}_r\}\setminus \left\{{\mathbf{g}}_i\right\})$ for some $i\in \{1,\dots ,r\}$ and that the greatest common divisor of the coordinates of ${\mathbf{g}}_i$ is 1. We suppose that $S\subseteq \mathcal{C}$ is a submonoid and denote by A the minimal set of generators of S. We consider the monoid $S_i=\{\lambda \in \mathbb{N}\mid \lambda {\mathbf{g}}_i\in S\}\subseteq \mathbb{N}$ and let $\{{\lambda }_1^{\left(i\right)},{\lambda }_2^{\left(i\right)},\dots ,{\lambda }_{s_i}^{\left(i\right)}\}$ be the minimal set of generators of $S_i$. Then, $\{{\lambda }_1^{\left(i\right)}{\mathbf{g}}_i,{\lambda }_2^{\left(i\right)}{\mathbf{g}}_i,\dots ,{\lambda }_{s_i}^{\left(i\right)}{\mathbf{g}}_i\}\subseteq A$.

Proof. 

Let $\ell \in \{1,\dots ,s_i\}$. We want to prove that ${\lambda }_{\ell }^{\left(i\right)}{\mathbf{g}}_i\in A$. First of all, we observe that, if ${\lambda }_{\ell }^{\left(i\right)}{\mathbf{g}}_i={\sum }_{j=1}^r{\beta }_j{\mathbf{g}}_j$ with ${\beta }_j\in {\mathbb{Q}}_{\ge 0}$, then ${\beta }_j=0$ for all $j\ne i$. In fact, if there exists $k\in \{1,\dots ,r\}\setminus \left\{i\right\}$ such that ${\beta }_k\ne 0$, then ${\beta }_i<{\lambda }_{\ell }^{\left(i\right)}$. In particular, $({\lambda }_{\ell }^{\left(i\right)}-{\beta }_i){\mathbf{g}}_i={\sum }_{j=1,j\ne i}^r{\beta }_j{\mathbf{g}}_j$, from which we easily obtain that ${\mathbf{g}}_i\in \mathrm{cone}(\{{\mathbf{g}}_1,\dots ,{\mathbf{g}}_r\}\setminus \left\{{\mathbf{g}}_i\right\})$, a contradiction. So, the only possibility is ${\beta }_i=\lambda$ and ${\beta }_j=0$ for all $j\in \{1,\dots ,r\}\setminus \left\{i\right\}$.

• We know that ${\lambda }_{\ell }^{\left(i\right)}{\mathbf{g}}_i\in ⟨A⟩=S$ and suppose that ${\lambda }_{\ell }^{\left(i\right)}{\mathbf{g}}_i\notin A$. Hence, ${\lambda }_{\ell }^{\left(i\right)}{\mathbf{g}}_i={\sum }_{\mathbf{a}\in A}{\mu }_{\mathbf{a}}\mathbf{a}$ for some ${\mu }_{\mathbf{a}}\in \mathbb{N}$ such that ${\sum }_{\mathbf{a}\in A}{\mu }_{\mathbf{a}}>1$. For every $\mathbf{a}\in A$, we have $\mathbf{a}\in \mathcal{C}$. In particular, $\mathbf{a}\in \mathrm{cone}\left(\{{\mathbf{g}}_1,\dots ,{\mathbf{g}}_r\}\right)$. For $\mathbf{a}\in A$, we assume $\mathbf{a}={\sum }_{j=1}^r{\gamma }_{(\mathbf{a},j)}{\mathbf{g}}_j$ with ${\gamma }_{(\mathbf{a},j)}\in {\mathbb{Q}}_{\ge 0}$ for each $j\in \{1,\dots ,r\}$. As a consequence, ${\lambda }_{\ell }^{\left(i\right)}{\mathbf{g}}_i={\sum }_{\mathbf{a}\in A}{\mu }_{\mathbf{a}}\mathbf{a}={\sum }_{j=1}^r\left({\sum }_{\mathbf{a}\in A}{\mu }_{\mathbf{a}}{\gamma }_{(\mathbf{a},j)}\right){\mathbf{g}}_j$. By the discussion at the beginning of the proof, we have ${\sum }_{\mathbf{a}\in A}{\mu }_{\mathbf{a}}{\gamma }_{(\mathbf{a},j)}=0$ for all $j\in \{1,\dots ,r\}\setminus \left\{i\right\}$. So, for all $j\in \{1,\dots ,r\}\setminus \left\{i\right\}$, since ${\mu }_{\mathbf{a}}{\gamma }_{(\mathbf{a},j)}\ge 0$, the only possibility is ${\mu }_{\mathbf{a}}{\gamma }_{(\mathbf{a},j)}=0$. In particular, if ${\mu }_{\mathbf{a}}\ne 0$, we have ${\gamma }_{(\mathbf{a},j)}=0$ for all $j\in \{1,\dots ,r\}\setminus \left\{i\right\}$. Then, for all $\mathbf{a}\in A$ with ${\mu }_{\mathbf{a}}\ne 0$, we have $\mathbf{a}={\gamma }_{(\mathbf{a},i)}{\mathbf{g}}_i$ for some ${\gamma }_{(\mathbf{a},i)}\in {\mathbb{Q}}_{\ge 0}\setminus \left\{0\right\}$. Since ${\mathbf{g}}_i,\mathbf{a}\in {\mathbb{N}}^d$, the hypothesis that the greatest common divisor of the coordinates of ${\mathbf{g}}_i$ is 1 forces ${\gamma }_{(\mathbf{a},i)}\in \mathbb{N}\setminus \left\{0\right\}$. Therefore, for all $\mathbf{a}\in A$ with ${\mu }_{\mathbf{a}}\ne 0$, we have ${\gamma }_{(\mathbf{a},i)}\in S_i=⟨{\lambda }_1^{\left(i\right)},{\lambda }_2^{\left(i\right)},\dots ,{\lambda }_{s_i}^{\left(i\right)}⟩$. Let $\mathbf{b}\in A$ such that ${\mu }_{\mathbf{b}}\ne 0$, and we assume that ${\gamma }_{(\mathbf{b},i)}={\sum }_{j=1}^{s_i}{\alpha }_j{\lambda }_j^{\left(i\right)}$, ${\alpha }_j\in \mathbb{N}$. Then, we can write ${\lambda }_{\ell }^{\left(i\right)}{\mathbf{g}}_i={\sum }_{\mathbf{a}\in A,\mathbf{a}\ne \mathbf{b}}{\mu }_{\mathbf{a}}\mathbf{a}+{\mu }_{\mathbf{b}}\left({\sum }_{j=1,j\ne \ell }^{s_i}{\alpha }_j{\lambda }_j^{\left(i\right)}{\mathbf{g}}_i\right)+{\mu }_{\mathbf{b}}{\alpha }_{\ell }{\lambda }_{\ell }^{\left(i\right)}{\mathbf{g}}_i$. Since ${\mu }_{\mathbf{b}}>0$ and ${\sum }_{\mathbf{a}\in A}{\mu }_{\mathbf{a}}>1$, the only possibility is ${\alpha }_{\ell }=0$. In particular, we can argue that, for all $\mathbf{a}\in A$, with ${\mu }_{\mathbf{a}}\ne 0$, ${\gamma }_{(\mathbf{a},i)}\in ⟨\{{\lambda }_1^{\left(i\right)},{\lambda }_2^{\left(i\right)},\dots ,{\lambda }_{s_i}^{\left(i\right)}\}\setminus \left\{{\lambda }_{\ell }^{\left(i\right)}\right\}⟩$. As a consequence, ${\lambda }_{\ell }^{\left(i\right)}{\mathbf{g}}_i\in ⟨\{{\gamma }_{(\mathbf{a},i)}{\mathbf{g}}_i\mid \mathbf{a}\in A,{\mu }_{\mathbf{a}}\ne 0\}⟩\subseteq ⟨\{{\lambda }_1^{\left(i\right)}{\mathbf{g}}_i,{\lambda }_2^{\left(i\right)},\dots ,{\lambda }_{s_i}^{\left(i\right)}{\mathbf{g}}_i\}\setminus \left\{{\lambda }_{\ell }^{\left(i\right)}{\mathbf{g}}_i\right\}⟩$. Hence, ${\lambda }_{\ell }^{\left(i\right)}\in ⟨\{{\lambda }_1^{\left(i\right)}{\lambda }_2^{\left(i\right)},\dots ,{\lambda }_{s_i}^{\left(i\right)}\}\setminus \left\{{\lambda }_{\ell }^{\left(i\right)}\right\}⟩$, but this contradicts the fact that $S_i$ is minimally generated by $\{{\lambda }_1^{\left(i\right)}{\mathbf{g}}_i,{\lambda }_2^{\left(i\right)}{\mathbf{g}}_i,\dots ,{\lambda }_{s_i}^{\left(i\right)}{\mathbf{g}}_i\}$. So, we can conclude that ${\lambda }_{\ell }^{\left(i\right)}{\mathbf{g}}_i\in A$.    □

Condition 2. 

Firstly, we observe that, in the outlined framework, for the second condition of Theorem 2, we can point out that, if ${\mathbf{g}}_i\in S$ for some $i\in \{1,\dots ,n\}$, for what concerns the elements of the form ${\mathbf{g}}_i+n_i^{\left(j\right)}{\mathbf{g}}_j$, we can consider $n_i^{\left(j\right)}=0$ for all $j\in \{1,\dots ,n\}\setminus \left\{i\right\}$. So, we assume that ${\mathbf{g}}_i\notin S$. For $j\in \{1,\dots ,n\}\setminus \left\{i\right\}$, we consider that

$$\{k\in \mathbb{N}\mid {\mathbf{g}}_i+k{\mathbf{g}}_j\in S\}=\left\{k\in \mathbb{N}\mid {\mathbf{g}}_i=\sum _{j=1}^t{\lambda }_j{\mathbf{n}}_j+k(-{\mathbf{g}}_j),\mathrm{for}\mathrm{some}{\lambda }_1,\dots ,{\lambda }_t\in \mathbb{N}\right\}.$$

So, in this case, we need to find all non-negative integer factorizations of ${\mathbf{g}}_i$ in the monoid $⟨{\mathbf{n}}_1,\dots ,{\mathbf{n}}_t,-{\mathbf{g}}_j⟩\subseteq {\mathbb{Z}}^{t+1}$ and take, for each factorization, the coefficient of $-{\mathbf{g}}_j$. In particular, this problem is related to finding the non-negative integer solutions of a non-homogeneous Diophantine linear system of equations, that is, using the notation introduced in Condition (1), we have

$$\{k\in \mathbb{N}\mid {\mathbf{g}}_i+k{\mathbf{g}}_j\in S\}=\{x_{t+1}\mid A^{\left(j\right)}\mathbf{x}={\mathbf{g}}_i\mathrm{with}\mathbf{x}=(x_1,\dots ,x_t,x_{t+1})\in {\mathbb{N}}^{t+1}\}.$$

We recall that, if $R_{ij}$ is the set of non-negative integer solutions of $A^{\left(j\right)}\mathbf{x}={\mathbf{g}}_i$ and $V_{ij}$ is the set of minimal elements of $R_{ij}$, with respect to the natural partial order in ${\mathbb{N}}^{t+1}$, then the set $V_{ij}$ is finite and $R_{ij}={\bigcup }_{\mathbf{y}\in V_{ij}}(\mathbf{y}+M_j)$, where $M_j$ is the set of non-negative integer solutions of the homogeneous Diophantine linear system $A^{\left(j\right)}\mathbf{x}=0$ (see for instance [20] (Theorem 5.2)). In particular, $\min \{k\in \mathbb{N}\mid {\mathbf{g}}_i+k{\mathbf{g}}_j\in S\}=\min \{x_{t+1}\mid (x_1,\dots ,x_t,x_{t+1})\in V_{ij}\}$. The following example shows how to perform such a computation with GAP, using numericalsgps and NormalizInterface.

Example 2. 

We consider the semigroups $\mathcal{C}$ and S as in Example 1. We focus on the element such as ${\mathbf{g}}_1+n_1^{\left(3\right)}{\mathbf{g}}_3$. In order to compute $\{k\in \mathbb{N}\mid {\mathbf{g}}_1+k{\mathbf{g}}_3\in S\}$, with ${\mathbf{g}}_1=(1,1)$ and ${\mathbf{g}}_3=(2,1)$, we need to find the minimal factorizations of $(1,1)$ with respect to the set $\left\{\right(1,2),(2,1),(2,2),(3,1),(3,5),(-2,-1\left)\right\}$. That is, we need to find the set $V_{13}$ introduced before.

gap> LoadPackage(“num”);;

gap> NumSgpsUseNormaliz();;

gap> A:=[[1,2],[2,1],[2,2],[3,1],[3,5],[-2,-1]];;

gap> n:=Length(A);;

gap> F:=FactorizationsVectorWRTList([1,1], A);

[ [ 0, 0, 0, 6, 1, 10 ], [ 0, 0, 1, 1, 0, 2 ], [ 1, 0, 0, 2, 0, 3 ] ]

gap> List(F,i->i[n]);

[ 10, 2, 3 ]

• The computations above show that $V_{13}=\{(0,0,0,6,1,10),(0,0,1,1,0,2),(1,0,0,2,0,3)\}$. The package manual of numericalagps explains that, if v is a list of non-negative integers and ls is a list of lists of non-negative integers, then the function FactorizationsVectorWRTList( v, ls ) returns the set of factorizations of v in terms of the elements of ls. Actually, when NormalizInterface is used, that function also works in the case where ls has vectors with negative coordinates. In fact, by the code of that function, using NormalizInterface, the function computes exactly the minimal elements (with respect to the natural partial order) of the set of non-negative integer solutions of the system ls*x=v, in the case that the system admits solutions (each list of integers is considered here as a column vector). So, in this case, $\min \{k\in \mathbb{N}\mid {\mathbf{g}}_1+k{\mathbf{g}}_3\in S\}=2$ and we can consider $n_1^{\left(3\right)}=2$, that is, ${\mathbf{g}}_1+2{\mathbf{g}}_3\in S$.

Now, we can describe a procedure to check if $\mathcal{C}\setminus S$ is finite and, if so, to compute its elements. By Lemma 1, a direct way is to focus on the monoid $f_{\mathcal{C}}^{-1}\left(S\right)$. In particular, we start by finding a set of generators of $f_{\mathcal{C}}^{-1}\left(S\right)$.

We assume that $\mathcal{C}=⟨{\mathbf{g}}_1,{\mathbf{g}}_2,\dots ,{\mathbf{g}}_n⟩$ and $S=⟨{\mathbf{n}}_1,{\mathbf{n}}_2,\dots ,{\mathbf{n}}_t⟩$. We observe that an element of the form ${\sum }_{i=1}^n{x}_i{\mathbf{e}}_i$ belongs to $f_{\mathcal{C}}^{-1}\left(S\right)$ if and only if there exist ${\lambda }_1,\dots ,{\lambda }_t\in \mathbb{N}$ such that ${\sum }_{i=1}^n{x}_i{\mathbf{g}}_i={\sum }_{j=1}^t{\lambda }_j{\mathbf{n}}_j$. We consider the matrix $A^{(\mathcal{C},S)}=[{\mathbf{g}}_1,{\mathbf{g}}_2,\dots ,{\mathbf{g}}_n,-{\mathbf{n}}_1,-{\mathbf{n}}_2,\dots ,-{\mathbf{n}}_t]$, obtained by identifying every integer vector with a column vector. Then, the elements of $f_{\mathcal{C}}^{-1}\left(S\right)$ can be obtained from the non-negative integer solutions of the homogeneous Diophantine linear system $A^{(\mathcal{C},S)}\mathbf{x}=\mathbf{0}$, that is,

$$f_{\mathcal{C}}^{-1}\left(S\right)=\{(x_1,\dots ,x_n)\in {\mathbb{N}}^d\mid A^{(\mathcal{C},S)}\mathbf{x}=\mathbf{0}\mathrm{with}\mathbf{x}=(x_1,\dots ,x_n,x_{n+1},\dots ,x_{n+t})\in {\mathbb{N}}^{n+t}\}.$$

Let $M_{(\mathcal{C},S)}\subseteq {\mathbb{N}}^{n+t}$ be the set of non-negative integer solutions of the homogeneous Diophantine linear system $A^{(\mathcal{C},S)}\mathbf{x}=0$. The set $M_{(\mathcal{C},S)}$ is an affine semigroup in ${\mathbb{N}}^{n+t}$ (see [15] (Section 1)). So, there exists a finite set $B_{(\mathcal{C},S)}\subseteq {\mathbb{N}}^{n+t}$, such that $M_{(\mathcal{C},S)}=⟨B_{(\mathcal{C},S)}⟩$. Hence, $f_{\mathcal{C}}^{-1}\left(S\right)=⟨\{(x_1,\dots ,x_n)\in {\mathbb{N}}^n\mid (x_1,\dots ,x_n,x_{n+1},\dots ,x_{n+t})\in B_{(\mathcal{C},S)}\}⟩$. These computations can be performed using the computer algebra software GAP with the packages numericalsgps and NormalizInterface.

Now, by Lemma 1, we need to check if ${\mathbb{N}}^n\setminus f_{\mathcal{C}}^{-1}\left(S\right)$ is finite and, if so, compute its elements. By the previous arguments, we obtained a finite set $B\subseteq {\mathbb{N}}^n$ such that $f_{\mathcal{C}}^{-1}\left(S\right)=⟨B⟩$. So, we can test if ${\mathbb{N}}^n\setminus f_{\mathcal{C}}^{-1}\left(S\right)$ is finite by Theorem 1. Once we check it is finite, in order to compute the set ${\mathbb{N}}^n\setminus f_{\mathcal{C}}^{-1}\left(S\right)$, we can consider the procedure described in [21] (it can be performed using GAP with the package numericalsgps). Finally, we obtain the set $\mathcal{C}\setminus S$ considering all elements $f_{\mathcal{C}}\left(\mathbf{h}\right)$, for every $\mathbf{h}\in {\mathbb{N}}^n\setminus f_{\mathcal{C}}^{-1}\left(S\right)$.

Algorithm 1. 

Let $\mathcal{C}=⟨{\mathbf{g}}_1,{\mathbf{g}}_2,\dots ,{\mathbf{g}}_n⟩\subseteq {\mathbb{N}}^d$ be an affine semigroup and S a submonoid of $\mathcal{C}$. We suppose that $S=⟨{\mathbf{n}}_1,{\mathbf{n}}_2,\dots ,{\mathbf{n}}_t⟩$. In order to compute $\mathcal{C}\setminus S$, we can consider the following steps:

1. 

Consider the matrix $A^{(\mathcal{C},S)}=[{\mathbf{g}}_1,{\mathbf{g}}_2,\dots ,{\mathbf{g}}_n,-{\mathbf{n}}_1,-{\mathbf{n}}_2,\dots ,-{\mathbf{n}}_t]$, where each element is identified as a column vector.

2. 

Compute a finite set $B_{(\mathcal{C},S)}\subseteq {\mathbb{N}}^{n+t}$, such that $⟨B_{(\mathcal{C},S)}⟩$ is the set of non-negative integer solutions of the homogeneous Diophantine linear system $A^{(\mathcal{C},S)}\mathbf{x}=0$.

3. 

Set $B=\{(x_1,\dots ,x_n)\in {\mathbb{N}}^n\mid (x_1,\dots ,x_n,x_{n+1},\dots ,x_{n+t})\in B_{(\mathcal{C},S)}\}$.

4. 

Check if the set B satisfies the conditions of Theorem 1, that is, check if $⟨B⟩$ is ${\mathbb{N}}^n$-cofinite.

5. 

If $⟨B⟩$ is not ${\mathbb{N}}^n$-cofinite, then S is not $\mathcal{C}$-cofinite.

6. 

If $⟨B⟩$ is ${\mathbb{N}}^n$-cofinite, compute $H={\mathbb{N}}^n\setminus ⟨B⟩$.

7. 

Compute $\mathcal{C}\setminus S=\{f_{\mathcal{C}}\left(\mathbf{h}\right)\mid \mathbf{h}\in H\}$.

Example 3. 

We consider the affine semigroups $\mathcal{C}=⟨(1,1),(1,2),(2,1),(3,1)⟩$ and $S=\mathcal{C}\setminus \left\{\right(1,1),(3,2),(2,3\left)\right\}=⟨(1,2),(2,1),(2,2),(3,1),(3,5)⟩$ (as in the previous examples). In the following, we show how it is possible to perform Algorithm 1 using the computer algebra software GAP, with the packages numericalsgps and NormalizInterface.

gap> LoadPackage(“num”);;

gap> NumSgpsUseNormaliz();;

gap> C:=[[1,1],[1,2],[2,1],[3,1]];

gap> n:=Length(C);

4

[ [ 1, 1 ], [ 1, 2 ], [ 2, 1 ], [ 3, 1 ] ]

gap> S:=[[1,2],[2,1],[2,2],[3,1],[3,5]];

[ [ 1, 2 ], [ 2, 1 ], [ 2, 2 ], [ 3, 1 ], [ 3, 5 ] ]

gap> A:=Concatenation(C,-S);

[ [ 1, 1 ], [ 1, 2 ], [ 2, 1 ], [ 3, 1 ], [ -1, -2 ], [ -2, -1 ], [ -2, -2 ],

  [ -3, -1 ], [ -3, -5 ] ]

gap> A:=TransposedMat(A);

[ [ 1, 1, 2, 3, -1, -2, -2, -3, -3 ], [ 1, 2, 1, 1, -2, -1, -2, -1, -5 ] ]

gap> gap> sol:=HilbertBasisOfSystemOfHomogeneousEquations(A,[]);

[ [ 0, 0, 0, 1, 0, 0, 0, 1, 0 ], [ 0, 0, 1, 0, 0, 1, 0, 0, 0 ],

  [ 0, 0, 4, 0, 0, 0, 1, 2, 0 ], [ 0, 0, 5, 0, 1, 0, 0, 3, 0 ],

  [ 0, 0, 12, 0, 0, 0, 0, 7, 1 ], [ 0, 1, 0, 0, 1, 0, 0, 0, 0 ],

  [ 0, 1, 0, 1, 0, 1, 1, 0, 0 ], [ 0, 1, 0, 3, 0, 5, 0, 0, 0 ],

  [ 0, 1, 3, 0, 0, 0, 2, 1, 0 ], [ 0, 1, 7, 0, 0, 0, 0, 4, 1 ],

  [ 0, 2, 2, 0, 0, 0, 0, 1, 1 ], [ 0, 2, 2, 0, 0, 0, 3, 0, 0 ],

  [ 0, 3, 0, 2, 0, 3, 0, 0, 1 ], [ 0, 3, 1, 0, 0, 0, 1, 0, 1 ],

  [ 0, 3, 1, 1, 0, 0, 4, 0, 0 ], [ 0, 4, 0, 1, 0, 0, 2, 0, 1 ],

  [ 0, 4, 0, 2, 0, 0, 5, 0, 0 ], [ 0, 5, 0, 1, 0, 1, 0, 0, 2 ],

  [ 0, 7, 1, 0, 0, 0, 0, 0, 3 ], [ 0, 8, 0, 1, 0, 0, 1, 0, 3 ],

  [ 0, 12, 0, 1, 0, 0, 0, 0, 5 ], [ 1, 0, 0, 1, 0, 2, 0, 0, 0 ],

  [ 1, 0, 2, 0, 0, 0, 1, 1, 0 ], [ 1, 0, 3, 0, 1, 0, 0, 2, 0 ],

  [ 1, 0, 10, 0, 0, 0, 0, 6, 1 ], [ 1, 1, 1, 0, 0, 0, 2, 0, 0 ],

  [ 1, 1, 5, 0, 0, 0, 0, 3, 1 ], [ 1, 2, 0, 0, 0, 0, 0, 0, 1 ],

  [ 1, 2, 0, 1, 0, 0, 3, 0, 0 ], [ 2, 0, 0, 0, 0, 0, 1, 0, 0 ],

  [ 2, 0, 1, 0, 1, 0, 0, 1, 0 ], [ 2, 0, 8, 0, 0, 0, 0, 5, 1 ],

  [ 2, 1, 3, 0, 0, 0, 0, 2, 1 ], [ 3, 0, 0, 0, 1, 1, 0, 0, 0 ],

  [ 3, 0, 6, 0, 0, 0, 0, 4, 1 ], [ 3, 1, 1, 0, 0, 0, 0, 1, 1 ],

  [ 4, 0, 4, 0, 0, 0, 0, 3, 1 ], [ 4, 1, 0, 0, 0, 1, 0, 0, 1 ],

  [ 5, 0, 0, 0, 2, 0, 0, 1, 0 ], [ 5, 0, 2, 0, 0, 0, 0, 2, 1 ],

  [ 6, 0, 0, 0, 0, 0, 0, 1, 1 ], [ 7, 0, 0, 0, 0, 2, 0, 0, 1 ] ]

gap> B:=List(sol,i->i{[1..n]});

[ [ 0, 0, 0, 1 ], [ 0, 0, 1, 0 ], [ 0, 0, 4, 0 ], [ 0, 0, 5, 0 ],

  [ 0, 0, 12, 0 ], [ 0, 1, 0, 0 ], [ 0, 1, 0, 1 ], [ 0, 1, 0, 3 ],

  [ 0, 1, 3, 0 ], [ 0, 1, 7, 0 ], [ 0, 2, 2, 0 ], [ 0, 2, 2, 0 ],

  [ 0, 3, 0, 2 ], [ 0, 3, 1, 0 ], [ 0, 3, 1, 1 ], [ 0, 4, 0, 1 ],

  [ 0, 4, 0, 2 ], [ 0, 5, 0, 1 ], [ 0, 7, 1, 0 ], [ 0, 8, 0, 1 ],

  [ 0, 12, 0, 1 ], [ 1, 0, 0, 1 ], [ 1, 0, 2, 0 ], [ 1, 0, 3, 0 ],

  [ 1, 0, 10, 0 ], [ 1, 1, 1, 0 ], [ 1, 1, 5, 0 ], [ 1, 2, 0, 0 ],

  [ 1, 2, 0, 1 ], [ 2, 0, 0, 0 ], [ 2, 0, 1, 0 ], [ 2, 0, 8, 0 ],

  [ 2, 1, 3, 0 ], [ 3, 0, 0, 0 ], [ 3, 0, 6, 0 ], [ 3, 1, 1, 0 ],

  [ 4, 0, 4, 0 ], [ 4, 1, 0, 0 ], [ 5, 0, 0, 0 ], [ 5, 0, 2, 0 ],

  [ 6, 0, 0, 0 ], [ 7, 0, 0, 0 ] ]

gap> T:=AffineSemigroup(B);

<Affine semigroup in 4 dimensional space, with 41 generators>

gap> MinimalGenerators(T);

[ [ 0, 0, 0, 1 ], [ 0, 0, 1, 0 ], [ 0, 1, 0, 0 ], [ 1, 0, 0, 1 ],

  [ 1, 0, 2, 0 ], [ 1, 1, 1, 0 ], [ 1, 2, 0, 0 ], [ 2, 0, 0, 0 ],

  [ 3, 0, 0, 0 ] ]

gap> H:=Gaps(T);

[ [ 1, 0, 0, 0 ], [ 1, 0, 1, 0 ], [ 1, 1, 0, 0 ] ]

gap> Set(List(H,i->i*C));

[ [ 1, 1 ], [ 2, 3 ], [ 3, 2 ] ]

•  Therefore, the previous computations show that $B_{(\mathcal{C},S)}$ = {(0,0,0,1), (0,0,1,0), (0,1,0,0), (1,0,0,1), (1,0,2,0), (1,1,1,0), (1,2,0,0), (2,0,0,0), (3,0,0,0)}, ${\mathbb{N}}^n\setminus f_{\mathcal{C}}^{-1}\left(S\right)=\{(1,0,0,0),(1,0,1,0),(1,1,0,0)\}$ and $\mathcal{C}\setminus S=\left\{\right(1,1),(2,3),(3,2\left)\right\}$.

3. Cofinite Ideals of an Affine Semigroup

Let $S\subseteq {\mathbb{N}}^d$ be an affine semigroup. A set I is an ideal of S if $I\subseteq S$ and $I+S\subseteq I$. Every ideal I can be expressed as $I=X+S$, where $X={Minimals}_{{\le }_S}\left(I\right)$ and ${\le }_S$ is the partial order in ${\mathbb{N}}^d$ defined by $\mathbf{x}{\le }_S\mathbf{y}$ if $\mathbf{y}-\mathbf{x}\in S$. In particular, the set X is called a set of generators of I. Furthermore, the set X is finite (see for instance [22] (Proposition 2.7.4)), that is, every ideal of an affine semigroup is finitely generated. We simply denote by ≤ the order ${\le }_{{\mathbb{N}}^n}$, that is, the natural partial order in ${\mathbb{N}}^n$, n any positive integer.

Theorem 2 can be used to characterize when $S\setminus I$ is finite, obtaining the following result.

Theorem 3. 

Let $S\subseteq {\mathbb{N}}^d$ be an affine semigroup generated by $\{{\mathbf{g}}_1,\dots ,{\mathbf{g}}_n\}$ and I be an ideal of S. Then, $S\setminus I$ is a finite set if and only if, for all $i\in \{1,\dots ,n\}$, there exists $k_i\in \mathbb{N}\setminus \left\{0\right\}$ such that $k_i{\mathbf{g}}_i\in I$.

Proof. 

We observe that $I\cup \left\{\mathbf{0}\right\}$ is a submonoid of S, so we can use Theorem 2.

Necessity. If $S\setminus I$ is finite, from condition $\left(1\right)$ of Theorem 2 we have that the set $\{\lambda \in \mathbb{N}\mid \lambda {\mathbf{g}}_i\in I\}$ is a numerical semigroup for all $i\in \{1,\dots ,n\}$; in particular, this set contains nonzero integers. So, for all $i\in \{1,\dots ,n\}$, there exists $k_i\in \mathbb{N}\setminus \left\{0\right\}$ such that $k_i{\mathbf{g}}_i\in I$.

Sufficiency. We suppose that, for all $i\in \{1,\dots ,n\}$, there exists $k_i\in \mathbb{N}\setminus \left\{0\right\}$ such that $k_i{\mathbf{g}}_i\in I$. It suffices to check that $I\cup \left\{\mathbf{0}\right\}$ satisfies both the conditions of Theorem 2. Since $k_i{\mathbf{g}}_i\in I$, we obtain $k_i{\mathbf{g}}_i+\lambda {\mathbf{g}}_i\in I$ for all $\lambda \in \mathbb{N}$; in particular, $\{\lambda \in \mathbb{N}\mid \lambda {\mathbf{g}}_i\in I\}\supseteq \mathbb{N}\setminus \{1,\dots ,k_i-1\}$, that is, the first condition is satisfied. The second condition holds trivially by the definition of ideal, since, for all $i,j\in \{1,\dots ,n\}$, with $i\ne j$, we have ${\mathbf{g}}_i+k_j{\mathbf{g}}_j\in I$.    □

Algorithm 2. 

Let $S\subseteq {\mathbb{N}}^d$ be an affine semigroup generated by $\{{\mathbf{g}}_1,\dots ,{\mathbf{g}}_n\}$ and I be an ideal of S, such that $S\setminus I$ is a finite set. Then, it is possible to compute the set $S\setminus I$ by the following two steps:

1. 

For all $i\in \{1,\dots ,n\}$, we compute $k_i=\min \{k\in \mathbb{N}\mid k{\mathbf{g}}_i\in I\}$. If, for some $i\in \{1,\dots ,n\}$, we have $\{k\in \mathbb{N}\mid k{\mathbf{g}}_i\in I\}=Ø$, then $S\setminus I$ is not finite.

2. 

Let $P=\{({\lambda }_1,\dots ,{\lambda }_n)\in {\mathbb{N}}^n\mid {\lambda }_i<k_{i}fo ralli\in \{1,\dots ,n\}\}$ (we observe that P is a finite set). Then,

$$S\setminus I=\left\{\sum _{i=1}^n{\lambda }_i{\mathbf{g}}_i\notin I\mid ({\lambda }_1,\dots ,{\lambda }_n)\in P\right\}.$$

Remark 1. 

We observe that, for step (1) of Algorithm 2, it would suffice to find $k_i\in \{k\in \mathbb{N}\mid k{\mathbf{g}}_i\in I\}$, not necessarily being the minimum. However, it is better to find $k_i$ as the minimum in order to have P with smallest possible cardinality.

Let $S\subseteq {\mathbb{N}}^d$ be an affine semigroup generated by $\{{\mathbf{g}}_1,\dots ,{\mathbf{g}}_n\}$ and I be an ideal of S and we assume $I=X+S$ with $X=\{{\mathbf{u}}_1,\dots ,{\mathbf{u}}_r\}\subset S$. For $i\in \{1\dots ,n\}$, in order to compute the integer $k_i=\min \{k\in \mathbb{N}\mid k{\mathbf{g}}_i\in I\}$, or to test if it exists, we consider that, for $k\in \mathbb{N}$, then $k{\mathbf{g}}_i\in I$ if and only if there exists $j\in \{1,\dots ,r\}$ such that $k{\mathbf{g}}_i=x_j+{\sum }_{l=1}^n{\lambda }_l{\mathbf{g}}_l$ with ${\lambda }_l\in \mathbb{N}$ for each $l\in \{1,\dots ,n\}$. Equivalently, $-{\mathbf{u}}_j={\sum }_{l=1,l\ne i}{\lambda }_l{\mathbf{g}}_l+k(-{\mathbf{g}}_i)$. So, in this case, we need to find all non-negative integer factorizations of $-{\mathbf{u}}_j$ in the monoid $⟨\{{\mathbf{g}}_1,\dots ,{\mathbf{g}}_n\}\setminus \left\{{\mathbf{g}}_i\right\}\cup \{-{\mathbf{g}}_i\}⟩\subseteq {\mathbb{Z}}^n$ and take, for each factorization, the coefficient of $-{\mathbf{g}}_i$. This computation can be performed by GAP as in Example 2. Moreover, the package numericalsgps also contains many routines to deal with ideals of an affine semigroup. For instance, it is possible to test if an integer vector belongs to an ideal or not.

To test if $S\setminus I$ is finite and, if so, to compute it, we can also consider the map $f_S:{\mathbb{N}}^n⟶S$ introduced in Section 2, as explained in the next result.

Proposition 3. 

Let $S=⟨{\mathbf{g}}_1,\dots ,{\mathbf{g}}_n⟩\subseteq {\mathbb{N}}^d$ be an affine semigroup and I an ideal of S. Then, the set $f_S^{-1}\left(I\right)$ is an ideal of ${\mathbb{N}}^n$ and the following holds:

1. 

$S\setminus I$ is finite if and only if ${\mathbb{N}}^n\setminus f_S^{-1}\left(I\right)$ is finite.

2. 

$S\setminus I=\{f_S\left(\mathbf{x}\right)\mid \mathbf{x}\in {\mathbb{N}}^n\setminus f_S^{-1}\left(I\right)\}$.

Proof. 

It is not difficult to see that $f_S^{-1}\left(I\right)$ is an ideal of ${\mathbb{N}}^n$. Moreover, since $f_S$ is a surjective function, we have ${\mathbb{N}}^n\setminus f_S^{-1}\left(I\right)=f_S^{-1}\left(S\right)\setminus f_S^{-1}\left(I\right)=f_S^{-1}(S\setminus I)$. Therefore, claims (1) and (2) can be proved using the same arguments of Lemma 1.    □

We denote $M\left(I\right)={Minimals}_{\le }\left(f_S^{-1}\left(I\right)\right)$. Then, $f_S^{-1}\left(I\right)=M\left(I\right)+{\mathbb{N}}^n$ and $M\left(I\right)$ is a finite set. In particular, ${\mathbb{N}}^n\setminus f_S^{-1}\left(I\right)=\{\mathbf{x}\in {\mathbb{N}}^n\mid \mathbf{y}\nleqq \mathbf{x},\mathrm{for}\mathrm{all}\mathbf{y}\in M\left(I\right)\}$. So, in order to compute the set $S\setminus I$, it suffices to find the set $M\left(I\right)$ and use equality (2) of Proposition 3. In [23] (Algorithm, 16), the authors show a procedure to compute the set $M\left(I\right)={Minimals}_{\le }\left(f_S^{-1}\left(I\right)\right)$. We provide a different strategy to compute it.

Let $S=⟨{\mathbf{g}}_1,\dots ,{\mathbf{g}}_n⟩\subseteq {\mathbb{N}}^d$ be an affine semigroup and $I=X+S$ an ideal of S, with $X=\{{\mathbf{u}}_1,\dots ,{\mathbf{u}}_r\}$. We observe that, ${\sum }_{i=1}^n{a}_i{\mathbf{e}}_i\in f_S^{-1}\left(I\right)$ if and only if there exists $k\in \{1,\dots ,r\}$ and ${\lambda }_1,\dots ,{\lambda }_n\in \mathbb{N}$ such that ${\sum }_{i=1}^n{a}_i{\mathbf{g}}_i={\mathbf{u}}_k+{\sum }_{i=1}^n{\lambda }_i{\mathbf{g}}_i$. Hence, we consider the matrix $A^{\left(S\right)}=[{\mathbf{g}}_1,\dots ,{\mathbf{g}}_n,-{\mathbf{g}}_1,\dots ,-{\mathbf{g}}_n]$. For $j\in \{1,\dots ,r\}$, let $M_{(S,j)}$ be the set of non-negative integer solutions of the non-homogeneous Diophantine linear system $A^{\left(S\right)}\mathbf{x}={\mathbf{u}}_j$. Then, we have

$$f_S^{-1}\left(I\right)=\bigcup _{j=1}^r\left\{(x_1,\dots ,x_n)\in {\mathbb{N}}^n\mid (x_1,\dots ,x_n,x_{n+1},\dots ,x_{2n})\in M_{(S,j)}\right\}.$$

Let $M_{\left(S\right)}^{\prime }$ be the set of non-negative integer solutions of the homogeneous Diophantine linear system $A^{\left(S\right)}\mathbf{x}=\mathbf{0}$ and $V_{(S,j)}={Minimals}_{\le }(M_{(S,j)}$) (≤ is the natural partial order in ${\mathbb{N}}^{2n}$). In particular, we have $M_{(S,j)}={\bigcup }_{\mathbf{y}\in V_{(S,j)}}(\mathbf{y}+M_{\left(S\right)}^{\prime })$ (see [20] (Theorem 5.2)). Let us denote $V_{\left(I\right)}={\bigcup }_{j=1}^r{V}_{(S,j)}$. As a consequence, by the previous expression of $f_S^{-1}\left(I\right)$, we obtain

$$M\left(I\right)={Minimals}_{\le }\left(\left\{(x_1,\dots ,x_n)\in {\mathbb{N}}^n\mid (x_1,\dots ,x_n,x_{n+1},\dots ,x_{2n})\in V_{\left(I\right)}\right\}\right).$$

For all $j\in \{1,\dots ,r\}$, the set $V_{(S,j)}$ can be computed in GAP, using the packages numericalsgps and NormalizInterface, as in Example 2. Once the set ${Minimals}_{\le }\left(f_S^{-1}\left(I\right)\right)$ is obtained, the following algorithm allows to check if $S\setminus I$ is finite and, if so, to compute its elements.

Algorithm 3. 

Let $S=⟨{\mathbf{g}}_1,{\mathbf{g}}_2,\dots ,{\mathbf{g}}_n⟩\subseteq {\mathbb{N}}^d$ be an affine semigroup and $I=X+S$ an ideal of S, $X=\{{\mathbf{u}}_1,\dots ,{\mathbf{u}}_r\}$. To test if $S\setminus I$ is finite and, if so, compute it; we can consider the following steps.

1. 

Consider the matrix $A^{\left(S\right)}=[{\mathbf{g}}_1,{\mathbf{g}}_2,\dots ,{\mathbf{g}}_n,-{\mathbf{g}}_1,-{\mathbf{g}}_2,\dots ,-{\mathbf{g}}_n]$, where each element is identified as a column vector.

2. 

For all $j\in \{1,\dots ,r\}$, compute the (finite) set $V_{(S,j)}\subseteq {\mathbb{N}}^{2n}$ of minimal (with respect to the natural partial order in ${\mathbb{N}}^{2n}$) non-negative integer solutions of the non-homogeneous Diophantine linear system $A^{\left(S\right)}\mathbf{x}={\mathbf{u}}_j$.

3. 

Set $V_{\left(I\right)}={\bigcup }_{j=1}^r{V}_{(S,j)}$.

4. 

Set $M\left(I\right)={Minimals}_{\le }\left(\left\{(x_1,\dots ,x_n)\in {\mathbb{N}}^n\mid (x_1,\dots ,x_n,x_{n+1},\dots ,x_{2n})\in V_{\left(I\right)}\right\}\right)$.

5. 

For all $i\in \{1,\dots ,n\}$, check if there exists $k_i\in \mathbb{N}$ such that $k_i{\mathbf{e}}_i\in M\left(I\right)$. If, for some $i\in \{1,\dots ,n\}$, this condition does not hold, then $S\setminus I$ is not finite.

6. 

If the previous condition holds, then compute $Q=\{\mathbf{x}\in {\mathbb{N}}^n\mid \mathbf{y}\nleqq \mathbf{x},\mathit{for}\mathit{all}\mathbf{y}\in M\left(I\right)\}$.

7. 

Compute $S\setminus I=\{f_S\left(\mathbf{x}\right)\mid \mathbf{x}\in Q\}$.

Considering the computation time, the main difference between Algorithms 2 and 3 concerns the computation of the set $M\left(I\right)$, against the time spent to test, for each element $\mathbf{x}=(x_1,\dots ,x_n)\in P$, if ${\sum }_{i=1}^n{x}_i{\mathbf{g}}_i\in I$.

3.1. An Approach Using Commutative Algebra

We assume that $S=⟨{\mathbf{g}}_1,\dots ,{\mathbf{g}}_n⟩\subseteq {\mathbb{N}}^d$ and let K be a field. We consider the semigroup ring $K\left[S\right]=K[{\mathbf{Y}}^{\mathbf{s}}\mid \mathbf{s}\in S]=K[{\mathbf{Y}}^{{\mathbf{g}}_1},\dots ,{\mathbf{Y}}^{{\mathbf{g}}_n}]$, where, if $\mathbf{s}=(s_1,\dots ,s_d)\in {\mathbb{N}}^d$, then ${\mathbf{Y}}^{\mathbf{s}}=Y_1^{s_1}{Y}_2^{s_2}\cdots Y_d^{s_d}$. If $I=X+S$, $X=\{{\mathbf{u}}_1,\dots ,{\mathbf{u}}_r\}\subset S$, we define $I_{K\left[S\right]}=({\mathbf{Y}}^{{\mathbf{u}}_1},\dots ,{\mathbf{Y}}^{{\mathbf{u}}_r})$ that is a monomial ideal of $K\left[S\right]$.

Let $S\subseteq {\mathbb{N}}^d$ be an affine semigroup and I be an ideal of S. Then, $\mathbf{h}\in S\setminus I$ if and only if ${\mathbf{Y}}^{\mathbf{h}}\notin I_{K\left[S\right]}$, that is, ${\mathbf{Y}}^{\mathbf{h}}$ is a monomial not belonging to $I_{K\left[S\right]}$. In particular, $S\setminus I$ is a finite set if and only if the set $\{{\mathbf{Y}}^{\mathbf{h}}\in K\left[S\right]\mid {\mathbf{Y}}^{\mathbf{h}}\notin I_{K\left[S\right]}\}$ is finite.

Let ${\mathbf{u}}_i={\sum }_{j=1}^n{a}_{ij}{\mathbf{g}}_j$ be a factorization of ${\mathbf{u}}_i$ and we denote ${\mathbf{a}}_i=(a_{i1},\dots ,a_{in})\in {\mathbb{N}}^n$, for $i\in \{1,\dots ,r\}$. We consider the polynomial ring $K[Z_1,\dots ,Z_n]$ and, as above, if $\mathbf{t}=(t_1,\dots ,t_n)\in {\mathbb{N}}^n$, we denote ${\mathbf{Z}}^{\mathbf{t}}=Z_1^{t_1}{Z}_2^{t_2}\cdots Z_n^{t_n}$. We consider the following surjective ring homomorphism:

$$\psi :K[Z_1,\dots ,Z_n]⟶K\left[S\right]\mathrm{defined}\mathrm{by}{Z}_i⟼{\mathbf{Y}}^{{\mathbf{g}}_i}.$$

We denote $J_S=ker\left(\psi \right)$ (called the defining ideal of S), and observe that $\psi \left({\mathbf{Z}}^{{\mathbf{a}}_i}\right)={\mathbf{Y}}^{{\mathbf{u}}_i}$ for each $i\in \{1,\dots ,r\}$. The map $\psi$ induces the following ring isomorphism:

$$\tilde{\psi }:{\displaystyle \frac{K[Z_1,\dots ,Z_n]}{J_S}}⟶K\left[S\right]\mathrm{defined}\mathrm{by}\tilde{\psi }(f+J_S)⟼\psi \left(f\right).$$

We observe that the set ${\tilde{\psi }}^{-1}\left(I_{K\left[S\right]}\right)$ is an ideal of ${\displaystyle \frac{K[Z_1,\dots ,Z_n]}{J_S}}$. Moreover, we have the following set equality:

$${\tilde{\psi }}^{-1}\left(I_{K\left[S\right]}\right)={\displaystyle \frac{J_S+({\mathbf{Z}}^{{\mathbf{a}}_1},\dots ,{\mathbf{Z}}^{{\mathbf{a}}_r})}{J_S}}.$$

In fact, if $\tilde{f}=f+J_S\in {\tilde{\psi }}^{-1}\left(I_{K\left[S\right]}\right)$, then $\tilde{\psi }\left(\tilde{f}\right)\in I_{K\left[S\right]}$. In particular, there exist $h_1,\dots ,h_r\in K\left[S\right]$ such that $\tilde{\psi }\left(\tilde{f}\right)={\sum }_{k=1}^r{h}_k{\mathbf{Y}}^{{\mathbf{u}}_k}=\tilde{\psi }({\sum }_{k=1}^n{\overline{h}}_k{\mathbf{Z}}^{{\mathbf{a}}_k}+J_S)$ with ${\overline{h}}_k+J_S\in {\tilde{\psi }}^{-1}\left(h_k\right)$ for all $k\in \{1,\dots ,r\}$. We denote $\overline{h}={\sum }_{k=1}^n{\overline{h}}_k{\mathbf{Z}}^{{\mathbf{a}}_k}$; in particular, $\overline{h}\in ({\mathbf{Z}}^{{\mathbf{a}}_1},\dots ,{\mathbf{Z}}^{{\mathbf{a}}_r})$. Since $\tilde{\psi }$ is an isomorphism, we have $\tilde{f}=f+J_S=\overline{h}+J_S$, so $f-\overline{h}\in J_S$ and, in particular, $f\in J_S+({\mathbf{Z}}^{{\mathbf{a}}_1},\dots ,{\mathbf{Z}}^{{\mathbf{a}}_r})$. This means that $\tilde{f}=f+J_S\in {\displaystyle \frac{J_S+({\mathbf{Z}}^{{\mathbf{a}}_1},\dots ,{\mathbf{Z}}^{{\mathbf{a}}_r})}{J_S}}$.

Conversely, if $f+J_S\in {\displaystyle \frac{J_S+({\mathbf{Z}}^{{\mathbf{a}}_1},\dots ,{\mathbf{Z}}^{{\mathbf{a}}_r})}{J_S}}$, then $f=g+h$ where $g\in J_S$ and $h={\sum }_{k=1}^n{h}_k{\mathbf{Z}}^{{\mathbf{a}}_k}$, $h_k\in K[Z_1,\dots ,Z_n]$ for each $k\in \{1,\dots ,r\}$. Therefore, $\tilde{\psi }(f+J_S)=\psi \left(f\right)=\psi \left(g\right)+\psi \left(h\right)=\psi \left(h\right)=\psi \left({\sum }_{k=1}^n{h}_k{\mathbf{Z}}^{{\mathbf{a}}_k}\right)={\sum }_{k=1}^n\psi \left(h_k\right){\mathbf{Y}}^{{\mathbf{u}}_k}\in I_{K\left[S\right]}$, that is, $f+J_S\in {\tilde{\psi }}^{-1}\left(I_{K\left[S\right]}\right)$.

As a consequence of the previous set equality, we have the following isomorphism:

$${\displaystyle \frac{K\left[S\right]}{I_{K\left[S\right]}}}\cong \left({\displaystyle \frac{K[Z_1,\dots ,Z_n]}{J_S}}\right)∕\left({\displaystyle \frac{J_S+({\mathbf{Z}}^{{\mathbf{a}}_1},\dots ,{\mathbf{Z}}^{{\mathbf{a}}_r})}{J_S}}\right)\cong {\displaystyle \frac{K[Z_1,\dots ,Z_n]}{J_S+({\mathbf{Z}}^{{\mathbf{a}}_1},\dots ,{\mathbf{Z}}^{{\mathbf{a}}_r})}}.$$

The isomorphism above is described by the following map:

$$\overline{\psi }:{\displaystyle \frac{K[Z_1,\dots ,Z_n]}{J_S+({\mathbf{Z}}^{{\mathbf{a}}_1},\dots ,{\mathbf{Z}}^{{\mathbf{a}}_r})}}⟶{\displaystyle \frac{K\left[S\right]}{I_{K\left[S\right]}}},f+(J_S+({\mathbf{Z}}^{{\mathbf{a}}_1},\dots ,{\mathbf{Z}}^{{\mathbf{a}}_r}))\mapsto \psi \left(f\right)+I_{K\left[S\right]}$$

(1)

In the following, if J is an ideal of a polynomial ring R and ⪯ is a monomial order on R, we denote the initial ideal of J with respect to ⪯ by ${in}_{⪯}\left(J\right)$.

Lemma 2. 

In the framework introduced above, let $P_S=J_S+({\mathbf{Z}}^{{\mathbf{a}}_1},\dots ,{\mathbf{Z}}^{{\mathbf{a}}_r})$ and ⪯ be a monomial order on $K[Z_1,\dots ,Z_n]$. Then, $\{{\mathbf{Y}}^{\mathbf{h}}\in K\left[S\right]\mid {\mathbf{Y}}^{\mathbf{h}}\notin I_{K\left[S\right]}\}=\{\psi \left({\mathbf{Z}}^{\mathbf{t}}\right)\mid {\mathbf{Z}}^{\mathbf{t}}\notin {in}_{⪯}\left(P_S\right)\}$.

Proof. 

Let $\overline{\psi }$ be the isomorphism above. In particular, if ${\mathbf{Z}}^{\mathbf{t}}$ is a monomial in $K[Z_1,\dots ,Z_n]$, then $\overline{\psi }({\mathbf{Z}}^{\mathbf{t}}+P_S)=\psi \left({\mathbf{Z}}^{\mathbf{t}}\right)+I_{K\left[S\right]}$. If ${\mathbf{Z}}^{\mathbf{t}}\notin {in}_{⪯}\left(P_S\right)$, then, trivially, ${\mathbf{Z}}^{\mathbf{t}}\notin P_S$. Since $\overline{\psi }$ is injective, we obtain $\psi \left({\mathbf{Z}}^{\mathbf{t}}\right)+I_{K\left[S\right]}=\overline{\psi }({\mathbf{Z}}^{\mathbf{t}}+P_S)\ne \mathbf{0}$, that is, $\psi \left({\mathbf{Z}}^{\mathbf{t}}\right)\notin I_{K\left[S\right]}$. Conversely, let ${\mathbf{Y}}^{\mathbf{h}}\in K\left[S\right]$ such that ${\mathbf{Y}}^{\mathbf{h}}\notin I_{K\left[S\right]}$. This means that ${\mathbf{Y}}^{\mathbf{h}}+I_{K\left[S\right]}\ne \mathbf{0}$ in $K\left[S\right]/I_{K\left[S\right]}$. Since $\mathbf{h}\in S$, there exists $\mathbf{t}={\sum }_{i=1}^n{t}_i{\mathbf{e}}_i\in {\mathbb{N}}^n$ such that $\mathbf{h}={\sum }_{i=1}^n{t}_i{\mathbf{g}}_i$. Hence, for the monomial ${\mathbf{Z}}^{\mathbf{t}}\in K[Z_1,\dots ,Z_n]$, we have $\psi \left({\mathbf{Z}}^{\mathbf{t}}\right)={\mathbf{Y}}^{\mathbf{h}}$. We suppose that ${\mathbf{Z}}^{\mathbf{t}}\in {in}_{⪯}\left(P_S\right)$. Then, there exists $f\in K[Z_1,\dots ,Z_n]$ such that ${\mathbf{Z}}^{\mathbf{t}}+f\in P_S$. So, ${\mathbf{Z}}^{\mathbf{t}}+f=g+{\sum }_{k=1}^r{h}_k{\mathbf{Z}}^{{\mathbf{a}}_k}$, $g\in J_S$ and $h_k\in K[Z_1,\dots ,Z_n]$. Therefore, $\psi \left({\mathbf{Z}}^{\mathbf{t}}\right)+\psi \left(f\right)=\psi \left(g\right)+{\sum }_{k=1}^r\psi \left(h_k\right)\psi \left({\mathbf{Z}}^{{\mathbf{a}}_k}\right)={\sum }_{k=1}^r\psi \left(h_k\right){\mathbf{Y}}^{{\mathbf{u}}_k}$. In particular, $\psi \left({\mathbf{Z}}^{\mathbf{t}}\right)+\psi \left(f\right)\in I_{K\left[S\right]}$. Since $I_{K\left[S\right]}$ is a monomial ideal and $\psi \left({\mathbf{Z}}^{\mathbf{t}}\right)={\mathbf{Y}}^{\mathbf{h}}$ is a monomial, we obtain ${\mathbf{Y}}^{\mathbf{h}}\in I_{K\left[S\right]}$, a contradiction. So, we have ${\mathbf{Z}}^{\mathbf{t}}\notin {in}_{⪯}\left(P_S\right)$.    □

We consider the set $\{{\mathbf{Z}}^{\mathbf{t}}\in K[Z_1,\dots ,Z_n]\mid {\mathbf{Z}}^{\mathbf{t}}\notin {in}_{⪯}\left(P_S\right)\}$ and suppose that it is finite for some monomial order on $K[Z_1,\dots ,Z_n]$. This property is known as $P_S=J_S+({\mathbf{Z}}^{{\mathbf{a}}_1},\dots ,{\mathbf{Z}}^{{\mathbf{a}}_r})$ is a zero dimensional ideal of $K[Z_1,\dots ,Z_n]$. A zero dimensional ideal is characterized by the following known result (Theorem 6, Chapter 5, §3, [14]).

Theorem 4 

([14]). Let K be a field and $I\subseteq K[X_1,\dots ,X_n]$ be an ideal of a polynomial ring. We fix a monomial order ⪯ in $K[X_1,\dots ,X_n]$. Then, the following are equivalent:

(i) 

For each $i\in \{1,\dots ,n\}$, there is some $m_i\ge 0$ such that $X^{m_i}\in {in}_{⪯}\left(I\right)$.

(ii) 

Let G be a Gröbner basis for I. Then, for each $i\in \{1,\dots ,n\}$, there is some $m_i\ge 0$ such that $X^{m_i}={in}_{⪯}\left(g\right)$ for some $g\in G$.

(iii) 

The set $\{X^{\alpha }\mid X^{\alpha }\notin {in}_{⪯}\left(I\right)\}$ is finite.

(iv) 

The K-vector space $K[X_1,\dots ,X_n]/I$ is finite-dimensional.

Theorem 4 suggests another way to prove the characterization of cofinitness of an ideal I in a monoid S, given in Theorem 3, and also a different procedure to compute $S\setminus I$.

Alternative Proof of Theorem 3. 

In the following, we denote $P_S=J_S+({\mathbf{Z}}^{{\mathbf{a}}_1},\dots ,{\mathbf{Z}}^{{\mathbf{a}}_r})$, with reference to the framework introduced in this section.

Necessity. Suppose that $S\setminus I$ is finite. Then, the set $\{{\mathbf{Y}}^{\mathbf{h}}\in K\left[S\right]\mid {\mathbf{Y}}^{\mathbf{h}}\notin I_{K\left[S\right]}\}$ is finite. So, by Lemma 2, considering the ideal $P_S$ and ⪯ a monomial order on $K[Z_1,\dots ,Z_n]$, we have that $\{\psi \left({\mathbf{Z}}^{\mathbf{t}}\right)\mid {\mathbf{Z}}^{\mathbf{t}}\notin {in}_{⪯}\left(P_S\right)\}$ is a finite set. We show that the set $\{{\mathbf{Z}}^{\mathbf{t}}\in K[Z_1,\dots ,Z_n]\mid {\mathbf{Z}}^{\mathbf{t}}\notin {in}_{⪯}\left(P_S\right)\}$ is finite. If we suppose it is not finite, since $\{\psi \left({\mathbf{Z}}^{\mathbf{t}}\right)\mid {\mathbf{Z}}^{\mathbf{t}}\notin {in}_{⪯}\left(P_S\right)\}$ is finite, there exist ${\mathbf{Z}}^{{\mathbf{t}}_1},{\mathbf{Z}}^{{\mathbf{t}}_2}\notin {in}_{⪯}\left(P_S\right)\}$, ${\mathbf{Z}}^{{\mathbf{t}}_1}\ne {\mathbf{Z}}^{{\mathbf{t}}_2}$, such that $\psi \left({\mathbf{Z}}^{{\mathbf{t}}_1}\right)=\psi \left({\mathbf{Z}}^{{\mathbf{t}}_2}\right)$. Hence, ${\mathbf{Z}}^{{\mathbf{t}}_1}-{\mathbf{Z}}^{{\mathbf{t}}_2}\in J_S\subseteq P_S$ and this implies ${\mathbf{Z}}^{{\mathbf{t}}_1}\in {in}_{⪯}\left(P_S\right)$ or ${\mathbf{Z}}^{{\mathbf{t}}_2}\in {in}_{⪯}\left(P_S\right)$, a contradiction. Therefore, the set $\{{\mathbf{Z}}^{\mathbf{t}}\in K[Z_1,\dots ,Z_n]\mid {\mathbf{Z}}^{\mathbf{t}}\notin {in}_{⪯}\left(P_S\right)\}$ is finite and by Theorem 4 we obtain that for all $i\in \{1,\dots ,n\}$ there exists an integer $k_i\ge 0$ such that $Z_i^{k_i}\in {in}_{⪯}\left(P_S\right)$. Hence, there exists $f_i\in K[Z_1,\dots ,Z_n]$ such that $Z_i^{k_i}+f_i\in P_S$. So, having in mind the isomorphism in (1), we obtain $\psi (Z_i^{k_i}+f_i)={\mathbf{Y}}^{k_i{\mathbf{g}}_i}+\psi \left(f_i\right)\in I_{K\left[S\right]}$. Since $I_{K\left[S\right]}$ is a monomial ideal and ${\mathbf{Y}}^{k_i{\mathbf{g}}_i}$ is a monomial, we obtain ${\mathbf{Y}}^{k_i{\mathbf{g}}_i}\in I_{K\left[S\right]}$, that is, $k_i{\mathbf{g}}_i\in I$. As a consequence, for all $i\in \{1,\dots ,n\}$, we have $k_i{\mathbf{g}}_i\in I$.

Sufficiency. For every $i\in \{1,\dots ,n\}$, we suppose that there exists $k_i\in \mathbb{N}\setminus \left\{0\right\}$ such that $k_i{\mathbf{g}}_i\in I$. Then, ${\mathbf{Y}}^{k_i{\mathbf{g}}_i}\in I_{K\left[S\right]}$. In particular, by the isomorphism in (1), we have $Z_i^{k_i}\in P_S$. By Theorem 4, given a monomial order ⪯ on $K[Z_1,\dots ,Z_n]$, we obtain that $\{{\mathbf{Z}}^{\mathbf{t}}\in K[Z_1,\dots ,Z_n]\mid {\mathbf{Z}}^{\mathbf{t}}\notin {in}_{⪯}\left(P_S\right)\}$ is a finite a set. As a consequence, the set $\{\psi \left({\mathbf{Z}}^{\mathbf{t}}\right)\mid {\mathbf{Z}}^{\mathbf{t}}\notin {in}_{⪯}\left(P_S\right)\}$ is finite and, by Lemma 2, the set $\{{\mathbf{Y}}^{\mathbf{h}}\in K\left[S\right]\mid {\mathbf{Y}}^{\mathbf{h}}\notin I_{K\left[S\right]}\}$ is finite. This means that $S\setminus I$ is finite.    □

Following the arguments developed in this section, we can reformulate Theorem 3 as follows.

Corollary 1. 

Let $S\subseteq {\mathbb{N}}^d$ be an affine semigroup, I an ideal of S. As before, let $P_S=J_S+({\mathbf{Z}}^{{\mathbf{a}}_1},\dots ,{\mathbf{Z}}^{{\mathbf{a}}_r})\subseteq K[Z_1,\dots ,Z_n]$. Then, $S\setminus I$ is finite if and only if $P_S$ is a zero dimensional ideal of $K[Z_1,\dots ,Z_n]$.

For a different procedure to compute $S\setminus I$, we recall that in the case when $I\subseteq K[X_1,\dots ,X_n]$ is an ideal of a polynomial ring and ⪯ a monomial order in $K[X_1,\dots ,X_n]$, then the set $\{X^{\alpha }\mid X^{\alpha }\notin {in}_{⪯}\left(I\right)\}$ is a basis of $K[X_1,\dots ,X_n]/I$ as a K-vector space. In particular, one can use a computer algebra software, for instance Macaulay2 [24] or Singular [25], to test if one of the equivalent conditions of Theorem 4 holds and, in such a case, to compute the set $\{X^{\alpha }\mid X^{\alpha }\notin {in}_{⪯}\left(I\right)\}$.

So, if $\mathcal{B}$ is a basis of the K-vector space $K[Z_1,\dots ,Z_n]/P_S$, $P_S=J_S+({\mathbf{Z}}^{{\mathbf{a}}_1},\dots ,{\mathbf{Z}}^{{\mathbf{a}}_r})$, then $S\setminus I=\{\mathbf{h}\in {\mathbb{N}}^d\mid {\mathbf{Y}}^{\mathbf{h}}=\psi \left({\mathbf{Z}}^{\mathbf{t}}\right),{\mathbf{Z}}^{\mathbf{t}}\in \mathcal{B}\}$.

Algorithm 4. 

Given $S=⟨{\mathbf{g}}_1,\dots ,{\mathbf{g}}_n⟩\subseteq {\mathbb{N}}^d$ and an ideal I of S, with $I=X+S$ and $X=\{{\mathbf{u}}_1,\dots ,{\mathbf{u}}_r\}\subset S$, in order to compute $S\setminus I$, we can consider the following steps:

1. 

For each $i\in \{1,\dots ,r\}$, compute a factorization ${\mathbf{a}}_i$ of ${\mathbf{u}}_i$ in S.

2. 

Set the polynomial rings $R_1=K[Z_1,\dots ,Z_n]$, $R_2=K[Y_1,\dots ,Y_d]$, with K a field, the map $\psi :R_1\to R_2$ defined by $Z_i\mapsto {\mathbf{Y}}^{{\mathbf{g}}_i}$ and compute the ideal $J_S=ker\left(\psi \right)$.

3. 

Set the ideal $P_S=J_S+({\mathbf{Z}}^{{\mathbf{a}}_1},\dots ,{\mathbf{Z}}^{{\mathbf{a}}_r})$ and compute a Gröbner basis G of $P_S$ with respect to a monomial order ⪯.

4. 

If G does not satisfy condition (ii) of Theorem 4, then $S\setminus I$ is not finite and we can stop. Otherwise, compute a basis $\mathcal{B}$ of the K-vector space $K[Z_1,\dots ,Z_n]/P_S$.

5. 

Compute $S\setminus I=\{\mathbf{h}\in {\mathbb{N}}^d\mid {\mathbf{Y}}^{\mathbf{h}}=\psi \left({\mathbf{Z}}^{\mathbf{t}}\right),{\mathbf{Z}}^{\mathbf{t}}\in \mathcal{B}\}$.

We point out that a similarity between Algorithm 3 and Algorithm 4 is actually hidden. That is, the exponent vectors of elements in the basis $\mathcal{B}$ of the K-vector space $K[Z_1,\dots ,Z_n]/P_S$ correspond to the vectors in ${\mathbb{N}}^n\setminus f_S^{-1}\left(I\right)$. In particular, these elements are obtained from a presentation of S (see [23] for more details) in the first algorithm, and from the defining ideal$I_S$ of $K\left[S\right]$ in the second algorithm. Considering the computation time, the relevant difference concerns with the time spent to compute the set $M\left(I\right)$ against the computation of a Gröbner basis of the ideal $P_S$.

3.2. A Remark on Apéry Sets

Let $S\subseteq {\mathbb{N}}^d$ be an affine semigroup and $X\subseteq S$. The Apéry set of S with respect to X is defined as $Ap(S,X)=\{\mathbf{s}\in S\mid \mathbf{s}-\mathbf{x}\notin S\mathrm{for}\mathrm{all}\mathbf{x}\in X\}$. This set is an important tool in the context of affine semigroups. For instance, in the case when S is simplicial, it can be used to verify the Cohen–Macaulay and Gorenstein conditions for the associated semigroup ring (see [26]) and to compute the conductor (see [27]). We observe that $Ap(S,X)=S\setminus (X+S)$, so it is the complement in S of the ideal $X+S$. In particular, we can state the following:

Corollary 2. 

Let $S\subseteq {\mathbb{N}}^d$ be an affine semigroup minimally generated by the set $\{{\mathbf{g}}_1,\dots ,{\mathbf{g}}_n\}$. If $X\subset S$, then $Ap(S,X)$ is finite if and only if, for all $i\in \{1,\dots ,n\}$, there exists $k_i\in \mathbb{N}\setminus \left\{0\right\}$ such that $k_i{\mathbf{g}}_i\in X+S$.

As a consequence, if $S=⟨{\mathbf{g}}_1,{\mathbf{g}}_2,\dots ,{\mathbf{g}}_r,{\mathbf{g}}_{r+1},{\mathbf{g}}_{r+2},\dots ,{\mathbf{g}}_{r+m}⟩$, where $E=\{{\mathbf{g}}_1,{\mathbf{g}}_2,\dots ,{\mathbf{g}}_r\}$ is a set of extreme rays of S, then ${\mathbf{g}}_j={\sum }_{i=1}^r{q}_i{\mathbf{g}}_i$, $q_i\in {\mathbb{Q}}_{+}$, for all $j\in \{1,\dots ,m\}$. It easily follows that there exists $k_j\in \mathbb{N}$ such that $k_j{\mathbf{g}}_j\in ⟨{\mathbf{g}}_1,{\mathbf{g}}_2,\dots ,{\mathbf{g}}_r⟩\subset S$. Therefore, in the case E is a set of extreme rays of S, the set $Ap(S,E)$ is finite. Moreover, referring to the previous arguments in SubSection 3.1, we can consider the ideal $P_S=J_S+(Z_1,\dots ,Z_r)$ and, if $\mathcal{B}$ is a basis of the K-vector space $K[Z_1,\dots ,Z_n]/P_S$, then $Ap(S,E)=\{\mathbf{h}\in {\mathbb{N}}^d\mid {\mathbf{Y}}^{\mathbf{h}}=\psi \left({\mathbf{Z}}^{\mathbf{t}}\right),{\mathbf{Z}}^{\mathbf{t}}\in \mathcal{B}\}$, obtaining the same result contained in [28] (Theorem 3.3).