Pages that link to "Item:Q424536"

The following pages link to Formulæ for the number of partitions of \(n\) into at most \(m\) parts (using the quasi-polynomial ansatz) (Q424536):

Displayed 13 items.

• PARTITIONS (Q18731) ‎ (← links)
• A formula for the partition function that ``counts'' (Q295286) ‎ (← links)
• An explicit form of the polynomial part of a restricted partition function (Q515992) ‎ (← links)
• Coefficients of Gaussian polynomials modulo \(N\) (Q782934) ‎ (← links)
• Partitions and Sylvester waves (Q1623884) ‎ (← links)
• On the restricted partition function (Q1633155) ‎ (← links)
• Universal formulas for the number of partitions (Q1787168) ‎ (← links)
• A generalization of partition identities for first differences of partitions of \(n\) into at most \(m\) parts (Q2048548) ‎ (← links)
• An algebraic approach to \(q\)-partial fractions and Sylvester denumerants (Q2084541) ‎ (← links)
• A fast algorithm for computing the number of magic series (Q2155555) ‎ (← links)
• Quasipolynomials and maximal coefficients of Gaussian polynomials (Q2299138) ‎ (← links)
• Polyhedral geometry, supercranks, and combinatorial witnesses of congruences for partitions into three parts (Q2400980) ‎ (← links)
• Log-concavity of the restricted partition function \(p_{\mathcal{A}}(n, k)\) and the new Bessenrodt-Ono type inequality (Q6156545) ‎ (← links)