Modular Frobenius pseudo-varieties
From MaRDI portal
Modular Frobenius pseudo-varieties (scientific article)
Abstract: If and is a finite subset of , then we denote by �egin{align*} mathscr{C}(m,A) = left{Sin mathscr{S}_m mid s_1+cdots+s_k-m in S mbox{ if } (s_1,ldots,s_k)in S^k mbox{ and }
ight. \ left.(s_1 �mod m, ldots, s_k �mod m)in A
ight}. end{align*} In this work we prove that is a Frobenius pseudo-variety. We also show algorithms that allows us to establish whether a numerical semigroup belongs to and to compute all the elements of with a fixed genus. Moreover, we introduce and study three families of numerical semigroups, called of second-level, thin and strong, and corresponding to when , , and , respectively.
This page was built for publication: Modular Frobenius pseudo-varieties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6359057)