betaFeedback

WorksMathematics

A Lie-theoretic approach to the type Cn(1)C_n^{(1)} partitions of Capparelli, Meurman, Primc and Primc

Abstract

Capparelli, Meurman, Primc and Primc (CMPP) extended the frequency conditions in Gordon's partition theorem to paths in coloured arrays. Their conjecture for type Cn(1)C_n^{(1)} identifies the generating function of admissible arrays with a principally specialized character. We prove this conjecture for arbitrary boundary data by constructing an ordered Poincaré–Birkhoff–Witt (PBW) basis of the corresponding integrable highest weight module. A decomposition of the admissible arrays and a tensor product argument establish linear independence of the corresponding monomial vectors. To prove spanning, we use relations from annihilating fields and PBW bases for modules over finite Levi subalgebras. Principal specialization then yields the conjectured product. The same basis identifies the number of parts with the degree in the associated graded module for the PBW filtration.

Introduction

Gordon’s beautiful and deep partition theorem extends the combinatorial form of the Rogers–Ramanujan identities to arbitrary odd moduli 2k+32k+3 with k≥1k \ge1 [18]. Its frequency conditions are the starting point for the arrays studied here. A partition π=(π1,…,πℓ)\pi= (\pi_1,\ldots,\pi_\ell) is a finite weakly decreasing sequence of positive integers. Its size is ∣π∣=∑iπi|\pi| = \sum_i \pi_i, its length is ℓ(π)=ℓ\ell(\pi) = \ell, and the frequency fj(π)f_j(\pi) is the number of parts equal to jj. Thus ∣π∣=∑j≥1jfj(π)|\pi| = \sum_{j\ge1} j f_j(\pi) and ℓ(π)=∑j≥1fj(π)\ell(\pi) = \sum_{j\ge1} f_j(\pi). We include the empty partition, of size and length zero.

For integers k≥1k \ge1 and 0≤a≤k0 \le a \le k, let Gk,a\mathcal{G}_{k,a} consist of the partitions satisfying

f1(π)≤a,fj(π)+fj+1(π)≤k(j≥1).f_1(\pi) \le a,\qquad f_j(\pi) + f_{j+1}(\pi) \le k\quad(j \ge1).

Gordon’s theorem [18] states that, for every integer n≥0n \ge0, the number of partitions of nn in Gk,a\mathcal{G}_{k,a} equals the number of partitions of nn having no part congruent to 00 or ±(a+1)\pm(a+1) modulo 2k+32k+3. Consequently,

∑π∈Gk,aq∣π∣=(qa+1,q2k−a+2,q2k+3;q2k+3)∞(q;q)∞.(1)\sum_{\pi\in\mathcal{G}_{k,a}} q^{|\pi|} = \frac{(q^{a+1},q^{2k-a+2},q^{2k+3};q^{2k+3})_\infty}{(q;q)_\infty}. \tag*{(1)}

We use the standard notation [17 Chapter 1]

(u;q)m=∏j=0m−1(1−uqj),(u1,…,us;Q)∞=∏h=1s∏j≥0(1−uhQj),(u;q)_m=\prod_{j=0}^{m-1}(1-uq^j),\qquad(u_1,\ldots,u_s;Q)_\infty=\prod_{h=1}^{s}\prod_{j\ge0}(1-u_hQ^j),

with empty products equal to 1.

Andrews obtained the analytic multiple-series form of Gordon’s odd-modulus identities [3 Theorem 1], and Bressoud established the corresponding even-modulus identities [8]. These two families are collectively known as the Andrews–Gordon–Bressoud (AGB) identities. The Bailey lattice of Agarwal, Andrews and Bressoud [2] provides a systematic analytic approach to these identities. For background on partition identities and Bailey methods, see Andrews’ monograph [5] and Warnaar’s survey [32].

The multisums also admit several partition-theoretic interpretations. Andrews interpreted the odd-modulus sums using Durfee dissections into successive squares and rectangles [4]. Warnaar obtained polynomial refinements of the Andrews–Gordon identities and interpreted the associated qq-multinomial coefficients through Durfee dissections [31]. Dousse, Jouhet and Konan gave bijective interpretations of both the Andrews–Gordon and Bressoud multisums by constructing an explicit weight- and length-preserving bijection [11 Theorem 1.7 and Corollary 1.8]. A complementary commutative-algebraic approach was developed by Afsharijoo, Dousse, Jouhet and Mourtada, who used graded quotient rings, new Durfee dissections and qq-series identities to prove companion identities to the Andrews–Gordon identities [1].

