Patterns on numerical semigroups. (Q2369063)

A pattern \(p\) of length \(n\) is a linear homogeneous polynomial with non-zero integer coefficients in \(n\) variables. A numerical semigroup \(\Lambda\) admits a pattern \(p\) if for every increasing sequence of elements in \(\Lambda\), \(s_i\), (\(1\leq i\leq n\)), \(p(s_1,\dots,s_n)\in\Lambda\). Those numerical semigroups admitting the pattern \(x_1+x_2-x_3\) are called Arf numerical semigroups. In this paper, the authors introduce the concept of pattern, which allows them to classify the whole set of numerical semigroups, arranging them in an infinite non-stabilizing ascending chain. Moreover they describe how to compute the closure of numerical semigroups with respect to patterns. Since both numerical and Arf numerical semigroups are widely used in coding theory, it could be expected some applications to this theory by using some of the described new semigroups.