Partition analysis, modular functions, and computer algebra

DOI10.1007/978-3-319-24298-9_21zbMath1354.05010OpenAlexW2474190587MaRDI QIDQ2957193

Paule, Peter, 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

modular functionscomputer algebradiscrete geometryMacMahon'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) Partitions; congruences and congruential restrictions (11P83) Combinatorial inequalities (05A20) Elementary theory of partitions (11P81) Diophantine inequalities (11D75) Combinatorial aspects of simplicial complexes (05E45)

Related Items (9)

An algorithm to prove algebraic relations involving eta quotients ⋮ Dancing samba with Ramanujan partition congruences ⋮ 4-regular partitions and the pod function ⋮ MacMahon's partition analysis. XIV: Partitions with \(n\) copies of \(n\) ⋮ A CONJECTURE OF MERCA ON CONGRUENCES MODULO POWERS OF 2 FOR PARTITIONS INTO DISTINCT PARTS ⋮ On the computation of identities relating partition numbers in arithmetic progressions with eta quotients: an implementation of Radu's algorithm ⋮ Finding modular functions for Ramanujan-type identities ⋮ MacMahon's partition analysis XIII: Schmidt type partitions and modular forms ⋮ Infinite product formulae for generating functions for sequences of squares

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