From recursions to asymptotics: Durfee and dilogarithmic deductions (Q2483911): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:47, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | From recursions to asymptotics: Durfee and dilogarithmic deductions |
scientific article |
Statements
From recursions to asymptotics: Durfee and dilogarithmic deductions (English)
0 references
1 August 2005
0 references
From the author's abstract: We consider two-dimensional arrays \(p(n,k)\) which count a family of partitions of \(n\) by a second parameter \(k\), usually the number of parts.
0 references
two-dimensions arrays
0 references
partitions
0 references
