Frobenius numbers of numerical semigroups generated by three consecutive squares or cubes.

DOI10.1007/s00233-014-9687-8zbMath1343.20062OpenAlexW2047731532MaRDI QIDQ896247

Mikhail Lepilov, Joshua O'Rourke, Irena Swanson

Publication date: 9 December 2015

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00233-014-9687-8

zbMATH Keywords

numerical semigroupsFrobenius numbersRødseth algorithm

Mathematics Subject Classification ID

Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) The Frobenius problem (11D07)

Related Items (6)

Numerical semigroups generated by quadratic sequences ⋮ Unnamed Item ⋮ On integers which are representable as sums of large squares ⋮ Unnamed Item ⋮ The Frobenius number for sequences of triangular and tetrahedral numbers ⋮ Numerical Semigroups Generated by Squares and Cubes of Three Consecutive Integers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Numerical semigroups: Apéry sets and Hilbert series.
• Complexity of the Frobenius problem
• Note on Linear Forms
• On formulas for the Frobenius number of a numerical semigroup.
• On a linear Diophantine problem of Frobenius.

This page was built for publication: Frobenius numbers of numerical semigroups generated by three consecutive squares or cubes.