Lattice paths with given number of turns and semimodules over numerical semigroups (Q741654): Difference between revisions

This paper deals with the classification of \(\Gamma\)-semimodules, where \(\Gamma\) is a numerical semigroup with two generators. In the first half, the authors study the isomorphism classes of all \(\Gamma\)-semimodules, which are \(\Gamma\)-sets that are additionally subsets of \(\mathbb{N}\). This culminates in Theorem 3.6 and Theorem 3.7. They then shift their focus to the so called syzygies of \(\Gamma\), which are a special type of \(\Gamma\)-semimodules, used in many branches of mathematics. In Theorem 5.5, they give a strong classification of all such semimodules. The interested reader will find rather precise formulas for calculating the number of these types of \(\Gamma\)-semimodules, as well as an illustrative example. Also, other related objects that might be of interest can be found, such as \(\Gamma\)-lean sets and the so-called ``fundamental couples''.