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)
2 Pith papers cite this work. Polarity classification is still indexing.
abstract
Let $A=(a_1, a_2, ..., a_n)$ be relative prime positive integers with $a_i\geq 2$. The Frobenius number $g(A)$ is the greatest integer not belonging to the set $\big\{ \sum_{i=1}^na_ix_i\ |x_i\in \mathbb{N}\big\}$. The general Frobenius problem includes the determination of $g(A)$ and the related Sylvester number $n(A)$ and Sylvester sum $s(A)$. We present a new approach to the Frobenius problem. Basically, we transform the problem into an easier optimization problem. If the new problem can be solved explicitly, then we will be able to obtain a formula of $g(A)$. We illustrate the idea by giving concise proof of some existing formulas and finding some interesting new formulas of $g(A), n(A), s(A)$. Moreover, we find that MacMahon's partition analysis applies to give a new way of calculating $n(A), s(A)$ by using a rational function representation of a polynomial determined by $A$.
years
2023 2verdicts
UNVERDICTED 2representative citing papers
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 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.