The study about parity questions connected with classical partition identities of Euler, Rogers, Ramanujan and Gordon has been a rich topic for number theorists for many years. The author develops a computational method to produce similar partition identities. It is remarkable that this method constructs solutions to functional equations which are satisfied by the generating functions. The application presented in the paper is an all-moduli generalization of some results obtained by \textit{G. E. Andrews} [Ramanujan J. 23, No. 1--3, 45--90 (2010; Zbl 1226.11107)].
- Two problems of George Andrews on generating functions for partitions
- A generalisation of two partition theorems of Andrews
- \(q\)-functional equations and some partition identities
- scientific article; zbMATH DE number 7399930
- Some partition and analytical identities arising from the Alladi, Andrews, Gordon bijection
- A Combinatorial Generalization of the Rogers-Ramanujan Identities
- A generalization of the Rogers-Ramanujan identities for all moduli
- An Analytic Generalization of the Rogers-Ramanujan Identities for Odd Moduli
- An Analytic Proof of the Rogers-Ramanujan-Gordon Identities
- An overpartition analogue of Bressoud's theorem of Rogers-Ramanujan-Gordon type
- Gordon's theorem for overpartitions.
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- scientific article; zbMATH DE number 2117212 (Why is no real title available?)
- Parity considerations in Andrews-Gordon identities
- Parity in partition identities
- Partially ordered sets and the Rogers-Ramanujan identities
- Some continued fractions of the Rogers-Ramanujan type
- The Rogers-Ramanujan-Gordon identities, the generalized Göllnitz-Gordon identities, and parity questions
- The Rogers-Ramanujan-Gordon theorem for overpartitions
- Linked partition ideals and kanade-Russell conjectures
- Andrews-Gordon type series for Capparelli's and Göllnitz-Gordon identities
- Bressoud style identities for regular partitions and overpartitions
- Two problems of George Andrews on generating functions for partitions
- 2-colored Rogers-Ramanujan partition identities
- Generating new partition identities via a generalized continued fraction algorithm
- Modulo d extension of parity results in Rogers–Ramanujan–Gordon type overpartition identities
This page was built for publication: Andrews style partition identities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2254872)