Recurrence conjecture for (s,s+r)(s,s+r)-core partitions with dd-distinct parts

At least 7 years old · documented by

For integers ss, rr, and dd with 1≤r≤d1\le r\le d, let Nd,r(s)N_{d,r}(s) denote the number of (s,s+r)(s,s+r)-core partitions with dd-distinct parts. Recurrence conjecture. The values of Nd,r(s)N_{d,r}(s) are characterized by

Nd,r(s)=sfor 1≤s≤d,N_{d,r}(s)=s\quad\text{for }1\le s\le d, Nd,r(d+1)=d+r,N_{d,r}(d+1)=d+r,

and

Nd,r(s)=Nd,r(s−1)+Nd,r(s−(d+1))N_{d,r}(s)=N_{d,r}(s-1)+N_{d,r}(s-(d+1))

for s≥d+2s\ge d+2. This conjecture is based on experimental evidence and was verified in the paper for s<10s<10 by listing all relevant partitions; a proof of the stated recurrence and initial values remains open.

References

Primary source

Murat Sahin, “Core Partitions With d-Distinct Parts”, arXiv:1803.01603 (2018).

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.