pith. sign in

arxiv: 2304.09039 · v2 · submitted 2023-04-18 · 🧮 math.CO · math.NT

The Frobenius Formula for A=(a,ha+d,ha+b₂d,...,ha+b_kd)

Feihu Liu , Guoce Xin , Suting Ye , Jingjing Yin This is my paper

Pith reviewed 2026-05-24 08:45 UTC · model grok-4.3

classification 🧮 math.CO math.NT
keywords Frobenius numberstable propertycongruence classorderly sequencenumerical semigrouparithmetic sequence
0
0 comments X

The pith

The Frobenius number g(A(a)) for A(a)=(a,ha+dB) is a congruence class function modulo b_k when a is sufficiently large.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that the stable property previously known for square sequences extends to the general form A(a)=(a,ha+dB) where B is an orderly sequence. This extension provides a characterization of the Frobenius number as depending on the residue class of a modulo b_k for large a. Explicit bounds on a and computations for several specific B sequences are given. Readers interested in numerical semigroups would care because this offers a structured way to handle parametric families of coprime integer sets whose Frobenius numbers are otherwise difficult to compute.

Core claim

Given relatively prime positive integers A=(a1,...,an), the Frobenius number g(A) is the largest integer not representable as nonnegative integer combination of the ai. The stable property extends to A(a)=(a,ha+dB) giving a parallel characterization of g(A(a)) as a congruence class function modulo bk when a is large enough. For orderly sequence B, good bounds for a are found and g is calculated for several cases including B=(1,2,b,b+1) and others. The idea also applies when the first element of B exceeds 1.

What carries the argument

The stable property, which characterizes the Frobenius number as a congruence class function modulo bk for large a.

Load-bearing premise

The sequence B must satisfy the orderly conditions required for the stable property to extend, and a must be larger than a threshold that depends on B.

What would settle it

An explicit counterexample where for an orderly B and a above the bound, g(A(a)) is not a function of a mod bk would disprove the extension of the stable property.

read the original abstract

Given relative prime positive integers $A=(a_1, a_2, ..., a_n)$, the Frobenius number $g(A)$ is the largest integer not representable as a linear combination of the $a_i$'s with nonnegative integer coefficients. We find the ``Stable" property introduced for the square sequence $A=(a,a+1,a+2^2,\dots, a+k^2)$ naturally extends for $A(a)=(a,ha+dB)=(a,ha+d,ha+b_2d,...,ha+b_kd)$. This gives a parallel characterization of $g(A(a))$ as a ``congruence class function" modulo $b_k$ when $a$ is large enough. For orderly sequence $B=(1,b_2,\dots,b_k)$, we find good bound for $a$. In particular we calculate $g(a,ha+dB)$ for $B=(1,2,b,b+1)$, $B=(1,2,b,b+1,2b)$, $B=(1,b,2b-1)$ and $B=(1,2,...,k,K)$. Our idea also applies to the case $B=(b_1,b_2,...,b_k)$, $b_1> 1$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper claims that the 'stable' property previously introduced for square sequences extends to the parametric family A(a)=(a, ha+dB) with B an orderly sequence (1,b2,...,bk), yielding that the Frobenius number g(A(a)) is eventually a congruence-class function modulo bk once a exceeds a B-dependent threshold. Explicit formulas and bounds are supplied for four concrete orderly sequences B=(1,2,b,b+1), B=(1,2,b,b+1,2b), B=(1,b,2b-1), B=(1,2,...,k,K), with the idea asserted to apply also when the first term of B exceeds 1.

Significance. If the extension of the stable property holds with the stated modular characterization, the work would supply explicit, computable expressions for g(A(a)) in several infinite families of coprime tuples, which is a concrete advance for the Frobenius problem beyond the two- and three-variable cases. The explicit bounds on a for orderly B and the verification on multiple examples constitute verifiable, falsifiable content.

major comments (2)
  1. [Abstract, §1] Abstract and §1 (introduction): the central claim that the stable property 'naturally extends' to arbitrary orderly B, producing a congruence-class characterization of g(A(a)) mod bk, is supported only by explicit calculations for four specific sequences; no general argument or inductive step is supplied showing that the modular reduction carries over once a exceeds the B-dependent threshold.
  2. [§3–§6] §3–§6 (explicit cases): while the formulas for B=(1,2,b,b+1), B=(1,2,b,b+1,2b), B=(1,b,2b-1) and B=(1,2,...,k,K) are stated, the manuscript does not verify that the same modular structure persists for an arbitrary orderly B (e.g., one with larger gaps or non-monotonic increments) that still satisfies the orderly hypothesis; the absence of a counter-example test or general proof leaves the parallel characterization unestablished.
minor comments (2)
  1. [§2] Notation: the definition of 'orderly sequence' is referenced but not restated with its precise arithmetic conditions; a self-contained definition in §2 would improve readability.
  2. [Abstract, §2] The phrase 'good bound for a' is used without an explicit inequality relating a to the entries of B; stating the threshold explicitly (even if B-dependent) would strengthen the claim.

