2023/05/03 by M. A. Moreno-Frías, J. C. Rosales, Moreno-Frías, M. A. +1
Computer Science · Mathematics · #11D07 #13H10 #20M14 #Commutative Algebra (math.AC) #Commutative Algebra and Its Applications #FOS: Mathematics #Polynomial and algebraic computation
paper · pdf · doi:10.48550/arxiv.2305.02070
openalex publication_date 2023/05/03 · openalex created_date 2023/05/05 · openalex updated_date 2026/08/01
In this work we will introduce the concept of ratio-covariety, as a nonempty family \mathscrR of numerical semigroups verifying certain properties. This concept will allow us to: \beginenumerate \item Describe an algorithmic process to compute \mathscrR. \item Prove the existence of the smallest element of \sR that contains a set of positive integers. \item Talk about the smallest ratio-covariety that contains a finite set of numerical semigroups. \endenumerate In addition, in this paper we will apply the previous results to the study of the ratio-covariety \mathscrR(F,m)=\S| S is a numerical semigroup with Fro- \mbox benius number F and multiplicity m\.