Ramanujan's Lost Notebook Part I, Ch. 13: ch13Partitions
DefinitionRamanujanLostNotebook_PartI_ch13_ch13Partitionsnumber-theoryramanujan-lost-notebook
Multiplicity tuples (k_1,...,k_j) of partitions of j. The empty tuple for j=0 is included. Every multiplicity is bounded by j; the finite encoding loses no tuple.
Definition code
import Mathlib noncomputable section namespace RamanujanLostNotebook.PartI /-- Multiplicity tuples (k_1,...,k_j) of partitions of j. The empty tuple for j=0 is included. Every multiplicity is bounded by j; the finite encoding loses no tuple. -/ def ch13Partitions (j : ℕ) : Finset (Fin j → Fin (j + 1)) := Finset.univ.filter (fun t => (∑ i : Fin j, (i.val + 1) * (t i).val) = j) end RamanujanLostNotebook.PartI end
Source
G. E. Andrews and B. C. Berndt, Ramanujan's Lost Notebook, Part I, Springer 2005, Chapter 13.