Simulated Author's Rebuttal

2 responses · 1 unresolved

We thank the referee for the careful and constructive report. We address the two major comments point-by-point below. The revisions will consist of clarifications to the abstract, introduction, and a new remark on scope; no new general proof will be added at this stage.

read point-by-point responses

  1. Referee: [Abstract, §1] Abstract and §1 (introduction): the central claim that the stable property 'naturally extends' to arbitrary orderly B, producing a congruence-class characterization of g(A(a)) mod bk, is supported only by explicit calculations for four specific sequences; no general argument or inductive step is supplied showing that the modular reduction carries over once a exceeds the B-dependent threshold.

    Authors: The manuscript defines orderly sequences B and states a B-dependent threshold beyond which the congruence-class property holds; explicit verification is given only for the four listed families, together with the observation that the same method applies when the first entry of B exceeds 1. We agree that a single inductive argument covering every orderly B is not supplied. The revision will rephrase the abstract and §1 to state that the modular characterization is established for the four families (and indicated for b1>1) while the bound on a is given for any orderly B; the claim of 'natural extension' will be qualified accordingly. revision: yes

  2. Referee: [§3–§6] §3–§6 (explicit cases): while the formulas for B=(1,2,b,b+1), B=(1,2,b,b+1,2b), B=(1,b,2b-1) and B=(1,2,...,k,K) are stated, the manuscript does not verify that the same modular structure persists for an arbitrary orderly B (e.g., one with larger gaps or non-monotonic increments) that still satisfies the orderly hypothesis; the absence of a counter-example test or general proof leaves the parallel characterization unestablished.

    Authors: The four families were chosen because they admit closed-form expressions; the orderly hypothesis is used only to guarantee the existence of the threshold. We will add a short paragraph after §6 noting that the modular pattern has been checked only for these families and that further verification for orderly sequences with larger gaps remains open. This addition will make the evidential basis explicit without claiming a general proof. revision: yes

standing simulated objections not resolved
  • A complete general proof or inductive argument establishing the congruence-class characterization for every orderly B is not present in the manuscript and cannot be supplied in the revision.

Circularity Check

0 steps flagged

No circularity; explicit computations for specific B sequences

full rationale

The paper references the stable property as previously introduced for square sequences and claims a natural extension to A(a)=(a,ha+dB) for orderly B, yielding a congruence-class characterization of g(A(a)) for large a. It then supplies explicit bounds and formulas only for four concrete B sequences ((1,2,b,b+1), (1,2,b,b+1,2b), (1,b,2b-1), (1,2,...,k,K)) plus the b1>1 case. These are direct calculations, not reductions of a fitted parameter or self-referential definition. No load-bearing step equates a claimed prediction to its own input by construction, and the specific results remain independently verifiable against the definition of the Frobenius number. Self-reference to the prior square-sequence case is present but not load-bearing for the new explicit formulas.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review supplies no equations or definitions, so no free parameters, axioms, or invented entities can be identified.

pith-pipeline@v0.9.0 · 5776 in / 1056 out tokens · 17193 ms · 2026-05-24T08:45:27.064403+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

