Presents an O(log b) time algorithm for the three-variable denumerant function d(n;a,b,c).
Curtis, On formulas for the Frobenius number of a numerical semigroup , Math
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Reduces Apéry set of semigroup quotients to minimization when p divides a1, giving closed Frobenius formulas for almost arithmetic progression generators and partially solving a prior open problem.
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
-
A Fast Algorithm for Denumerants with Three Variables
Presents an O(log b) time algorithm for the three-variable denumerant function d(n;a,b,c).
-
On quotients of numerical semigroups for almost arithmetic progressions
Reduces Apéry set of semigroup quotients to minimization when p divides a1, giving closed Frobenius formulas for almost arithmetic progression generators and partially solving a prior open problem.
-
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.