Pith. sign in

REVIEW 1 major objections 3 minor 17 references

A refined view of a curious identity for partitions into odd parts with designated summands

T0 review · 1 major / 3 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A two-variable refinement of the PDO(2n) identity matches every odd-part partition with a pair of smaller partitions.

desk verdict A genuine two-parameter refinement of the PDO identity with a clean Chebyshev proof; the Section 3 variable rename needs one standard justification step, but the result is sound. read the letter →

arxiv 2505.21111 v1 pith:GPAVD25J submitted 2025-05-27 math.CO cs.DM

Shishuo Fu , James Sellers This is my paper
classification math.COcs.DM MSC 11P8405A1705A1533B10
keywords partitionswithdesignatedsummandsoddpartspartitionidentityChebyshevpolynomials2-dissectiongeneratingfunctionsstatisticsq-series
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper refines the known identity $\mathrm{PDO}(2n)=\sum_{k=0}^n \mathrm{PDO}(k)\mathrm{PDO}(n-k)$, where $\mathrm{PDO}(n)$ counts partitions into odd parts with exactly one designated occurrence of each part, by adding two statistics: the number of distinct part sizes and the number of part sizes occurring an odd number of times. The central result is a generating-function equality: the coefficient of $q^{2n}$ in $P_1(x,y,q)$ equals the coefficient of $q^n$ in $P_2(x,y,q)$, which encodes a refined statement about PDO partitions paired with ordered pairs of PDO partitions. The proof runs through a symmetric Chebyshev identity rather than the elementary 2-dissection used previously, and the $y=0$ case admits an explicit reversible map. The reframing matters because it exposes the hidden structure behind the convolution and suggests a route to a fully combinatorial proof.

What carries the argument

The load-bearing object is the huffing (2-dissection) operator $H$ and the $q$-series $G(x,q)=1+2\sum_{n\ge 1} T_{2n}(x/2)q^{n^2}$ formed from Chebyshev polynomials of the first kind. The central identity is $H(G(x,q)G(y,q))=G(u,q)G(v,q)$ with $u+v=xy$ and $uv=x^2+y^2-4$; it is proved by setting $x=2\cos\alpha$, $y=2\cos\beta$, which forces $u=2\cos(\alpha+\beta)$, $v=2\cos(\alpha-\beta)$, and reducing the statement to two trigonometric identities that follow from the cosine sum-product law and two bijections on index pairs. Product factorizations of $P_1$ and $P_2$ convert this $q$-series identity into the coefficient equality of Theorem 3.4.

What would settle it

Use a computer algebra system to expand $P_1(x,y,q)$ and $P_2(x,y,q)$ through $q^{20}$ and compare coefficients in $\mathbb{Q}[x,y]$; if $[q^{2n}]P_1$ differs from $[q^n]P_2$ for any $n\le 10$ as polynomials, the theorem is false. A sharper test is to verify the identity after substituting the relations (3.8) into both sides and reducing modulo the ideal they generate.

Watch

Extended reading notes

Core claim

Theorem 3.4 asserts that for every $n\ge 0$ and $k\ge j\ge 0$, the number of PDO partitions of weight $2n$ with $k$ distinct part sizes, $j$ of which occur an odd number of times, equals the number of ordered pairs of PDO partitions of combined weight $n$ with $k$ designated parts and exactly $j/2$ shared part sizes. Equivalently, $[q^{2n}]P_1(x,y,q)=[q^n]P_2(x,y,q)$, where $P_1$ tracks $\ell_d$ and $\ell_o^d$ on single partitions and $P_2$ tracks $\ell_d(\mu)+\ell_d(\nu)$ and $2\ell_r(\mu,\nu)$ on pairs. The proof factorizes both generating functions (Theorem 3.3) and then shows the coefficient identity follows from the symmetric Chebyshev identity $H(G(x,q)G(y,q))=G(u,q)G(v,q)$ under $u+v=xy$, $uv=x^2+y^2-4$. Specializing $y=1$ recovers the earlier one-parameter refinement; specializing $x=y=1$ recovers the original convolution identity.

