Pith. sign in

REVIEW 3 major objections 4 minor 2 cited by

Tight cylindric partitions

T0 review · 3 major / 4 minor · reviewed 2026-08-05 · deepseek-v4-flash

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

Pith's one-line read Two-rowed tight cylindric partitions have a closed-form bivariate generating function.

desk verdict A credible, genuinely new start on bivariate tight cylindric partitions; the two-row closed forms are likely right but the proof rests on q-difference relations that need to be written out. read the letter →

arxiv 2508.15113 v1 pith:KADIA4Y7 submitted 2025-08-20 math.CO math.QAmath.RT

Shashank Kanade , Matthew C. Russell This is my paper · ORCID
classification math.COmath.QAmath.RT MSC 05A1711P8417B67
keywords tightcylindricpartitionsbivariategeneratingfunctionslargestpartstatisticq-hypergeometricmultisumsfunctionalequationscoloredcrystalbasespartitionidentities
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

This paper initiates the study of bivariate generating functions for tight cylindric partitions—cylindric partitions whose abacus yokes are packed as closely as possible, the objects that match affine Lie algebra characters directly. The main result, Theorem 13, is a closed form: for every level ℓ and every 0 ≤ b ≤ ⌊ℓ/2⌋, the generating function that tracks both the total weight and the largest part of two-rowed tight cylindric partitions of profile (ℓ−b,b) is a finite ℓ-fold basic hypergeometric multisum. The proof passes through new functional equations, called the diamond relations, that generalize the classical functional equations for cylindric partitions to the tight setting, and solves them with a family of multisums S(t;v;z,q). The same functional equations and a direct bijection connect these partitions to a class of colored partitions whose generating function was previously known from crystal theory, giving an independent route to that identity. The closed form matters because it is the first exact bivariate description of tight cylindric partitions with the largest-part statistic, a statistic tied to the representation theory behind the objects.

What carries the argument

The workhorse is the family of multisums S(t; v; z,q) together with the two q-difference relations, rel_j(t;v) and rel_0(t;v), that they satisfy. The first relation follows by multiplying each summand by (1−q^{n_j}) and shifting the summation index; the second by subtracting adjacent t-slices. The proof of Theorem 14 is a carefully chosen linear combination of these relations, with telescoping cancellations, that collapses exactly to the diamond relations; since the multisums share the same initial conditions as the tight cylindric partition generating functions, uniqueness identifies them.

What would settle it

Compute the coefficient of z^M q^N on both sides of Theorem 13 for, say, ℓ=3, b=1 and N ≤ 12 by enumerating the finitely many two-rowed tight cylindric partitions of profile (2,1); if any coefficient disagrees with the multisum, the closed form fails, and the same check can be run independently by substituting the proposed multisums into the diamond relations to high order in q.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is that two-rowed tight cylindric partitions are governed exactly by a finite multisum with no free parameters. For level ℓ and 0 ≤ b ≤ ⌊ℓ/2⌋, let T(ℓ−b,b)(z,q) be the generating function for tight cylindric partitions of profile (ℓ−b,b), with z marking the largest part and q the sum of entries. Theorem 13 states T(ℓ−b,b)(z,q)=T(b,ℓ−b)(z,q) equals Σ_{n1,...,nℓ≥0} z^{N1} q^{(N1^2+...+Nℓ^2)/2 + (n1+n3+...+n_{2b-1})/2 + (N_{2b+1}+...+Nℓ)/2} (q)_{N1} / ((zq;q)_{N1}(q)_{n1}...(q)_{nℓ}), where N_j=n_j+...+n_ℓ. The proof route is Theorem 14: each R_i(z,q)=S(0;−η_i;z,q) solves the diamond relations—the two-row case of the paper's new functional equatio

Load-bearing premise

The proof leans on two families of q-difference identities, rel_j(t;v) and rel_0(t;v), that are declared to be obtained routinely or easily without derivation; if any sign or exponent in them is off, the multisum verification of the diamond relations fails.

