The Frobenius number corresponding to the squares of three consecutive Fibonacci numbers: comparison of three algorithmic processes

2025/07/02 by Aureliano M. Robles-Pérez, J. C. Rosales, Robles-Pérez, Aureliano M. +1
Computer Science · Mathematics · #11D07 #20M13 #20M14 #Algebraic Geometry and Number Theory #Commutative Algebra and Its Applications #FOS: Mathematics #Group Theory (math.GR) #Number Theory (math.NT) #Polynomial and algebraic computation

paper · pdf · doi:10.48550/arxiv.2507.01898

openalex publication_date 2025/07/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We compute the Frobenius number for numerical semigroups generated by the squares of three consecutive Fibonacci numbers. We achieve this by using and comparing three distinct algorithmic approaches: those developed by Ramírez Alfonsín and Rødseth ([15]), Rosales and García-Sánchez ([20]), and Tripathi ([26]).

Citations

• On integers which are representable as sums of large squares
• Numerical semigroups that can be expressed as an intersection of symmetric numerical semigroups Communicated by M.-F. Roy

Related

• On the Frobenius Number of Fibonacci Numerical Semigroups
• The Frobenius problem for four numerical semigroups
• Algorithms and results on multiparameter counting of numerical semigroups
• A Graphical Approach to Finding the Frobenius Number, Genus and Hilbert Series of a Numerical Semigroup
• A New Algorithm for Computing the Frobenius Number