Load-bearing premise

The proof assumes that the change of variables in (3.10) is reversible as an identity of generating functions in $x$ and $y$, but the paper does not spell out a formal argument that the renamed variables exist and the equality holds for all parameter values.

Editorial extensions

If this is right

  • Setting $y=1$ in the refined identity recovers the one-parameter refinement (Theorem 1.3) that tracks only the number of distinct part sizes; setting $x=y=1$ recovers $\mathrm{PDO}(2n)=\sum_{k=0}^n \mathrm{PDO}(k)\mathrm{PDO}(n-k)$.
  • The $y=0$ specialization gives an explicit reversible bijection (Section 5) between PDO partitions of $2n$ in which every part size has even multiplicity and pairs of PDO partitions with disjoint part-size sets.
  • The equivalence between Theorem 3.4 and the Chebyshev identity means any future bijective proof must account for the same pairing that the trigonometric identities encode.
  • The same method may yield an analogous refinement for unrestricted designated-summand partitions $\mathrm{PD}(n)$, using the companion series the paper identifies in its closing remarks.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural extension is to turn the $y=0$ bijection into a full sign-reversing involution for arbitrary $y$; the part-distribution rule used at $y=0$ suggests how odd-multiplicity parts could be split between the two sides.
  • The change-of-variables step (3.10) is the least explicit link in the chain; a formal proof that (3.6) holds as an identity in $\mathbb{Q}[x,y][[q]]$ after adjoining the relations (3.8) would close the gap the paper leaves open.
  • Because both $P_1$ and $P_2$ factor into products over odd parts, the refining identity is likely equivalent to a finite set of polynomial identities in $x$ and $y$ at each $q$-degree; a computer check to $q^{20}$ with symbolic $x,y$ would certify (or refute) the theorem independent of the Chebyshev route.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 3 minor

Summary. The paper refines the known identity PDO(2n)=Σ_{k=0}^n PDO(k)PDO(n-k) for partitions into odd parts with designated summands. It introduces two two-variable generating functions P1(x,y,q) and P2(x,y,q) that track, respectively, the number of distinct part sizes and the number of distinct part sizes occurring an odd number of times, and the corresponding data for pairs of PDO partitions. The main theorem, Theorem 3.4, asserts the coefficient identity [q^{2n}]P1(x,y,q)=[q^n]P2(x,y,q). The proof proceeds via product formulas (3.4)-(3.5), a symmetric Chebyshev identity (Theorem 3.2) proven by 2-dissection and cosine addition, and an algebraic renaming of variables in Section 3. A bijective proof of the special case y=0 is given in Section 5.

Significance. If the main theorem stands, it is a genuine refinement of a curious identity in the theory of partitions with designated summands, and it ties the subject to MacMahon's sums-of-divisors and Chebyshev polynomials in a natural way. The paper is carefully written and contains several fully worked combinatorial proofs: the product formulas in Theorem 3.3 are derived directly by counting occurrences of each odd part, and the Chebyshev identities in Lemma 4.2 are proven by explicit manipulation of the cosine addition formula with the help of two bijections. The authors also provide a transparent bijective proof for the y=0 specialization, which is a useful contribution in its own right. The only serious gap is the algebraic passage from Theorem 3.2 to Theorem 3.4, which is standard and fixable.

major comments (1)
  1. [Section 3, equations (3.8)-(3.10)] The deduction of (3.6) from (3.9) is missing a polynomial-continuation argument. Equation (3.9) is proved only for quadruples (w,z,u,v) satisfying the relation (3.8), and the renaming (3.10) sets xy = w^2+z^2-4 and 2x = (w^2-2)(z^2-2)+4. For arbitrary x,y these equations are not solvable by rational w,z,u,v; they generally require adjoining square roots. Therefore equality on the image of the parameter map does not by itself imply equality for all x,y. The sentence 'since every step is reversible' is not a substitute for this, because reversibility only holds on that image. The authors should add the standard Zariski-density/polynomial-continuation step: for each fixed q-degree, the difference of the two sides is a polynomial in x,y, and since the image of (w,z) contains a Zariski-open subset in the (x,y)-plane (the Jacobian is generically nonzero), equality there forces equality everywhere. This argument is necessary for the proof of Theorem 3.4 and should be supplied explicitly.
