Intent
Identify new modular Nahm sums of ranks 3 and 4 and justify their modularity.
Announcement tweet + AI — This report summarizes the paper’s scientific intent: finding new modular Nahm sums, proving modularity through Rogers–Ramanujan type identities, and extending the known landscape of Nahm’s problem in ranks 3 and 4.
Nahm’s problem asks which Nahm sums are modular. This paper discovers six new families of modular Nahm sums in ranks 3 and 4. The authors obtain rank three examples by modifying Zagier’s rank three examples, derive several rank four families through lift-dual operations, and find another rank four family by the constant term method.
To prove modularity, the paper establishes Rogers–Ramanujan type identities that express the Nahm sums as infinite products. Those product forms make the modular structure visible.
Identify new modular Nahm sums of ranks 3 and 4 and justify their modularity.
Rogers–Ramanujan type identities, Bailey pairs, constant term methods, and lift-dual constructions.
Six new modular families, product identities, modular triples, and open directions for dual triples.
Study Nahm’s problem, inspect the identities, compare rank 3 and rank 4 constructions, and track future modular examples.
Nahm’s problem asks for modular triples: data defining Nahm sums whose resulting q-series are modular. Rank one is classified, but higher ranks are much more complicated.
This paper adds six new modular families in ranks 3 and 4. Some arise by modifying known rank three examples; others come from lift-dual operations applied to known tadpole Nahm sums. Another family is obtained using the constant term method.
The companion notebook can serve as a reader-facing entry point: it should introduce Nahm sums, modular triples, product identities, and the paper’s proof strategy without attempting to reproduce every identity in full detail.
The notebook should generate an Engineering Statement, introduce the paper’s vocabulary, explore toy q-series or partition examples, and identify next steps for following Nahm’s problem.