Computation of q-partial fractions
From MaRDI portal
Computation of \(q\)-partial fractions
Recommendations
- The Rademacher conjecture and q-partial fractions
- A q-analog of the Weideman's formula
- On the partial fraction decomposition of the restricted partition generating function
- Partial fraction decomposition of some meromorphic functions
- \(h\)-adic polynomials and partial fraction decomposition of proper rational functions over \(\mathbb{R}\) or \(\mathbb{C}\)
Cited in
(12)- A generalization of partition identities for first differences of partitions of \(n\) into at most \(m\) parts
- An algebraic approach to \(q\)-partial fractions and Sylvester denumerants
- Fractal form of the partition functions \(p(n)\)
- A fast algorithm for computing the number of magic series
- The combinatorics of MacMahon's partial fractions
- Quasipolynomials and maximal coefficients of Gaussian polynomials
- A q-analog of the Weideman's formula
- Formulæ for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz)
- Log-concavity of the restricted partition function \(p_{\mathcal{A}}(n, k)\) and the new Bessenrodt-Ono type inequality
- On restricted partitions of numbers
- Partitions with Durfee triangles of fixed size
- The Rademacher conjecture and q-partial fractions
This page was built for publication: Computation of \(q\)-partial fractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5298139)