Andrews, Schilling and Warnaar extended the Bailey lemma to type A2A_2 and used it to derive higher-rank analogues of the AGB identities [6]. Warnaar subsequently gave a Hall–Littlewood derivation of the A2A_2 Rogers–Ramanujan identities [33] and developed an A2A_2 Bailey tree yielding further A2(1)A_2^{(1)} analogues of the Andrews–Gordon identities [34].

In the extension of Gordon’s conditions proposed by Capparelli, Meurman, Primc and Primc (CMPP) [10], parts of the same size may have different colours. Parts of the same size and colour are indistinguishable. A coloured partition is therefore specified by its finitely supported frequencies fj(c)f_j^{(c)}, where fj(c)f_j^{(c)} counts the parts of size j>0j>0 and colour cc. For the type CC family studied here, the bound on fj+fj+1f_j+f_{j+1} becomes a bound on the sum of entries along a path. Section 7 discusses the related families of types AA and DD, and Appendices A and B recall the two arrays.

The type CC array has 2n+12n+1 rows [10]. We use the row colours and parity convention of Kanade, Russell, Tsuchioka and Warnaar (KRTW) [21 §4, model $(a')$]. For the array definition fix n≥1n\geq1, put N=2nN=2n, and let k=(k0,…,kn)∈Z≥0n+1\boldsymbol{k}=(k_0,\ldots,k_n)\in\mathbb{Z}_{\geq0}^{n+1} have total k=∑ikik=\sum_i k_i. Write fp(c)f_p^{(c)} for the frequency of a part of size p>0p>0 in colour c∈{1,…,N+1}c\in\{1,\ldots,N+1\}, where p+cp+c is even. Prescribe

f−1(2i+1)=ki(0≤i≤n),f0(2i)=0(1≤i≤n).f_{-1}^{(2i+1)}=k_i \quad(0\leq i\leq n),\qquad f_0^{(2i)}=0 \quad(1\leq i\leq n).

A full path takes one entry from each row, with successive part indices differing by 1. The type CC admissibility condition requires the sum of the entries on every such path to be at most kk.

For the proofs, it is convenient to reverse the row index without changing the part size. Set r=N+1−cr=N+1-c and define

Ω={(r,p)∈Z2:0≤r≤N, p≥−1, r+p≡1(mod2)},Ω+={(r,p)∈Ω:p>0}.(2)\Omega=\{(r,p)\in\mathbb{Z}^2:0\leq r\leq N,\ p\geq-1,\ r+p\equiv1\pmod2\},\qquad\Omega_+=\{(r,p)\in\Omega:p>0\}. \tag*{(2)}

There is a directed edge (r,p)⟶(r+1,p±1)(r,p)\longrightarrow(r+1,p\pm1) whenever both vertices belong to Ω\Omega. An array of frequencies of positive parts is a finitely supported function f:Ω+→Z≥0f:\Omega_+\to\mathbb{Z}_{\geq0}. Its augmentation FF is defined by

F(r,p)=f(r,p) (p>0),F(Bi)=ki,Bi=(N−2i,−1),F(r,0)=0.(3)F(r,p)=f(r,p)\ (p>0),\qquad F(B_i)=k_i,\quad B_i=(N-2i,-1),\qquad F(r,0)=0. \tag*{(3)}

Thus f(r,p)=fp(N+1−r)f(r,p)=f_p^{(N+1-r)}. Reversing a path reverses its list of rows and preserves the sum of its entries. The original CMPP conditions are therefore exactly

∑v∈PF(v)≤kfor every full path P⊂Ω.(4)\sum_{v\in P}F(v)\leq k\qquad\text{for every full path }P\subset\Omega. \tag*{(4)}

Write SkS_k for these admissible arrays, and put

∣f∣pr=∑(r,p)∈Ω+pf(r,p),ℓ(f)=∑(r,p)∈Ω+f(r,p),Zk(z,q)=∑f∈Skzℓ(f)q∣f∣pr.(5)|f|_{\mathrm{pr}}=\sum_{(r,p)\in\Omega_+}pf(r,p),\qquad\ell(f)=\sum_{(r,p)\in\Omega_+}f(r,p),\qquad Z_k(z,q)=\sum_{f\in S_k}z^{\ell(f)}q^{|f|_{\mathrm{pr}}}. \tag*{(5)}

The boundary entries are omitted from the statistics. For each dd, only finitely many arrays have size dd, so Zk(z,q)∈Z[z][[q]]Z_k(z,q)\in\mathbb{Z}[z][[q]].

For example, let n=2n=2 and k=e1=(0,1,0)\boldsymbol{k}=\boldsymbol{e}_1=(0,1,0), so that k=1k=1 and F(2,−1)=1F(2,-1)=1. The path in Figure 1 gives

The type C2 frequency array with reversed row order

Figure 1. The type C2C_2 frequency array with reversed row order.

f(0,1)+f(1,2)+f(2,1)+f(3,2)+f(4,1)≤1.f(0,1)+f(1,2)+f(2,1)+f(3,2)+f(4,1)\leq1.

The paths with column sequences (1,0,−1,0,1)(1,0,-1,0,1) and (−1,0,1,0,−1)(-1,0,1,0,-1) give, respectively,

f(0,1)+1+f(4,1)≤1,f(2,1)≤1.f(0,1)+1+f(4,1)\leq1,\qquad f(2,1)\leq1.

Thus f(0,1)=f(4,1)=0f(0,1)=f(4,1)=0, whereas f(2,1)f(2,1) may equal one.

Two vertices (r,p),(r′,p′)∈Ω(r,p),(r',p')\in\Omega lie on a common full path precisely when

∣p−p′∣≤∣r−r′∣.(6)|p-p'|\leq|r-r'|. \tag*{(6)}

Indeed, suppose r≤r′r\leq r' and put d=r′−rd=r'-r. A path joining the two vertices has dd steps, so ∣p′−p∣≤d|p'-p|\leq d is necessary. Conversely, grid parity makes u=(d+p′−p)/2u=(d+p'-p)/2 an integer, and the bound gives 0≤u≤d0\leq u\leq d. Starting at (r,p)(r,p), take uu steps that increase the column index and then d−ud-u steps that decrease it. This reaches (r′,p′)(r',p') without going below min⁡(p,p′)≥−1\min(p,p')\geq-1.

References

  1. [1]Afsharijoo, P., Dousse, J., Jouhet, F., Mourtada, H.: New companions to the Andrews–Gordon identities motivated by commutative algebra. Adv. Math. 417, article 108946 (2023)arxiv.org/abs/2104.09422
  2. [2]Agarwal, A. K., Andrews, G. E., Bressoud, D. M.: The Bailey lattice. J. Indian Math. Soc. (N.S.) 51, 57–73 (1987)
  3. [3]Andrews, G. E.: An analytic generalization of the Rogers–Ramanujan identities for odd moduli. Proc. Natl. Acad. Sci. U.S.A. 71, 4082–4085 (1974)pubmed.ncbi.nlm.nih.gov/16592187
  4. [4]Andrews, G. E.: Partitions and Durfee dissection. Amer. J. Math. 101, 735–742 (1979)DOI
  5. [5]Andrews, G. E.: The theory of partitions. Cambridge Mathematical Library, Cambridge University Press, Cambridge (1998)
  6. [6]Andrews, G. E., Schilling, A., Warnaar, S. O.: An A₂ Bailey lemma and Rogers–Ramanujan-type identities. J. Amer. Math. Soc. 12, 677–702 (1999)DOI
  7. [7]Bartlett, N., Warnaar, S. O.: Hall–Littlewood polynomials and characters of affine Lie algebras. Adv. Math. 285, 1066–1105 (2015)DOI
  8. [8]Bressoud, D. M.: An analytic generalization of the Rogers–Ramanujan identities with interpretation. Quart. J. Math. Oxford Ser. (2) 31, 385–399 (1980)DOI
  9. [9]Butorac, M., Kožić, S., Meurman, A., Primc, M.: Lepowsky’s and Wakimoto’s product formulas for the affine Lie algebras C_l^(1). J. Algebra 660, 147–189 (2024)
  10. [10]Capparelli, S., Meurman, A., Primc, A., Primc, M.: New partition identities from C_l^(1)-modules. Glas. Mat. Ser. III 57(77), 161–184 (2022)arxiv.org/abs/2106.06262
  11. [11]Dousse, J., Jouhet, F., Konan, I.: Combinatorial approach to Andrews–Gordon and Bressoud type identities. arXiv:2403.05414 (2024)arxiv.org/abs/2403.05414
  12. [12]Dousse, J., Konan, I.: Characters of level 1 standard modules of C_n^(1) as generating functions for generalised partitions. arXiv:2212.12728v1 (2022)arxiv.org/abs/2212.12728
  13. [13]Feigin, E.: The PBW filtration. Represent. Theory 13, 165–181 (2009)
  14. [14]Feigin, E., Fourier, G., Littlemann, P.: Favourable modules: filtrations, polytopes, Newton–Okounkov bodies and flat degenerations. Transform. Groups 22, 321–352 (2017)arxiv.org/abs/1306.1292
  15. [15]Feigin, E., Fourier, G., Littlemann, P.: PBW filtration and bases for irreducible modules in type A_n. Transform. Groups 16, 71–89 (2011)arxiv.org/abs/1002.0674
  16. [16]Feigin, E., Fourier, G., Littlelmann, P.: PBW filtration and bases for symplectic Lie algebras. Int. Math. Res. Not. IMRN, no. 24, 5760–5784 (2011)arxiv.org/abs/1010.2321
  17. [17]Gasper, G., Rahman, M.: Basic hypergeometric series. 2nd ed., Encyclopedia of Mathematics and its Applications 96, Cambridge University Press, Cambridge (2004)
  18. [18]Gordon, B.: A combinatorial generalization of the Rogers–Ramanujan identities. Amer. J. Math. 83, 393–399 (1961)DOI
  19. [19]Griffin, M. J., Ono, K., Warnaar, S. O.: A framework of Rogers–Ramanujan identities and their arithmetic properties. Duke Math. J. 165, 1475–1527 (2016)DOI
  20. [20]Kac, V. G.: Infinite-dimensional Lie algebras. 3rd ed., Cambridge University Press, Cambridge (1990)
  21. [21]Kanade, S., Russell, M. C., Tsuchioka, S., Warnaar, S. O.: Remarks on the conjectures of Capparelli, Meurman, Primc and Primc. Selecta Math. (N.S.) 32, article 100 (2026)DOI
  22. [22]Lepowsky, J.: Application of the numerator formula to k-rowed plane partitions. Adv. Math. 35, 179–194 (1980)DOI
  23. [23]Lepowsky, J., Milne, S.: Lie algebraic approaches to classical partition identities. Adv. Math. 29, 15–59 (1978)DOI
  24. [24]Lepowsky, J., Milne, S.: Lie algebras and classical partition identities. Proc. Natl. Acad. Sci. U.S.A. 75, 578–579 (1978)pubmed.ncbi.nlm.nih.gov/16592491
  25. [25]Macdonald, I. G.: Symmetric functions and Hall polynomials. 2nd ed., Oxford Mathematical Monographs, Clarendon Press, Oxford (1995)DOI
  26. [26]Meurman, A., Primc, M.: Annihilating fields of standard modules of sl̃(2, C) and combinatorial identities. Mem. Amer. Math. Soc. 137, no. 652 (1999)DOI
  27. [27]Primc, M.: New partition identities for odd w odd. Rad Hrvat. Akad. Znan. Umjet. Mat. Znan. 28(558), 49–56 (2024)arxiv.org/abs/2301.12484
  28. [28]Primc, M., Šikić, T.: Leading terms of relations for standard modules of the affine Lie algebras C_n^{(1)}. Ramanujan J. 48, 509–543 (2019)
  29. [29]Primc, M., Trupčević, G.: Linear independence for C_ℓ^{(1)} by using C_{2ℓ}^{(1)}. J. Algebra 661, 341–356 (2025)
  30. [30]Rains, E. M., Warnaar, S. O.: Bounded Littlewood identities. Mem. Amer. Math. Soc. 270, no. 1317 (2021)arxiv.org/abs/1506.02755
  31. [31]Warnaar, S. O.: The Andrews–Gordon identities and q-multinomial coefficients. Comm. Math. Phys. 184, 203–232 (1997)
  32. [32]Warnaar, S. O.: 50 years of Bailey’s lemma. In: Algebraic Combinatorics and Applications (A. Betten, A. Kohlert, R. Laue, A. Wassermann, eds.), pp. 333–347, Springer, Berlin (2001)arxiv.org/abs/0910.2062
  33. [33]Warnaar, S. O.: Hall–Littlewood functions and the A₂ Rogers–Ramanujan identities. Adv. Math. 200, 403–434 (2006)
  34. [34]Warnaar, S. O.: An A₂ Bailey tree and A₂^{(1)} Rogers–Ramanujan-type identities. J. Eur. Math. Soc., published online first (2025)

Paper details

vlnc:W_k6z6nnqr
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 5

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents