Formulæ for the number of partitions of \(n\) into at most \(m\) parts (using the quasi-polynomial ansatz) (Q424536): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
(10 intermediate revisions by 9 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.aam.2011.12.003 / rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: MathOverflow / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Maple / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3101730344 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1108.4391 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Identities in combinatorics. III: Further aspects of ordered set sorting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partitions: At the interface of \(q\)-series and modular forms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3246489 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5298139 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the expansion of the partition functions in a series / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Über Partitionen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partitions into \(k\) parts / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.AAM.2011.12.003 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 17:11, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Formulæ for the number of partitions of \(n\) into at most \(m\) parts (using the quasi-polynomial ansatz) |
scientific article |
Statements
Formulæ for the number of partitions of \(n\) into at most \(m\) parts (using the quasi-polynomial ansatz) (English)
0 references
1 June 2012
0 references
integer partitions
0 references
Maple package
0 references