Universal sums of generalized polygonal numbers of almost prime length

Ben Kane; Kwan To Ng; Soumyarup Banerjee

arxiv: 2604.07826 · v1 · submitted 2026-04-09 · 🧮 math.NT

Universal sums of generalized polygonal numbers of almost prime length

Soumyarup Banerjee , Ben Kane , Kwan To Ng This is my paper

Pith reviewed 2026-05-10 18:11 UTC · model grok-4.3

classification 🧮 math.NT

keywords universal sumsgeneralized polygonal numbersalmost primesfiniteness theoremsprime divisorsnumber theory

0 comments

The pith

For each fixed m, only finitely many universal sums of generalized polygonal numbers exist when inputs have a restricted number of prime divisors away from exceptions.

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

The paper establishes two finiteness theorems for sums of generalized polygonal numbers that represent every natural number. It fixes m at least 3 and restricts each input to the polygonal formula to have at most L prime factors counted with multiplicity, outside a finite set of exceptional primes. The first theorem shows that for L at least 900 the finite check needed to confirm universality has a bound independent of L. The second theorem supplies an optimal bound on that check once L exceeds a constant multiple of the logarithm of m.

Core claim

Fixing m in the natural numbers at least 3, the authors establish that the set of universal sums of generalized polygonal numbers, where each input has a restricted number L of prime divisors (counting multiplicity) away from a finite set of exceptional primes, is finite. They provide two versions: one with a uniform bound on the finite check for L greater than or equal to 900, and another with an optimal bound when L exceeds a constant multiple of log m.

What carries the argument

The two finiteness theorems that bound the possible universal sums under restrictions on the prime factorization length of the inputs.

If this is right

For L at least 900 the verification that a given sum is universal can be completed with a bound independent of L.
When L grows faster than a constant times log m the bound on the check becomes optimal.
The exceptional primes form a finite set that can be treated separately from the almost-prime inputs.
Classification of all such universal sums for each m reduces to a finite computation once L is sufficiently large.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The uniform bound for L at least 900 suggests that computational searches for small m can be carried out without adjusting the search range as L increases.
The logarithmic dependence on m opens the possibility of applying the same style of argument to families of forms where m varies.

Load-bearing premise

That L is large enough so the exceptional primes remain finite and the verification of universality reduces to an effective finite check.

What would settle it

An explicit fixed m together with an L at least 900 and an infinite collection of distinct universal sums whose inputs all have at most L prime factors away from a finite exceptional set would disprove the theorems.

read the original abstract

In this paper, we consider universal sums of generalized polygonal numbers. Fixing $m\in\mathbb{N}_{\geq 3}$, we show two finiteness theorems for universal sums of generalized polygonal numbers whose inputs have a restricted number $L$ of prime divisors (counting multiplicity) away from an finite set of exceptional primes. In the first theorem, we fix $m$ and uniformly bound the finite check independent of $L\geq 900$, and in the second theorem, we give an optimal bound for the finiteness check if $L$ is larger than a constant times $\log(m)$.

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.

Desk Editor's Note private letter to a colleague

The paper gives two finiteness theorems for universal sums of generalized polygonal numbers restricted to almost-primes with bounded prime factors, uniform for L≥900 or logarithmic in m, but the effectivity claim needs scrutiny on Siegel zeros.

read the letter

The main result is two theorems that, for fixed m≥3, show only finitely many generalized polygonal sums need checking for universality when the inputs have at most L prime factors (with multiplicity) outside a finite set of bad primes. One version keeps the check size bounded independently of L once L hits 900. The other optimizes the bound to something like c log m when L exceeds a multiple of log m. This is a clean extension of existing universality work on polygonal numbers, adding the almost-prime restriction and delivering explicit finiteness that prior results did not have in this form. The analytic setup looks standard and the claims follow from controlling representations via circle-method or Hardy-Littlewood type estimates adapted to almost-primes. No circularity or invented objects appear in the statements. The soft spot is effectivity. Analytic control on almost-primes in arithmetic progressions or short intervals typically relies on zero-free regions for Dirichlet L-functions. Siegel zeros make the implied constants ineffective, so a “finite check” that cannot be carried out in finite time is not truly effective. The abstract asserts effectivity, but without an explicit workaround such as Bombieri-Vinogradov level estimates or a fully effective zero-free region, the claim does not automatically hold. I would check the proofs to see how the bounds are derived. This paper is for additive number theorists working on restricted representations and universal forms. A reader already familiar with polygonal numbers and sieve methods will find the explicit bounds useful. It is worth sending to serious referees because the combination is new, the statements are precise, and the methods are appropriate even if revisions are needed on the effectivity details. I would engage with it in peer review.

