The Frobenius problem for four numerical semigroups

2017/06/28 by Kyunghwan Song, Song, Kyunghwan
Computer Science · Mathematics · #11A67 #20M30 #Commutative Algebra and Its Applications #FOS: Mathematics #Graph theory and applications #Number Theory (math.NT) #Polynomial and algebraic computation

paper · pdf · doi:10.48550/arxiv.1706.09246

openalex publication_date 2017/06/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The greatest integer that does not belong to a numerical semigroup S is called the Frobenius number of S and finding the Frobenius number is called the Frobenius problem. In this paper, we introduce the Frobenius problem for numerical semigroups generated by Thabit number base b and Thabit number of the second kind base b which are motivated by the Frobenius problem for Thabit numerical semigroups. Also, we introduce the Frobenius problem for numerical semigroups generated by Cunningham number and Fermat number base b

Citations

• On the Frobenius Number of Fibonacci Numerical Semigroups

Related

• The Frobenius problem for Generalized Thabit numerical semigroups
• The Frobenius problem for Numerical Semigroups generated by binomial coefficients
• The Frobenius problem for generalized repunit numerical semigroups
• On the Frobenius Number and Genus of a Collection of Semigroups Generalizing Repunit Numerical Semigroups
• The Frobenius Problem for the Proth Numbers