Algorithms for finding and proving balanced Q^2 identities

zbMATH Open1145.11305MaRDI QIDQ5754477FDOQ5754477

Authors: Geoffrey Apel, Richard Blecksmith, John Brillhart 

Publication date: 22 August 2007

Full work available at URL: http://www.integers-ejcnt.org/vol7-2.html

Recommendations

• Proving balanced \(T^{2}\) and \(Q^{2}\) identities using modular forms
• Linear quintuple-product identities
• An algorithmic approach to discovering and proving \(q\)-series identities
• Short and easy computer proofs of the Rogers-Ramanujan identities and of identities of similar type
• Rogers-Ramanujan computer searches

zbMATH Keywords

invariantsearch algorithmtriple productquintuple productproof algorithm

Mathematics Subject Classification ID

Other combinatorial number theory (11B75)

Cited In (2)

• Proving balanced \(T^{2}\) and \(Q^{2}\) identities using modular forms
• An algorithmic approach to discovering and proving \(q\)-series identities

This page was built for publication: Algorithms for finding and proving balanced \(Q^2\) identities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5754477)