Referee Report

1 major / 0 minor

Summary. Fixing m ≥ 3, the paper proves two finiteness theorems for universal sums of generalized polygonal numbers of almost-prime length: inputs n_i satisfy Ω(n_i) ≤ L away from a finite set of exceptional primes. The first theorem gives a uniform finite check independent of L when L ≥ 900; the second gives an optimal bound when L ≫ log m.

Significance. If the effectivity claims hold, the results would supply effective criteria for universality of such sums, extending classical polygonal-number universality theorems to almost-prime inputs and furnishing explicit bounds usable in computational checks. This would be a concrete advance in effective Diophantine representation problems.

major comments (1)

[Abstract] Abstract: the asserted 'effective finite check' (uniform for L ≥ 900 or for L ≫ log m) relies on analytic estimates for the distribution of almost-primes in arithmetic progressions or short intervals. Standard circle-method or Hardy–Littlewood machinery for such problems invokes zero-free regions for Dirichlet L-functions; any appeal to Siegel’s theorem renders the constants ineffective, so the claimed effectivity does not follow without an explicit effective zero-free region or a Bombieri–Vinogradov-type substitute that avoids Siegel zeros.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and for raising this important point about effectivity. We address the comment below and have revised the manuscript accordingly.

read point-by-point responses

Referee: [Abstract] Abstract: the asserted 'effective finite check' (uniform for L ≥ 900 or for L ≫ log m) relies on analytic estimates for the distribution of almost-primes in arithmetic progressions or short intervals. Standard circle-method or Hardy–Littlewood machinery for such problems invokes zero-free regions for Dirichlet L-functions; any appeal to Siegel’s theorem renders the constants ineffective, so the claimed effectivity does not follow without an explicit effective zero-free region or a Bombieri–Vinogradov-type substitute that avoids Siegel zeros.

Authors: We agree with the referee that the effectivity of the finite checks requires careful scrutiny. Our proofs apply the Hardy–Littlewood circle method to count representations, combined with estimates on almost-primes in arithmetic progressions and short intervals. While the Bombieri–Vinogradov theorem (used for the distribution in APs) is effective and Siegel-zero free by averaging, the short-interval estimates for almost-primes in the uniform bound (first theorem) rely on zero-density estimates whose explicit versions can invoke Siegel’s theorem, rendering the constants ineffective. The second theorem’s bound L ≫ log m is asymptotically optimal and draws on Vinogradov-type estimates that admit effective constants in some ranges. We have revised the abstract to replace any reference to an “effective finite check” with a statement of the finiteness theorems alone, and we have added a remark in the introduction explicitly noting that the bounds are ineffective in general due to possible Siegel zeros, while remaining effective under GRH or with explicit zero-free regions. These changes clarify the claims without affecting the validity of the two finiteness theorems. revision: yes

Circularity Check

0 steps flagged

No significant circularity in the derivation chain

full rationale

The paper states two finiteness theorems for universal sums of generalized polygonal numbers with inputs of restricted prime-divisor count L (away from exceptional primes), with uniform or logarithmic bounds on the finite check. These are presented as theorems proved via standard number-theoretic tools (circle method, Hardy-Littlewood asymptotics, arithmetic progressions). No quoted steps reduce by construction to fitted parameters renamed as predictions, self-definitional loops, or load-bearing self-citations whose content is unverified outside the paper. The effectivity question concerning Siegel zeros is a potential correctness or effectivity issue, not a circularity reduction. The derivation chain is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

No free parameters, invented entities, or ad-hoc axioms are introduced; the work relies on standard results in number theory for representations by quadratic forms and finiteness arguments in additive bases.

axioms (1)

standard math Standard theorems on quadratic forms and representation numbers in number theory
Invoked to establish universality conditions and finiteness under prime divisor restrictions.

pith-pipeline@v0.9.0 · 5389 in / 1186 out tokens · 39034 ms · 2026-05-10T18:11:26.530174+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

10 extracted references · 10 canonical work pages

[1]

Banerjee and B

S. Banerjee and B. Kane,Finiteness theorems for universal sums of squares of almost primes, Trans. Amer. Math. Soc.375(2022), 7669-7714

