Frobenius numbers of numerical semigroups generated by three consecutive squares or cubes.
DOI10.1007/S00233-014-9687-8zbMATH Open1343.20062OpenAlexW2047731532MaRDI QIDQ896247FDOQ896247
Authors: 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
Recommendations
Frobenius numbersnumerical semigroups[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=R%EF%BF%BD%EF%BF%BDdseth+algorithm&go=Go R��dseth algorithm]
Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) The Frobenius problem (11D07)
Cites Work
- Title not available (Why is that?)
- 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.
- Numerical semigroups: Apéry sets and Hilbert series.
- On the Frobenius number of Fibonacci numerical semigroups
- The Frobenius number of geometric sequences
- Title not available (Why is that?)
Cited In (7)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical Semigroups Generated by Squares and Cubes of Three Consecutive Integers
- Title not available (Why is that?)
- On integers which are representable as sums of large squares
- The Frobenius number for sequences of triangular and tetrahedral numbers
- Numerical semigroups generated by quadratic sequences
This page was built for publication: Frobenius numbers of numerical semigroups generated by three consecutive squares or cubes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896247)