Editorial extensions

If this is right

  • At z=1, the formula reproduces the two known families of finite sums that had appeared in earlier partition identities for odd and even ℓ, giving product forms for the univariate generating function.
  • Together with the new functional equations, the closed form yields an alternate proof of the sum-to-product identity for the colored partitions of the same profile, since both families satisfy the same recurrences with the same initial data; the direct bijection makes the match combinatorial.
  • For arbitrary r rows at level 1, the paper obtains an explicit single-sum formula for the bivariate generating function in terms of the largest part.
  • For r ≥ 2, the new functional equations provide an analog of the classical recurrences, so future bivariate studies of tight cylindric partitions can start from a recurrence rather than from scratch.

Reading between the lines

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

  • If Theorem 13 is correct, the largest-part statistic likely has a representation-theoretic reading as a degree or energy grading on the crystal of the level-ℓ affine sl_2 module, and the multisum should be matchable to known crystal-energy generating functions.
  • The bijection to colored partitions suggests transferring statistics: the color sequence of the colored partition may translate to a statistic on tight cylindric partitions, such as yoke-shape counts, yielding a refinement of Theorem 13 with more than two variables.
  • The linear-combination-of-q-difference-relations strategy used for two rows is a plausible template for three-row tight cylindric partitions, a case the paper leaves open; the same rel_j machinery may produce conjectural multisums.
  • The paper reports computer experiments suggesting strict unimodality of the z-coefficients for fixed q-degree; proving this could follow from the bijection with colored partitions or from an sl_2 action, and low-level cases are now testable directly from Theorem 13.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 4 minor

Summary. The paper initiates the study of bivariate generating functions for tight cylindric partitions, refining the usual cylindric-partition framework with the maximum-part statistic. For general r-rowed tight cylindric partitions of profile c, the authors prove analogs of the Corteel–Welsh functional equations (Theorem 10). In the two-rowed case they specialize these to the 'diamond relations' (Proposition 11) and to a single recurrence without inclusion–exclusion (Proposition 12). The main result, Theorem 13/14, gives a closed multisum formula for the bivariate generating function T_{(ℓ-b,b)}(z,q) for 0 ≤ b ≤ ⌊ℓ/2⌋, and the authors show that this multisum satisfies the diamond relations. They also give a bijection between two-rowed tight cylindric partitions of profile (ℓ-a,a) and Dousse–Hardiman–Konan partitions of class DHK_{a,ℓ}, sending the maximum part to the number of nonzero parts, and use this to give an alternate proof of the DHK product identity. A level-one result for r rows is included as Proposition 17.

Significance. If the main identity is correct, this is the first closed form for two-rowed tight cylindric partitions with the maximum-part statistic, and it connects these objects to known Andrews and Kim–Yee sums and to Dousse–Hardiman–Konan partitions. The paper contains several genuinely useful ingredients: explicit functional equations, a product formula, a concrete bijection, and a new level-one formula. The approach is largely self-contained and the combinatorial recurrences are clearly motivated. However, the proof of the central theorem currently rests on q-difference relations that are only sketched and on an unstated uniqueness assertion for the recurrence system; these gaps make the main result conditional in the present write-up.

