The ratio-covariety of numerical semigroups with fixed multiplicity and Frobenius number
Abstract
In this work we will introduce the concept of ratio-covariety, as a nonempty family R of numerical semigroups verifying certain properties. This concept will allow us to: enumerate Describe an algorithmic process to compute R. Prove the existence of the smallest element of that contains a set of positive integers. Talk about the smallest ratio-covariety that contains a finite set of numerical semigroups. enumerate In addition, in this paper we will apply the previous results to the study of the ratio-covariety R(F,m)=\S S is a numerical semigroup with Fro- benius number F and multiplicity m\.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.