minor comments (3)
  1. [Theorem 3.4] The statement should specify that the equality is for even j (or that the right-hand side is zero when j is odd), since P2(x,y,q) contains only even powers of y and the phrase 'j/2 shared part sizes' is otherwise undefined for odd j.
  2. [Introduction, first paragraph] The sentence 'we wish you consider' should read 'we wish to consider'.
  3. [Section 3, equation (3.9)] The derivation of (3.9) from (3.3) via Lemma 3.1 is stated without intermediate algebra; spelling out the eta-quotient manipulation would make the proof easier to verify, especially because the displayed exponents on the Pochhammer symbols are hard to parse.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the main identity is proved from independent Chebyshev/cosine manipulations; the only questionable step is a variable-renaming justification gap, not an assumption of the target.

full rationale

Walked the derivation chain. Theorem 3.4 (the coefficient equality [q^{2n}]P1(x,y,q)=[q^n]P2(x,y,q)) is reduced to Theorem 3.2 via the Andrews–Rose identity (2.4), the 2-dissections in Theorems 2.3–2.4, and the product factorizations in Theorem 3.3. None of these inputs assumes (3.6); they are separately established facts. The change of variables (3.10) is under-justified as a formal-power-series substitution: the paper does not show that for arbitrary x,y there exist w,z,u,v satisfying both (3.8) and (3.10), and the phrase 'since every step is reversible' is not a substitute for a Zariski-density or formal-identity argument. But this is a rigor gap in the implication (3.9)⇒(3.6), not circularity: the equality (3.6) is not used to define P1 or P2, and no fitted parameter is renamed as a prediction. The only self-citation, [13] (Hirschhorn–Sellers), supplies an independent 2-dissection of the overpartition generating function, not the target identity, so it is not load-bearing circular support. The central claim therefore has independent content and no circular step is present.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The central claim is built from standard q-series manipulations plus two external theorems (Andrews-Rose identity, Hirschhorn-Sellers 2-dissection). No numerical data are fitted, and no new entities are introduced. The only non-elementary input is the Chebyshev-to-cosine reduction, which is proven inside the paper.

assumptions (4)
  • domain assumption The Andrews-Rose identity (2.4): (f_2/f_1^2) G(x,q) = sum_{k>=0} C_k(q) x^{2k}.
    Invoked in Section 2 to connect C_k(q) to the refined PDO generating function; this is a cited theorem, not re-proven in the paper.
  • domain assumption The 2-dissection of the overpartition generating function (Theorem 2.4, Hirschhorn-Sellers).
    Used in deriving Lemma 2.5 from (2.6); it is a published result cited to [13].
  • standard math Chebyshev polynomial addition formula T_{n+m}+T_{n-m}=2T_m T_n (Proposition 2.1).
    Used in Lemma 4.2 to reduce Chebyshev identities to cosine addition formulas; proven in text.
  • standard math Classical product representations of theta functions phi(q) and psi(q).
    Used in Section 2 to simplify eta quotients in (2.6); standard results cited to [12].

how reviews work

0 comments
Cite this review

Pith. "Pith review of A refined view of a curious identity for partitions into odd parts with designated summands." pith.science (2026). https://pith.science/paper/GPAVD25J

@misc{pith2026250521111,
  author       = {Pith},
  title        = {Pith review of: A refined view of a curious identity for partitions into odd parts with designated summands},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/GPAVD25J}},
  note         = {Machine review of arXiv:2505.21111}
}
abstract

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called partitions with designated summands. These are constructed by taking unrestricted integer partitions and designating exactly one of each occurrence of a part. In the same work, they also considered the restricted partitions with designated summands wherein all parts must be odd, and they denoted the corresponding function by $\mathrm{PDO}(n)$.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