work page 2022
[2]

Br¨ udern and E

J. Br¨ udern and E. Fouvry,Lagrange’s four squares theorem with almost prime variables, J. Reine Angew. Math.454(1994), 59–96

work page 1994
[3]

Kamaraj , B

R. Kamaraj , B. Kane and R. TomiyasuUniversal sums of generalized heptagonal numbers, J. Number Theory 249(2023), 500–536

work page 2023
[4]

Kane and J

B. Kane and J. Liu,Universal sums ofm-gonal numbers, Int. Math. Res. Not.2020(2020), 6999–7036

work page 2020
[5]

Kane and Z

B. Kane and Z. Yang,On finiteness theorems for sums of generalized polygonal numbers, preprint

work page
[6]

B. M. Kim and D. Park,A finiteness theorem for universalm-gonal forms, Bull. London Math. Soc.57 (2025), 625–637

work page 2025
[7]

Ng, Sums of four generalized polygonal numbers of almost prime length, preprint

K. Ng, Sums of four generalized polygonal numbers of almost prime length, preprint

work page
[8]

O’Meara,Introduction to quadratic forms, Springer-Verlag, Berlin, 1963

O.T. O’Meara,Introduction to quadratic forms, Springer-Verlag, Berlin, 1963

work page 1963
[9]

Ono,The web of modularity: arithmetic of the coefficients of modular forms andq-series, Regional conference series in Math.102, 2004

K. Ono,The web of modularity: arithmetic of the coefficients of modular forms andq-series, Regional conference series in Math.102, 2004

work page 2004
[10]

Shimura,Inhomogeneous quadratic forms and triangular numbers, Amer

G. Shimura,Inhomogeneous quadratic forms and triangular numbers, Amer. J. Math.126(2004), 191–214. Department of Mathematics, Indian Institute of technology Kharagpur, Kharagpur, West Ben- gal - 721302, India Email address:soumya.tatan@gmail.com Mathematics Department, The University of Hong Kong, Pokfulam, Hong Kong Email address:bkane@hku.hk Mathematics...

work page 2004

[1] [1]

Banerjee and B

S. Banerjee and B. Kane,Finiteness theorems for universal sums of squares of almost primes, Trans. Amer. Math. Soc.375(2022), 7669-7714

work page 2022

[2] [2]

Br¨ udern and E

J. Br¨ udern and E. Fouvry,Lagrange’s four squares theorem with almost prime variables, J. Reine Angew. Math.454(1994), 59–96

work page 1994

[3] [3]

Kamaraj , B

R. Kamaraj , B. Kane and R. TomiyasuUniversal sums of generalized heptagonal numbers, J. Number Theory 249(2023), 500–536

work page 2023

[4] [4]

Kane and J

B. Kane and J. Liu,Universal sums ofm-gonal numbers, Int. Math. Res. Not.2020(2020), 6999–7036

work page 2020

[5] [5]

Kane and Z

B. Kane and Z. Yang,On finiteness theorems for sums of generalized polygonal numbers, preprint

work page

[6] [6]

B. M. Kim and D. Park,A finiteness theorem for universalm-gonal forms, Bull. London Math. Soc.57 (2025), 625–637

work page 2025

[7] [7]

Ng, Sums of four generalized polygonal numbers of almost prime length, preprint

K. Ng, Sums of four generalized polygonal numbers of almost prime length, preprint

work page

[8] [8]

O’Meara,Introduction to quadratic forms, Springer-Verlag, Berlin, 1963

O.T. O’Meara,Introduction to quadratic forms, Springer-Verlag, Berlin, 1963

work page 1963

[9] [9]

Ono,The web of modularity: arithmetic of the coefficients of modular forms andq-series, Regional conference series in Math.102, 2004

K. Ono,The web of modularity: arithmetic of the coefficients of modular forms andq-series, Regional conference series in Math.102, 2004

work page 2004

[10] [10]

Shimura,Inhomogeneous quadratic forms and triangular numbers, Amer

G. Shimura,Inhomogeneous quadratic forms and triangular numbers, Amer. J. Math.126(2004), 191–214. Department of Mathematics, Indian Institute of technology Kharagpur, Kharagpur, West Ben- gal - 721302, India Email address:soumya.tatan@gmail.com Mathematics Department, The University of Hong Kong, Pokfulam, Hong Kong Email address:bkane@hku.hk Mathematics...

work page 2004