Partition analysis, modular functions, and computer algebra

DOI10.1007/978-3-319-24298-9_21MaRDI QIDQ2957193zbMATH OpenOpenAlexFDO

Authors Peter Paule, Silviu Radu

Publication date 25 January 2017

Published in Recent Trends in Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-24298-9_21

zbMATH Keywords

computer algebradiscrete geometrymodular functionsMacMahon's partition analysisRamanujan congruencessymbolic combinatoricslinear systems of Diophantine inequalities and equations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of simplicial complexes (05E45) Combinatorial inequalities (05A20) Diophantine inequalities (11D75) Elementary theory of partitions (11P81) Partitions; congruences and congruential restrictions (11P83)

Recommendations

• Rogers-Ramanujan functions, modular functions, and computer algebra
• Computing the integer partition function
• Recent work on the partition function
• Partitions: At the interface of \(q\)-series and modular forms
• Addition and counting: The arithmetic of partitions

Cited in

(19)

• Infinite product formulae for generating functions for sequences of squares
• Finding modular functions for Ramanujan-type identities
• Euler's partition function in terms of 2-adic valuation
• Congruences modulo powers of 5 for Ramanujan's \(\phi\) function
• Invariants, Kronecker products, and combinatorics of some remarkable Diophantine systems
• Dancing samba with Ramanujan partition congruences
• Congruence properties modulo powers of \(2\) for \(4\)-regular partitions
• Proofs of some conjectural Hurwitz type identities for three squares due to Cooper and Hirschhorn
• MacMahon's partition analysis. XV: Parity
• An algorithm to prove algebraic relations involving eta quotients
• On the computation of identities relating partition numbers in arithmetic progressions with eta quotients: an implementation of Radu's algorithm
• Rogers-Ramanujan functions, modular functions, and computer algebra
• MacMahon's partition analysis XIII: Schmidt type partitions and modular forms
• 4-regular partitions and the pod function
• Partitions: At the interface of \(q\)-series and modular forms
• Computer-assisted proofs of congruences for multipartitions and divisor function convolutions, based on methods of differential algebra
• MacMahon's partition analysis. XIV: Partitions with \(n\) copies of \(n\)
• The number of partitions of a set and superelliptic Diophantine equations
• A CONJECTURE OF MERCA ON CONGRUENCES MODULO POWERS OF 2 FOR PARTITIONS INTO DISTINCT PARTS

This page was built for publication: Partition analysis, modular functions, and computer algebra

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