major comments (3)
  1. [§4.1, rel_j and rel_0] The proof of Theorem 14 is entirely carried out through the relations rel_j(t;v) and rel_0(t;v). rel_j is justified only by 'obtained routinely' and rel_0 by 'obtained easily'. Every cancellation in Proposition 15 and in equations (11)–(14) depends on the exact signs and shifts in these relations, for instance the term z q^{v_j+j} S(t+1; v+Δ_j) in rel_j. A sign or exponent error would propagate through the linear combinations and invalidate the verification that S(0; -η_i) satisfies the diamond relations. Please provide a complete derivation of both relations, or at minimum spell out the index shift for rel_j, including the treatment of the n_j = 0 boundary terms.
  2. [§4.2, proof of Theorem 14] The proof shows that the multisum S(0; -η_i) satisfies the diamond relations and the initial conditions R_i(0,q)=R_i(z,0)=1. It is never stated or proved that these recurrences together with the initial conditions have a unique formal power series solution. Since the actual tight-cylindric generating functions T_{(ℓ-b,b)} also satisfy the same recurrences by Proposition 11, the equality T_{(ℓ-b,b)} = S(0; -η_b) requires a uniqueness lemma. Such a lemma is standard—one may induct on q-degree, using that R_i(zq^k) shifts the q-degree when k>0—but it is not present. The same missing uniqueness is asserted in §6.2, where Propositions 12 and 21 are said to define the same unique solution.
  3. [Theorem 14, ℓ = 1 edge case] Theorem 13 states ℓ ≥ 1, but the system displayed in Theorem 14 is not defined for ℓ = 1: the odd case refers to R_{(ℓ-3)/2} = R_{-1}, and the initial relation refers to R_1, while the allowed range is 0 ≤ i ≤ ⌊ℓ/2⌋ = 0. Please either restrict Theorem 14 (and Proposition 11, if needed) to ℓ ≥ 2 and treat ℓ = 1 separately, or define the missing boundary values appropriately. This is a small but genuine gap in a theorem statement that claims to cover all ℓ ≥ 1.
minor comments (4)
  1. [Theorem 13] The two displayed multisum expressions are asserted to be equal. The equality follows from n_j = N_j - N_{j+1}, but the index manipulation is not shown; a sentence indicating this would improve readability.
  2. [Example 5] The abacus diagram in Example 5 is difficult to parse as printed. Adding explicit labels for the zeroth yoke and the first few yokes, or drawing the yokes as arcs, would make the example much easier to follow.
  3. [§6.3, bijection] The claim that the number of vacancies between two adjacent yokes of shapes α and β is |α−β| is cited to [9, Eq. (31)]. Since this equality is the heart of the bijection with DHK partitions, a short derivation or a more precise quotation of the relevant statement would be helpful.
  4. [Notation in Theorem 14] The q argument is suppressed in R_i(z) throughout Theorem 14. It is clear from context, but explicitly writing R_i(z,q) in the display would avoid ambiguity, especially because the recurrences involve R_i(zq) and R_i(zq^2).

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the central multisum is verified against independently derived diamond relations; the DHK connection compares two separately derived recurrence systems.

full rationale

The paper's central claim (Theorem 13) is proved by showing that the S-multisum satisfies the same two-rowed 'diamond relations' (Proposition 11) that the tight cylindric partition generating functions satisfy by the combinatorial argument in Theorem 10/Proposition 11. The q-difference relations rel_j and rel_0 in Section 4.1 are stated without derivation ('This can be obtained routinely...', 'obtained easily...'), but they are identities of the S-summand obtained by index shifts, not relations imported from the target T. The verification in Proposition 15 and equations (11)-(14) is then a direct linear combination of those relations. No fitted parameter is renamed as a prediction, and no self-citation is load-bearing: [9] and [16] are external background for the univariate product formula, and [12] is a non-essential contextual citation. The DHK connection (Section 6) compares two independently derived recurrence systems (Propositions 12 and 21) and then invokes an external product formula for T; this is not circular. The main genuine gap is that Theorem 14 only says 'A solution ... is given by...' and never proves uniqueness of the recurrence system with Ri(0,q)=Ri(z,0)=1, so the final inference T = S is incomplete as written. This is a missing proof step and a correctness risk, not a circular reduction: the recurrences themselves are obtained combinatorially, not defined in terms of the multisum.

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

No free parameters were fitted; the paper is purely combinatorial. The axioms are mostly cited background results: the abacus tightness theorem and the univariate product formula. The genuinely unproved input is the set of q-difference relations (rel_j, rel_0) in Section 4.1, which the proof of Theorem 14 uses as black-box identities. No new entities are postulated.