27 extracted references · 27 canonical work pages · 2 internal anchors

  1. [1]

    Adamaszek, M

    A. Adamaszek, M. Adamaszek, Combinatorics of the change-making problem , European. J. Comb. 31 (2010), 47–63

    work page 2010

  2. [2]

    A. Assi, M. D’Anna, P. A. Garc´ ıa-S´ anchez Numerical Semigroups and Applications , Second edition. Vol.3, RSMS Springer, Cham (2020)

    work page 2020

  3. [3]

    Brauer, On a problem of partitions , Amer

    A. Brauer, On a problem of partitions , Amer. J. Math. 64 (1942), 299–312

    work page 1942

  4. [4]

    Brauer, J

    A. Brauer, J. E. Shockley, On a problem of Frobenius , J. Reine Angew. Math. 211 (1962), 215– 220

    work page 1962

  5. [5]

    L. J. Cowen, R. Cowen, A. Steinberg, Totally greedy coin sets and greedy obstructions, Electron. J. Comb. 15 (2008), #R90

    work page 2008

  6. [6]

    Curtis, On formulas for the Frobenius number of a numerical semigroup , Math

    F. Curtis, On formulas for the Frobenius number of a numerical semigroup , Math. Scand. 67 (1990), 190–192

    work page 1990

  7. [7]

    Denham, Short generating functions for some semigroup algebras , Electron

    G. Denham, Short generating functions for some semigroup algebras , Electron. J. Comb. 10 (2003), #R36

    work page 2003

  8. [8]

    A. L. Dulmage, N. S. Mendelsohn, Gaps in the exponent set of primitive matrices , Illinois J. Math. 8 (1964), 642–656

    work page 1964

  9. [9]

    Einstein, D

    D. Einstein, D. Lichtblau, A. Strzebonski, S. Wagon, Frobenius numbers by lattice point enumer- ation, Integers. 7 (2007), A15

    work page 2007

  10. [10]

    T. C. Hu, M. L. Lenard, Optimality of a Heuristic solution for a class of Knapsack problems , Operations Research. 24(1) (1976), 193–196

    work page 1976

  11. [11]

    Hujter, On the lowest value of the Frobenius number , Technical Report MN/31 Computer and Automation Inst., Hungarian Academy of Sciences

    M. Hujter, On the lowest value of the Frobenius number , Technical Report MN/31 Computer and Automation Inst., Hungarian Academy of Sciences. (1987)

    work page 1987

  12. [12]

    Komatsu, Sylvester power and weighted sums on the Frobenius set in arithmetic progression , Discrete Appl

    T. Komatsu, Sylvester power and weighted sums on the Frobenius set in arithmetic progression , Discrete Appl. Math. 315 (2022), 110–126

    work page 2022

  13. [13]

    Komatsu, Sylvester sums on the Frobenius set in arithmetic progression , arXiv:2203.12238v1, (2022)

    T. Komatsu, Sylvester sums on the Frobenius set in arithmetic progression , arXiv:2203.12238v1, (2022)

    work page arXiv 2022

  14. [14]

    Komatsu, Sylvester sum on the Frobenius set in arithmetic progression with initial gaps , Advances in Number Theory and Applied Analysis, (2023)

    T. Komatsu, Sylvester sum on the Frobenius set in arithmetic progression with initial gaps , Advances in Number Theory and Applied Analysis, (2023)

    work page 2023

  15. [15]

    F. Liu, G. Xin, On Frobenius formulas of power sequences , arXiv:2210.02722, (2022)

    work page internal anchor Pith review Pith/arXiv arXiv 2022

  16. [16]

    F. Liu, G. Xin, A combinatorial approach to Frobenius numbers of some special sequences (Com- plete Version), arXiv:2303.07149. (2023)

    work page internal anchor Pith review Pith/arXiv arXiv 2023

  17. [17]

    M. J. Magazine, G. L. Nemhauser, L. E. Trotter Jr, When the greedy solution solves a class of Knapsack problems, Operations Research. 23(2) (1975), 207–217

    work page 1975

  18. [18]

    J. L. Ram´ ırez Alfons´ ın,The Diophantine Frobenius Problem , Oxford Lecture Series in Mathe- matics and Its Applications, vol. 30, Oxford University Press. (2005)

    work page 2005

  19. [19]

    J. B. Roberts, Note on linear forms , Proc. Amer. Math. Soc. 7 (1956), 465–469

    work page 1956

  20. [20]

    A. M. Robles-P´ erez, J. C. Rosales,The Frobenius number for sequences of triangular and tetra- hedral numbers, J. Number Theory. 186 (2018), 473–492. 16 FEIHU LIU 1, GUOCE XIN 2,∗, SUTING YE 3 AND JINGJING YIN 4

    work page 2018

  21. [21]

    ¨O. J. R¨ odseth,On a linear diophantine problem of Frobenius II , J. Reine Angew Math. 307/308 (1979) 431–440

    work page 1979

  22. [22]

    J. C. Rosales, P. A. Garc´ ıa-S´ anchez, Numerical Semigroups , Developments in Mathematics. Vol.20, Springer, New York (2009)

    work page 2009

  23. [23]

    E. S. Selmer, On the linear Diophantine problem of Frobenius , J. Reine Angew. Math. 293/294 (1977), 1–17

    work page 1977

  24. [24]

    J. J. Sylvester, On sub-invariants, i.e., semi-invariants to binary quanties of an unlimited order , Amer. J. Math. 5 (1882), 119–136

    work page

  25. [25]

    Tripathi, The Frobenius problem for modified arithmetic progressions , J

    A. Tripathi, The Frobenius problem for modified arithmetic progressions , J. Integer Seq. 16(7) (2013), 13.7.4

    work page 2013

  26. [26]

    Tripathi, On the Frobenius problem for{a, ha+ d, ha+ bd, ha+ b2d,

    A. Tripathi, On the Frobenius problem for{a, ha+ d, ha+ bd, ha+ b2d, . . . , ha+ bkd}, J. Number Theory. 162 (2016), 212–223

    work page 2016

  27. [27]

    Tripathi, Formulate for the Frobenius number in three variables , J

    A. Tripathi, Formulate for the Frobenius number in three variables , J. Number Theory. 170 (2017), 368–389. 1,2,3,4School of Mathematical Sciences, Capital Normal University, Beijing 100048, PR China Email address : 1liufeihu7476@163.com & 2guoce xin@163.com & 3yesuting0203@163.com & 4yinjingj@163.com

    work page 2017