arxiv: 2605.10512 · v1 · submitted 2026-05-11 · 🧮 math.NT · math.CO

Recognition: 2 theorem links

· Lean Theorem

Reciprocals of Subsum Polynomials

Brooke Feigon, Cristina Ballantine, George Beck, Kathrin Maurischat

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

classification 🧮 math.NT math.CO

keywords subsum polynomialspartitionsreciprocalsarithmetic propertiescombinatorial objectsgenerating functions

0 comments

The pith

The sum of reciprocals of subsum polynomials over all partitions of n has arithmetic properties and connections to combinatorial objects.

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

The paper defines the subsum polynomial of a partition λ as the product of (1 plus x to the power λi) for each part. It then considers the sum of the reciprocals of these polynomials for every partition of a fixed n. The work proves arithmetic properties for polynomials related to this sum and identifies links to other combinatorial objects. Sympathetic readers would be interested because such sums could yield new tools for analyzing partitions and their generating functions.

Core claim

We introduce the subsum polynomial sp(λ, x) defined by the product from i=1 to k of (1 + x^λi) for a partition λ. We study the sum of reciprocals of sp(λ, x) over all partitions of n, prove arithmetic properties of related polynomials, and offer connections to other combinatorial objects.

What carries the argument

The subsum polynomial sp(λ, x), which multiplies (1 + x to each part) and serves as the basis for taking reciprocals and summing over partitions of n.

If this is right

The related polynomials exhibit arithmetic properties that may include integrality or congruence conditions.
Connections to other combinatorial objects suggest new identities or enumerative interpretations.
The sum provides a compact expression that encodes information about all partitions of n.

Where Pith is reading between the lines

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

This construction might lead to recursive ways to compute the sums for successive n.
Links to combinatorial objects could imply applications in algebraic combinatorics beyond the paper's scope.

Load-bearing premise

The sum of reciprocals of subsum polynomials over partitions of n admits provable arithmetic properties and non-trivial connections to other combinatorial objects.

What would settle it

Explicit computation of the sum for a specific n where the resulting expression lacks the stated arithmetic properties or fails to connect meaningfully to known combinatorial objects.

read the original abstract

We introduce the subsum polynomial of a partition $\lambda=(\lambda_1, \lambda_2, \ldots, \lambda_k)$ defined by $\mathrm{sp}(\lambda, x)=\prod_{i=1}^k(1+x^{\lambda_i})$. We study the sum of reciprocals of $\mathrm{sp}(\lambda, x)$ over all partitions of $n$. We prove arithmetic properties of related polynomials and offer connections to other combinatorial objects.

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 defines a new subsum polynomial for partitions and studies the sum of their reciprocals, proving some arithmetic properties in a narrow combinatorial setting.

read the letter

The main takeaway is a fresh definition: for a partition λ with parts λi, the subsum polynomial is the product over i of (1 + x^λi). The central object is then the sum of the reciprocals of these polynomials taken over all partitions of a fixed n. The authors prove arithmetic properties of related polynomials and note links to other combinatorial objects. That construction and the reciprocal-sum focus look original on the face of it. The work is clean in setting up the generating-function style object and in carrying out the claimed manipulations to extract arithmetic information, such as integrality after clearing denominators. Those steps are the sort of thing that can be checked directly. The connections to existing objects are presented as incremental rather than revolutionary, which matches the modest scope. The soft spot is that the results stay inside a small corner of partition theory. Without broader applications or surprising identities that reach outside the subfield, the paper feels like a solid but specialized note rather than something that shifts how people think about generating functions in general. The abstract gives no sample computations or explicit theorems, so the depth of the proofs is hard to judge from the summary alone, but the stress-test shows no internal contradictions in the setup. This is for readers already working on partition generating functions or combinatorial polynomials. Someone outside that niche will not find much to use. It is worth sending to peer review so the proofs can be examined in full; the claims are concrete enough to be refereed properly.

Referee Report

1 major / 0 minor

Summary. The manuscript introduces the subsum polynomial sp(λ, x) of a partition λ = (λ1, λ2, …, λk) defined by sp(λ, x) = ∏_{i=1}^k (1 + x^{λ_i}). It studies the sum of the reciprocals of sp(λ, x) over all partitions of n, claims to prove arithmetic properties of related polynomials, and offers connections to other combinatorial objects.

Significance. If the claimed arithmetic properties and combinatorial connections can be rigorously established with explicit statements and derivations, the construction of the reciprocal sum over subsum polynomials could provide a new lens on partition generating functions, potentially yielding integrality results or links to known objects such as q-series or symmetric function identities. The central object is well-posed as a rational generating function whose cleared-denominator polynomial might admit arithmetic study.

