Explicit formulas for F(A) and g(A) are obtained for the semigroup generated by A = (a, ba + d, b²a + ((b²-1)/(b-1))d, ..., b^k a + ((b^k-1)/(b-1))d) when a ≥ k-1 - (d-1)/(b-1), with simplifications for Mersenne, Thabit, repunit, and partial results for Proth semigroups.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2023 2verdicts
UNVERDICTED 2representative citing papers
A combinatorial reduction of the Frobenius problem to an optimization task produces explicit formulas for g(A), n(A), and s(A) on special sequences and applies MacMahon's partition analysis to count representations.
citing papers explorer
-
On the Frobenius Number and Genus of a Collection of Semigroups Generalizing Repunit Numerical Semigroups
Explicit formulas for F(A) and g(A) are obtained for the semigroup generated by A = (a, ba + d, b²a + ((b²-1)/(b-1))d, ..., b^k a + ((b^k-1)/(b-1))d) when a ≥ k-1 - (d-1)/(b-1), with simplifications for Mersenne, Thabit, repunit, and partial results for Proth semigroups.