17 extracted references · 17 canonical work pages

  1. [13]

    M. D. Hirschhorn and J. A. Sellers, Arithmetic relations for overpartitions,J. Combin. Math. Combin. Comput. 53 (2005), 65–73. 5

    work page 2005

  2. [1]

    Amdeberhan, K

    T. Amdeberhan, K. Ono and A. Singh, MacMahon’s sums-of-divisors and allied q-series, Adv. Math. 452 (2024), Paper No. 109820. 4

    work page 2024

  3. [2]

    G. E. Andrews, R. Askey, and R. Roy,Special functions, Encyclopedia Math. Appl.71, Cambridge University Press, Cambridge (1999). 3, 4

    work page 1999

  4. [3]

    G. E. Andrews and S. C. F. Rose, MacMahon’s sum-of-divisors functions, Chebyshev polynomials, and quasi- modular forms,J. Reine Angew. Math.676 (2013), 97–103. 3, 4, 15

    work page 2013

  5. [4]

    G. E. Andrews, R. P. Lewis, and J. Lovejoy, Partitions with designated summands,Acta Arith. 105 (2002), 51–66. 1, 2

    work page 2002

  6. [5]

    Bachmann, MacMahon’s sums-of-divisors and their connection to multiple Eisenstein series,Res

    H. Bachmann, MacMahon’s sums-of-divisors and their connection to multiple Eisenstein series,Res. Number Theory 10, no. 2 (2024), Paper No. 50. 4

    work page 2024

  7. [6]

    N. D. Baruah and K. K. Ojah, Partitions with designated summands in which all parts are odd,Integers 15 (2015), A9. 2

    work page 2015

  8. [7]

    W. Y. C. Chen, K. Q. Ji, H.-T. Jin, and E. Y. Y. Shen, On the number of partitions with designated summands, J. Number Theory133 (2013), 2929–2938. 2

    work page 2013

Show all 17 references
  1. [8]

    Chern and J

    S. Chern and J. A. Sellers, An infinite family of internal congruences modulo powers of 2 for partitions into odd parts with designated summands,Acta Arith. 215, no. 1 (2024), 43–64. 2

    2024

  2. [9]

    Corteel and J

    S. Corteel and J. Lovejoy, Overpartitions,Trans. Amer. Math. Soc.356 (2004), 1623–1635. 4

    2004

  3. [10]

    Hemanthkumar, H

    B. Hemanthkumar, H. S. Sumanth Bharadwaj and M. S. Mahadeva Naika, Congruences modulo small powers of 2 and 3 for partitions into odd designated summands,J. Integer Seq.20 (2017), no. 4, Article 17.4.3. 2

    2017

  4. [11]

    Herden, M

    D. Herden, M. R. Sepanski, J. Stanfill, C. C. Hammon, J. Henningsen, H. Ickes, and I. Ruiz, Partitions with designated summands not divisible by2ℓ, 2, and 3ℓ modulo 2, 4, and 3, Integers 23 (2023), A43. 2

    2023

  5. [12]

    M. D. Hirschhorn,The power ofq, a personal journey, Developments in Mathematics,49, Springer (2017). 5, 6

    2017

  6. [14]

    P. A. MacMahon, Divisors of numbers and their continuations in the theory of partitions, Reprinted: Percy A. MacMahon Collected Papers (G. Andrews, ed.), MIT Press, Cambridge, 1986, 305–341. 4, 15

    1986

  7. [15]

    Ono and A

    K. Ono and A. Singh, Remarks on MacMahon’sq-series, J. Combin. Theory Ser. A207 (2024), Paper No. 105921. 4

    2024

  8. [16]

    J. A. Sellers, New infinite families of congruences modulo powers of 2 for 2-regular partitions with designated summands, Integers 24 (2024), Article A16. 2 16 S. FU AND J. A. SELLERS

    2024

  9. [17]

    E. X. W. Xia, Arithmetic properties of partitions with designated summands,J. Number Theory159 (2016), 160–175. 2 (Shishuo Fu)College of Mathematics and Statistics, Chongqing University & Key Laboratory of Nonlinear Analysis and its Applications (Chongqing University), Ministr...

    2016

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.