Frobenius pseudo-varieties in numerical semigroups. (Q2255376)

A family \(F\) of numerical semigroups is a Frobenius variety if for all \(S,T\in F\), the numerical semigroup \(S\cap T\in F\), and if \(S\in T\) and \(S\neq\mathbb N\), then \(S\cup F(S)\in F\), where \(F(S)\) is the largest integer not in \(S\) (the Frobenius number of \(S\)). The set of Arf numerical semigroups is a Frobenius variety, and also the set of saturated numerical semigroups. The same stands for finite intersections of proportionally modular numerical semigroups, or equivalently, numerical semigroups having a Toms decomposition. Numerical semigroups admitting a linear homogeneous pattern (for instance, that of Arf semigroups is \(x+y-z\)) form also a Frobenius variety. The concept of Frobenius variety allows to consider the closure of a set of nonnegative integers, defined as the intersection of all semigroups in the variety containing this set of integers. Hence we can talk about generating systems with respect to a variety, and consequently of minimal generating systems of a semigroup in a Frobenius variety (see for instance [\textit{J. C. Rosales} and \textit{P. A. García-Sánchez}, Numerical Semigroups. Developments in Mathematics 20. Dordrecht: Springer (2009; Zbl 1220.20047)]). For a given variety \(F\) and a numerical semigroup \(S\in F\), there is a unique minimal generating systems of \(S\) with respect to \(F\). Its elements are precisely those \(x\in S\) such that \(S\setminus\{x\}\in F\). Hence the elements in a Frobenius variety can be depicted in a digraph (or in a graph if we only remove minimal generators greater than the Frobenius number). However, Frobenius varieties do not cover all families of numerical semigroups with these nice properties. For instance, in the set of numerical semigroups with maximal embedding dimension and fixed multiplicity, we can still reproduce the idea of closure, and get special minimal generating systems. These semigroups admit a particular pattern: \(x+y-m\) with \(m\) the (fixed) multiplicity. The same holds for other non-homogeneous patterns, and to this end, in [\textit{M. Bras-Amorós} et al., Int. J. Algebra Comput. 23, No. 6, 1469-1483 (2013; Zbl 1291.20057)], the concept of \(m\)-variety was introduced. The authors in this manuscript go a step beyond, generalizing the concepts of Frobenius variety and \(m\)-variety. A set of numerical semigroups \(F\) is a pseudo-Frobenius variety if (1) there exists the maximum of \(F\) with respect to set inclusion, say \(M\), (2) for any \(S,T\in F\), \(S\cap T\in F\), and (3) whenever \(S\neq M\), \(S\cup\{F(S)\}\in F\). The idea of closure can be particularized to this new definition, and consequently the concept of minimal generating set with respect to a pseudo-Frobenius variety. Actually, if one depicts a Frobenius variety in a tree, a pseudo-Frobenius variety corresponds to the subtree starting at a given node \(M\).