The bottom-dissection reformulation of the Andrews–Gordon companion conjecture

About 5 years old · traced to

Let r≥2r\geq 2 and 1≤i≤r1\leq i\leq r. Let Br,i\mathcal{B}_{r,i} be the set of partitions whose (i−1)(i-1)-bottom dissection consists of i−1i-1 successive bottom squares followed by bottom rectangles, with all bottom rectangles above Br−1′B'_{r-1} empty. Let Br,i(n)B_{r,i}(n) be the number of partitions of nn in Br,i\mathcal{B}_{r,i}, and let Ar,i(n)A_{r,i}(n) and Er,i(n)E_{r,i}(n) denote the associated quantities from the paper. Bottom-dissection reformulation. For every nonnegative integer nn,

Br,i(n)=Ar,i(n)=Er,i(n).B_{r,i}(n)=A_{r,i}(n)=E_{r,i}(n).

The reformulation uses the equality Br,i=Cr,i\mathcal{B}_{r,i}=\mathcal{C}_{r,i} to express the same companion identities through successive bottom squares and rectangles. The supplied source does not establish whether the conjecture has been resolved.

References

Primary source

Pooneh Afsharijoo, Jehanne Dousse, Frédéric Jouhet and Hussein Mourtada, “New companions to the Andrews–Gordon identities motivated by commutative algebra”, arXiv:2104.09422 (2023).

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.