assumptions (3)
  • domain assumption A 2-rowed cylindric partition is tight iff the corresponding 2-string abacus is tight (Theorem 7, cited from Foda-Welsh [9, Sec. 4.7, 4.8, App. C]).
    Used in Section 2, Example 8, and the DHK bijection in Section 6.3 to translate tightness into abacus data; taken from the literature, not reproved.
  • domain assumption The univariate product formula for tight cylindric partitions (Theorem 4, first equality cited from [9, Eq. (33)], product evaluation standard), used to identify the DHK product.
    Used in Section 6.2 to turn the functional-equation match into the DHK product identity. Not reproved.
  • ad hoc to paper The q-difference relations rel_j and rel_0 (Section 4.1) are stated as 'obtained routinely' and 'obtained easily' but are not derived in the paper.
    The proof of Theorem 14 is a linear combination of these relations; no derivation is provided, so they function as unproved lemmas specific to this paper.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Tight cylindric partitions." pith.science (2026). https://pith.science/paper/KADIA4Y7

@misc{pith2026250815113,
  author       = {Pith},
  title        = {Pith review of: Tight cylindric partitions},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/KADIA4Y7}},
  note         = {Machine review of arXiv:2508.15113}
}
abstract

In this note, we initiate the study of generating functions for tight cylindric partitions. For general (i.e., $r$-rowed for $r\geq 2$) tight cylindric partitions, we provide analogs of the Corteel--Welsh functional equations. We prove closed forms for the bivariate generating functions for 2-rowed tight cylindric partitions. We also show that these partitions are in bijection with a class of partitions studied by Dousse, Hardiman, and Konan.

Figures

Figures reproduced from arXiv: 2508.15113 by the authors.

Figure 1
Figure 1. An example of a cylindric partition π is depicted. The partition to the right of dotted line is πe. The circled parts in rows marked J are added to πe to get π. The partition to the right of solid line, i.e., removing all first parts from π, is π ′ . The subset of Iπ of rows where π ′ has the part m is marked Iπ′ . Parts marked < are strictly less than m. One can now modify this picture and check that if J ⊆ Iπ′ , t… view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. $A_1^{(1)}$-Grounded partitions at levels $1$ and $2$, Part I: bijections

    math.CO 2025-08 conditional novelty 8.0 of 10

    Grounded partitions at level 2 of type A_1^(1) are in size- and length-preserving bijection with odd overpartitions (ground b) and with partitions whose even parts are distinct (ground a).

  2. On a pair of three-colored (mod 10) partition identities

    math.CO 2025-09 conditional novelty 6.0 of 10

    Two new partition identities are proved: three-colored partitions with certain forbidden differences have generating functions equal to a distinct-parts factor times the first or second Rogers-Ramanujan product.

Reference graph

Works this paper leans on

21 extracted references · 21 canonical work pages · cited by 2 Pith papers

  1. [1]

    G. E. Andrews. Parity in partition identities. Ramanujan J., 23(1-3):45–90, 2010

    work page 2010

  2. [2]

    A. Borodin. Periodic Schur process and cylindric partitions. Duke Math. J. , 140(3):391–468, 2007. TIGHT CYLINDRIC PARTITIONS 15

    work page 2007

  3. [3]

    Chern, Z

    S. Chern, Z. Li, D. Stanton, T. Xue, and A. J. Yee. The Ariki-Koike algebras and Rogers- Ramanujan type partitions. J. Algebraic Combin. , 60(2):491–540, 2024

    work page 2024

  4. [4]

    Corteel, J

    S. Corteel, J. Dousse, and A. K. Uncu. Cylindric partitions and some new A2 Rogers- Ramanujan identities. Proc. Amer. Math. Soc. , 150(2):481–497, 2022

    work page 2022

  5. [5]

    Corteel and T

    S. Corteel and T. Welsh. The A2 Rogers-Ramanujan identities revisited. Ann. Comb., 23(3- 4):683–694, 2019

    work page 2019

  6. [6]

    E. Date, M. Jimbo, A. Kuniba, T. Miwa, and M. Okado. Paths, Maya diagrams and represen- tations of bsl(r, C). In Integrable systems in quantum field theory and statistical mechanics , volume 19 of Adv. Stud. Pure Math. , pages 149–191. Academic Press, Boston, MA, 1989

    work page 1989

  7. [7]

    Dousse, L

    J. Dousse, L. Hardiman, and I. Konan. Partition identities from higher level crystals of A(1) 1 . Proc. Amer. Math. Soc. , 153(4):1363–1382, 2025

    work page 2025

  8. [8]

    O. Foda, B. Leclerc, M. Okado, J.-Y. Thibon, and T. A. Welsh. Branching functions of A(1) n−1 and Jantzen-Seitz problem for Ariki-Koike algebras. Adv. Math., 141(2):322–365, 1999

    work page 1999

