Provides a closed-form piecewise quadratic expression for the Frobenius number of shifted squares, obtained via combinatorial reduction, Lagrange's theorem, and generating functions.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
verdicts
UNVERDICTED 3representative citing papers
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.
Extends the stable property of Frobenius numbers to sequences A(a)=(a, ha+dB) yielding a congruence-class characterization of g(A(a)) mod bk for large a, plus explicit formulas for several B.
citing papers explorer
-
On Frobenius Numbers of Shifted Power Sequences
Provides a closed-form piecewise quadratic expression for the Frobenius number of shifted squares, obtained via combinatorial reduction, Lagrange's theorem, and generating functions.
-
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.
-
The Frobenius Formula for $A=(a,ha+d,ha+b_2d,...,ha+b_kd)$
Extends the stable property of Frobenius numbers to sequences A(a)=(a, ha+dB) yielding a congruence-class characterization of g(A(a)) mod bk for large a, plus explicit formulas for several B.