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.
Komatsu, Sylvester sum on the Frobenius set in arithmetic progression with initial gaps
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 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.
-
A Combinatorial Approach to Frobenius Numbers of Some Special Sequences (Complete Version)
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.