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.
Xin, A Euclid style algorithm for MacMahon’s partition analysis , J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.