Methodology for constructing and analyzing modular Nahm sums in number theory, including lift-dual operations and rank extensions
Scanned 9/11/2026
Install to Claude Code
npx -y skills add hiyenwong/ai_collection --skill modular-nahm-sums-construction --agent claude-codeInstalls into .claude/skills of the current project.
Are you the author of Modular Nahm Sums Construction?
Add the live security badge to your README — it updates automatically with every re-scan.
[](https://www.skillsdirectory.com/skills/hiyenwong-modular-nahm-sums-construction)More formats (shields.io, HTML) on the badges page.
---
name: modular-nahm-sums-construction
description: "Methodology for constructing and analyzing modular Nahm sums in number theory, including lift-dual operations and rank extensions"
category: number-theory
tags: ["number-theory", "modular-forms", "nahm-sums", "q-series", "modular-identities", "rank-construction"]
---
# Modular Nahm Sums Construction
## Description
Methodology for constructing new families of modular Nahm sums in ranks 3 and 4, using modifications of Zagier's rank 3 examples and the lift-dual operation on tadpole Nahm sums. Provides systematic techniques for generating modular identities and connecting number theory with q-series and modular forms.
## Activation Keywords
- Nahm sums
- modular forms
- q-series
- Zagier examples
- lift-dual operation
- tadpole Nahm sums
- modular identities
- 纳姆和
- 模形式
## Core Concepts
### Nahm Sums
A Nahm sum is a q-hypergeometric series of the form:
f(q) = Σ_{n∈Z≥0^r} q^(n^T·A·n/2 + b^T·n) / (q)_{n₁}...(q)_{n_r}
where A is a positive definite r×r matrix, b is a vector, and (q)_n = (1-q)(1-q²)...(1-q^n).
### Modularity
A Nahm sum is modular if f(q) transforms as a modular form (possibly with multiplier) under some congruence subgroup of SL(2,Z).
### Construction Techniques
1. **Zagier Modification**: Modify existing Zagier rank 3 examples to generate new modular families
2. **Lift-Dual Operation**: Apply lift-dual transformation to rank 3 tadpole sums to produce rank 4 families
3. **Rank Extension**: Systematically extend from rank r to rank r+1 while preserving modularity
## Usage Patterns
### Pattern 1: New Nahm Sum Construction
1. Start with known modular Nahm sum (matrix A, vector b)
2. Apply modification: adjust matrix entries or vector components
3. Verify modularity using Zagier's criteria
4. Document transformation properties and level
### Pattern 2: Lift-Dual Construction
1. Take rank 3 tadpole Nahm sum as base
2. Apply lift-dual operation (matrix extension + dual transformation)
3. Derive resulting rank 4 Nahm sum
4. Verify modular properties of the new sum
### Pattern 3: Modularity Verification
1. Check positive definiteness of matrix A
2. Compute modular transformation properties
3. Verify congruence subgroup level
4. Identify multiplier system
## Mathematical Framework
### Key Matrices
- **Tadpole matrices**: A_{ij} = min(i,j) for tadpole Dynkin diagram
- **Zagier matrices**: Specific positive definite matrices with modular Nahm sums
- **Lift-dual extension**: Block matrix construction preserving modularity
### Modular Forms Connection
- Nahm sums relate to characters of rational vertex operator algebras
- Connection with Rogers-Ramanujan type identities
- Relations to modular tensor categories
## Applications
- Number theory research
- Modular form construction
- q-series identities
- Vertex operator algebra characters
- Mathematical physics (conformal field theory)
## Error Handling
### Modularity Verification
- Not all Nahm sums are modular — must verify transformation properties
- Zagier's conjecture provides necessary and sufficient conditions
### Rank Extension
- Lift-dual operation may not preserve modularity for all inputs
- Must verify positive definiteness after extension
## References
- arXiv:2606.13590 — Some new modular Nahm sums of ranks 3 and 4
- Zagier — Original Nahm sum modularity conjecture
- Rogers-Ramanujan identities
- Vertex operator algebra literatureIs this your skill, or is something wrong with this listing? Request removal or report an issue. Author removals are honored within 72 hours.
No comments yet. Be the first to comment!