major comments (1)

[Abstract] Abstract: The abstract asserts that arithmetic properties are proved but supplies no derivations, examples, error analysis, or explicit statements of the theorems or polynomials involved. This absence makes it impossible to verify whether the mathematics supports the central claims as stated.

Simulated Author's Rebuttal

1 responses · 0 unresolved

Thank you for the opportunity to respond to the referee's report. We address the major comment below.

read point-by-point responses

Referee: [Abstract] Abstract: The abstract asserts that arithmetic properties are proved but supplies no derivations, examples, error analysis, or explicit statements of the theorems or polynomials involved. This absence makes it impossible to verify whether the mathematics supports the central claims as stated.

Authors: We appreciate the referee's observation. Abstracts are designed to be concise summaries and typically do not include detailed derivations, examples, or error analyses, which are instead presented in the main text of the manuscript. The full paper provides explicit statements of the theorems, the definitions of the related polynomials, proofs of the arithmetic properties, and connections to combinatorial objects, along with examples. However, we agree that enhancing the abstract could help readers better understand the claims upfront. In the revised manuscript, we will update the abstract to briefly mention the key arithmetic property established and include a small illustrative example of the subsum polynomial and the reciprocal sum. revision: yes

Circularity Check

0 steps flagged

No significant circularity; new definition with independent proofs

full rationale

The paper introduces a fresh definition of the subsum polynomial sp(λ, x) = ∏(1 + x^λi) for a partition λ of n and then examines the sum of reciprocals of these polynomials over all partitions of n. It proceeds to prove arithmetic properties of related polynomials and establish connections to other combinatorial objects. No load-bearing step reduces by construction to its own inputs, self-citations, fitted parameters renamed as predictions, or smuggled ansatzes. The derivation begins from the explicit definition and derives new results, making the chain self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Based solely on the abstract, the central claim rests on the newly introduced definition of the subsum polynomial together with standard background facts about partitions and polynomials. No free parameters, additional axioms, or postulated entities are identifiable.

pith-pipeline@v0.9.0 · 5362 in / 1165 out tokens · 86169 ms · 2026-05-12T05:24:57.070068+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear
We introduce the subsum polynomial of a partition λ=(λ1,λ2,…,λk) defined by sp(λ,x)=∏i=1k(1+x^λi). We study the sum of reciprocals of sp(λ,x) over all partitions of n.
IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean absolute_floor_iff_bare_distinguishability unclear
Proposition 3.9. G(n,x), num(n,x), and den(n,x) are palindromic. den(n,x) and G(n,x) are unimodal.

Reference graph

Works this paper leans on

7 extracted references · 7 canonical work pages

[1]

G. E. Andrews,The Theory of Partitions, Cambridge Mathematical Library, Cambridge University Press, Cambridge, 1998. Reprint of the 1976 original

work page 1998
[2]

G. E. Andrews,A theorem on reciprocal polynomials with applications to permutations and compositions, Amer. Math. Monthly 82 (1975), no. 8, 830–833

work page 1975
[3]

Ballantine and M

C. Ballantine and M. Merca,Plane Partitions and DivisorsSymmetry 2024, 16, 5. https:// doi.org/10.3390/sym16010005

work page doi:10.3390/sym16010005 2024
[4]

E. B. Dynkin, Some properties of the weight system of a linear representation of a semisimple Lie group, Dokl. Akad. Nauk SSSR (NS) 71 (1950), 221-–224

work page 1950
[5]

(2026), The On-Line Encyclopedia of Integer Sequences, https://oeis.org/A000108

OEIS Foundation Inc. (2026), The On-Line Encyclopedia of Integer Sequences, https://oeis.org/A000108. Accessed [May 2026]

work page 2026
[6]

R. P. Stanley, F. Zanello,Unimodality of partitions with distinct parts inside Ferrers shapes, European J. Comb. 49 (2015), 194—202 http://dx.doi.org/10.1016/j.ejc.2015.03.007

work page doi:10.1016/j.ejc.2015.03.007 2015
[7]

Stanton,Unimodality and Young’s lattice, J

D. Stanton,Unimodality and Young’s lattice, J. Combin. Theory Ser. A 54 (1990), no. 1, 41–53. Department of Mathematics and Computer Science, College of the Holy Cross, Worcester, MA 01610, USA, Email address:cballant@holycross.edu Department of Mathematics and Statistics, Dalhousie University, Halifax, NS, B3H 4R2, Canada, Email address:george.beck@gmail...

work page 1990