A note on the number of \(t\)-core partitions (Q1912642): Difference between revisions

A partition of a positive integer \(n\) is said to be a \(t\)-core partition of \(n\) if its Ferrers diagram has no hook number divisible by \(t\). Let \(c_t(n)\) denote the number of \(t\)-core partitions of \(n\). It has been conjectured that \(c_t(n)> 0\) for \(t\geq 4\) and \(n\geq 1\). In a previous paper [Acta Arith. 66, 221-228 (1994; Zbl 0793.11027)] the author proved the conjecture for the cases when \(n\) is sufficiently large or \(t\) \((\geq 4)\) is divisible by 2, 5, 7, 9, or 11. In the paper under review the author proves that if \(k\geq 2\) then \(c_{3k} (n)> 0\) for all \(n\).