Andrews's modified partition identity for A4,3,3(n)A_{4,3,3}(n)

About 22 years old · traced to

Let A4,3,3(n)A_{4,3,3}(n) be the partition-counting function defined by the conditions for even λ=4\lambda=4, and let B4,3,3(n)B_{4,3,3}(n) count partitions satisfying the stated difference and multiplicity conditions, where fjf_j denotes the number of appearances of jj. Define B4,3,30(n)B^0_{4,3,3}(n) by imposing in addition

f5j+2+f5j+3≤1(j≥0),f_{5j+2}+f_{5j+3}\leq 1\quad (j\geq 0), f5j+4+f5j+6≤1(j≥0),f_{5j+4}+f_{5j+6}\leq 1\quad (j\geq 0), f5j−1+f5j+f5j+5+f5j+6≤3(j≥1).f_{5j-1}+f_{5j}+f_{5j+5}+f_{5j+6}\leq 3\quad (j\geq 1).

Andrews's conjecture. For every positive integer nn,

A4,3,3(n)=B4,3,30(n).A_{4,3,3}(n)=B^0_{4,3,3}(n).

The conjecture gives a modification of the partition conditions in Andrews's theorem that admits the case k<λk<\lambda; the source presents it as a conjecture attributed to Andrews. The paper's title indicates that this particular identity is subsequently proved by an analytic argument.

References

Primary source

Padmavathamma, B. M. Chandrashekara, R. Raghavendra and C. Krattenthaler, “Analytic proof of the partition identity A_5,3,3(n) = B^0_5,3,3(n)”, arXiv:math/0403121 (2004).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.