Skip to Content
AxiomsAxioms
  • Article
  • Open Access

2 January 2026

14 Pages

Radical Numerical Semigroups

and
1
Department of Mathematics, Faculty of Sciences, University of Cádiz, E-11510 Cádiz, Spain
2
Department of Algebra, Faculty of Sciences, University of Granada, E-18071 Granada, Spain
*
Author to whom correspondence should be addressed.
†
These authors contributed equally to this work.

Abstract

This work contributes to the study of radical numerical semigroups. If n∈Z where n≥2, then the product of all its prime positive divisors is called the radical of n. It is denoted by r(n). A radical numerical semigroup is a numerical semigroup S such that s+r(s)∈S for every s∈S\{0}. We present three algorithms that will help us understand the structure of radical semigroups. These algorithms allow us to calculate all radical numerical semigroups with a fixed genus, with a fixed Frobenius number, as well as with a fixed multiplicity. Furthermore, given X, a set of positive integers such that gcd(X)=1, we will prove the existence of the smallest radical semigroup containing X. We will also present an algorithm to obtain it.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.