- Record: found
- Abstract: found
- Article: found
The Frobenius problem for Thabit numerical semigroups base b
Preprint
2017-06-28
Read this article at
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
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 a Thabit numerical semigroup base \(b\), which is motivated by the Frobenius problem for Thabit numerical semigroups.
Related collections
Most cited references12
- Record: found
- Abstract: not found
- Article: not found
Complexity of the Frobenius problem
J. Ram�rez-Alfons�n (1996)
- Record: found
- Abstract: not found
- Article: not found
An optimal lower bound for the Frobenius problem
Iskander Aliev, Peter M. Gruber (2007)
- Record: found
- Abstract: not found
- Article: not found
On a linear diophantine problem of Frobenius: an improved algorithm
Timothy Heap, M. Lynn, Sally Heap … (1965)