Show all 21 references
  1. [9]

    Foda and T

    O. Foda and T. A. Welsh. Cylindric partitions, Wr characters and the Andrews-Gordon- Bressoud identities. J. Phys. A , 49(16):164004, 37, 2016

    2016

  2. [10]

    I. M. Gessel and C. Krattenthaler. Cylindric partitions. Trans. Amer. Math. Soc., 349(2):429– 479, 1997

    1997

  3. [11]

    Jimbo, K

    M. Jimbo, K. C. Misra, T. Miwa, and M. Okado. Combinatorics of representations of Uq(bsl(n)) at q = 0. Comm. Math. Phys. , 136(3):543–566, 1991

    1991

  4. [12]

    Kanade and M

    S. Kanade and M. C. Russell. Completing the A 2 Andrews-Schilling-Warnaar identities. Int. Math. Res. Not. IMRN , (20):17100–17155, 2023

    2023

  5. [13]

    Kim and A

    S. Kim and A. J. Yee. The Rogers-Ramanujan-Gordon identities, the generalized G¨ ollnitz- Gordon identities, and parity questions. J. Combin. Theory Ser. A , 120(5):1038–1056, 2013

    2013

  6. [14]

    Kur¸ sung¨ oz

    K. Kur¸ sung¨ oz. Parity considerations in Andrews-Gordon identities.European J. Combin. , 31(3):976–1000, 2010

    2010

  7. [15]

    Kur¸ sung¨ oz and H.¨Omr¨ uuzun Seyrek

    K. Kur¸ sung¨ oz and H.¨Omr¨ uuzun Seyrek. A decomposition of cylindric partitions and cylindric partitions into distinct parts. European J. Combin., 130:Paper No. 104219, 40, 2025

    2025

  8. [16]

    Lepowsky

    J. Lepowsky. Application of the numerator formula to k-rowed plane partitions. Adv. in Math. , 35(2):179–194, 1980

    1980

  9. [17]

    Mc Laughlin, A

    J. Mc Laughlin, A. V. Sills, and P. Zimmer. Rogers-Ramanujan-Slater type identities. Electron. J. Combin. , DS15:59, 2008

    2008

  10. [18]

    J. R. Stembridge. Hall-Littlewood functions, plane partitions, and the Rogers-Ramanujan identities. Trans. Amer. Math. Soc. , 319(2):469–498, 1990

    1990

  11. [19]

    P. Tingley. Three combinatorial models for bsln crystals, with applications to cylindric plane partitions. Int. Math. Res. Not. IMRN , (2):Art. ID rnm143, 40, 2008

    2008

  12. [20]

    Tsuchioka

    S. Tsuchioka. A proof of the second Rogers-Ramanujan identity via Kleshchev multipartitions. Proc. Japan Acad. Ser. A Math. Sci. , 99(3):23–26, 2023

    2023

  13. [21]

    S. O. Warnaar. The A 2 Andrews-Gordon identities and cylindric partitions. Trans. Amer. Math. Soc. Ser. B , 10:715–765, 2023. Department of Mathematics, University of Denver, Denver, CO 80208 Email address : shashank.kanade@du.edu Department of Statistics, Texas A&M University...

    2023

Pith tools

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