The tree of good semigroups in \(\mathbb{N}^2\) and a generalization of the Wilf conjecture (Q2006916)

In this paper, recursive formulas for computing the genus of good semigroups are given. In order to achieve this goal, the authors work with relative good ideals. Once they compute this invariant, they can build a tree where the \(g\)-th level contains all the good semigroups with genus \(g\). It is well-known, in the numerical case, that the tree is built removing the generators which are greater than the Frobenius number. In this case, the authors define the tracks and prove that if we remove a track from a good semigroup, \(S\), we obtain a new semigroup of genus \(g(S)+1\). If this new semigroup is a good one, we say that it is a child of \(S\). Finally, they relate the genus with other invariants. This allows them to check the Wilf Conjecture for good semigroups with genus greater than 22.