A note on the number of \(t\)-core partitions (Q1912642): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: \(E\Upsilon PHKA\)! \(\mathrm{num}=\Delta +\Delta +\Delta\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4040189 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Congruences for Partitions that are <i>p</i> -Cores / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cranks and t-cores / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4750720 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4310741 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the positivity of the number of t-core partitions / rank | |||
Normal rank |
Latest revision as of 12:05, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on the number of \(t\)-core partitions |
scientific article |
Statements
A note on the number of \(t\)-core partitions (English)
0 references
5 December 1996
0 references
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\).
0 references
Ferrers diagram
0 references
hook number
0 references
\(t\)-core partitions
0 references