Two-Modular Diagrams: A Survey
- Two-Modular Diagrams are versatile diagrammatic constructs that range from paired Dynkin diagrams for generalized Nahm sums to two-loop Feynman graphs, each encoding modular data.
- In the context of generalized Nahm sums, pairing Dynkin diagrams produces explicit modular functions tied to rational 2d CFT characters, thus extending classical ADE conjectures.
- In RNA combinatorics and partition theory, two-modular diagrams provide precise combinatorial models that underpin enumeration formulas and bijections, such as those in the KOH identity.
Two-Modular Diagrams is not a single standardized term across mathematics and mathematical physics. In the literature represented here, it denotes, or is naturally used to denote, several distinct diagrammatic constructions: pairs of Dynkin diagrams producing modular generalized Nahm sums and characters of rational $2$d CFTs; $2$-loop modular Feynman diagrams on a torus; modular $2$-noncrossing or diagrams in RNA-related combinatorics; and modified $2$-modular diagrams of partitions related to Zeilberger’s KOH identity. In adjacent settings, the expression is also used interpretively for diagrammatic structures attached to modular representations, to degree-$2$ level-$2$ Siegel modular forms, and to prime-$2$ topological modular forms (Sun et al., 1 Apr 2026, D'Hoker et al., 2015, Reidys et al., 2010, Huang et al., 2010, Zanello, 2011, Gekas, 2016, Cléry et al., 13 May 2026, Lawson et al., 2012).
1. Terminological scope and recurring structure
A recurring pattern is that the qualifier “two” refers to different structural parameters in different subfields. In the theory of generalized Nahm sums it refers to a pair of Dynkin diagrams. In genus-one superstring perturbation theory it refers to two loops. In RNA-related combinatorics it may refer either to noncrossing diagrams or to $2$0 modularity. In the partition-theoretic setting it refers to $2$1 labels in a modified modular diagram. In the Siegel-modular and chromatic-homotopy settings it refers to degree $2$2, level $2$3 or prime $2$4, height $2$5, respectively (Sun et al., 1 Apr 2026, D'Hoker et al., 2015, Reidys et al., 2010, Huang et al., 2010, Zanello, 2011, Cléry et al., 13 May 2026, Lawson et al., 2012).
This suggests that the expression is context-dependent rather than a universal term of art. The common feature is the use of diagrammatic data to package modular, homological, or representation-theoretic structure. The ambient subject therefore determines what the diagrams are, what “modular” means, and what kind of invariants are extracted from them.
A second recurring feature is that these constructions are not merely pictorial. In each setting, the diagrammatic language controls precise algebraic data: Kronecker products of Cartan matrices and root-length matrices in generalized Nahm sums, lattice sums and Laplace equations in torus amplitudes, generating functions and asymptotics in RNA combinatorics, or covariants and theta-theoretic constructions in genus-$2$6 modular forms (Sun et al., 1 Apr 2026, D'Hoker et al., 2015, Reidys et al., 2010, Cléry et al., 13 May 2026).
2. Pairs of Dynkin diagrams and modular generalized Nahm sums
In "Dynkin diagrams, generalized Nahm sums and 2d CFTs" (Sun et al., 1 Apr 2026), the phrase “two-modular diagram” does not appear verbatim, but the paper explicitly proposes the interpretation that a two-modular diagram is a pair $2$7 of Dynkin diagrams such that the associated generalized Nahm sum
$2$8
is a modular function. The construction starts from Cartan matrices $2$9, $2$0, root-length matrices $2$1, $2$2, and the Kronecker products
$2$3
The generalized Nahm sum attached to $2$4 is then
$2$5
where the diagonal entries $2$6 come from $2$7. The proposed central charge in the $2$8 framework is
$2$9
The paper’s central conjecture extends the older 0 folklore conjecture to all finite-type Dynkin diagrams of type 1: for every pair 2, the quadruple
3
is modular, meaning that the generalized Nahm sum is a modular function of weight 4. A duality
5
specializes, when 6, to the symmetry between 7 and 8. In this sense the modular structure is genuinely attached to the pair.
The CFT-theoretic significance is that modular Nahm sums with non-negative integer Fourier coefficients are natural candidates for characters of rational 9d CFTs. The paper identifies many such sums with known characters. Two infinite families are especially explicit. For $2$0, one has
$2$1
and the generalized Nahm sum is identified with the supersymmetric Virasoro minimal models $2$2. For $2$3, one has
$2$4
and the associated CFT is $2$5. In the latter case the paper gives the explicit character identity
$2$6
The paper also notes that for rank $2$7 generalized Nahm sums arising from Conjecture $2$8, there are $2$9 cases and $2$0 are now known to be modular (Sun et al., 1 Apr 2026).
3. Two-loop modular diagrams on a torus
In "Proof of a modular relation between 1-, 2- and 3-loop Feynman diagrams on a torus" (D'Hoker et al., 2015), “two-modular diagrams” refers naturally to $2$1-loop modular diagrams/functions on the torus. These arise in the low-energy expansion of the genus-one Type II four-graviton amplitude, where the coefficient functions are non-holomorphic modular functions of the torus modulus $2$2. The $2$3-loop objects are the triple-sum modular functions
$2$4
defined by momentum-conserving lattice sums with internal weight
$2$5
In this setting the relevant diagrams are vacuum Feynman diagrams on the torus with two independent momentum cycles. The associated modular function is
$2$6
with $2$7. These functions are modular invariant but non-holomorphic, since the dependence on $2$8 enters through $2$9 and $2$0.
The paper emphasizes the Laplace structure of these $2$1-loop functions. Two low-weight identities are
$2$2
Thus the $2$3-loop objects are not Laplace eigenfunctions; instead their Laplacians are inhomogeneous combinations of $2$4-loop Eisenstein series. At weight $2$5, the central theorem states
$2$6
equivalently
$2$7
This shows that the $2$8-loop modular function $2$9 is not independent: it is determined by the $2$0-loop function $2$1 and $2$2-loop Eisenstein series.
The role of two-modular diagrams is therefore structural. They are the essential intermediate depth in the hierarchy of modular graph functions appearing in genus-one string amplitudes. The paper further proves three new holomorphic modular identities in the course of establishing the weight-$2$3 relation, with $2$4 forced by modularity and cusp behavior (D'Hoker et al., 2015).
4. Combinatorial meanings: modular $2$5-noncrossing diagrams and $2$6 modular diagrams
In RNA-related combinatorics there are two distinct but nearby meanings. In "Modular, $2$7-noncrossing diagrams" (Reidys et al., 2010), a modular $2$8-noncrossing diagram is a diagram over $2$9 in which no two arcs cross, every arc has length at least 0, and there are no isolated arcs. For 1, “2-noncrossing” means precisely noncrossing. The paper states that RNA secondary structures are exactly modular, 3-noncrossing diagrams, so in this usage two-modular diagrams are classical RNA secondary structures with minimum arc length 4 and no isolated base pairs.
The enumeration is explicit. If 5 denotes the number of modular 6-noncrossing diagrams over 7 vertices and
8
then
9
where 0 is the generating function of 1-noncrossing matchings without isolated vertices. The asymptotic formula is
2
The paper derives this via symbolic and analytic combinatorics, using shapes, inflation into stems and stacks, and a supercritical composition analysis (Reidys et al., 2010).
A different definition appears in "On the uniform generation of modular diagrams" (Huang et al., 2010). There a 3-modular diagram is one in which every arc is contained in a stack of length at least 4. Specializing to 5, a 6-modular diagram is a diagram in which every arc belongs to a stack of length at least 7. This is not the same as the “minimum arc length 8, no isolated arcs” condition above. The paper studies 9-noncrossing, $2$00-modular diagrams through a bijection with $2$01-tableaux and weighted cores. It proves an algorithmic uniform generation result: after $2$02 preprocessing time, $2$03-noncrossing, $2$04-modular diagrams can be generated in $2$05 time and space. For $2$06, the recursion for weighted-core counts specializes to
$2$07
and the generation theorem remains uniform (Huang et al., 2010).
A common misconception is to conflate these two notions. In one paper, “modular” means no isolated arcs and minimum arc length $2$08; in the other, $2$09 means every arc is contained in a stack of length at least $2$10. The objects are related by RNA-motivated combinatorics, but the definitions are not equivalent (Reidys et al., 2010, Huang et al., 2010).
5. $2$11-modular diagrams of partitions and the KOH identity
In "The KOH terms and classes of unimodal $2$12-modular diagrams" (Zanello, 2011), the relevant objects are modified modular diagrams of partitions. An $2$13-modular diagram of length $2$14 is the Ferrers diagram of a partition $2$15, with an added zeroth column of length $2$16, each cell labeled by an integer in $2$17, all cells except the rightmost in each row labeled $2$18, and labels weakly decreasing down columns. When $2$19, one obtains a $2$20-modular diagram: every cell is labeled $2$21 or $2$22, all non-rightmost cells are labeled $2$23, and rows of length $2$24 are allowed. The paper explicitly notes that $2$25-modular diagrams are naturally in bijection with MacMahon diagrams, with label $2$26 corresponding to an unmarked cell and label $2$27 corresponding to a marked cell.
The paper uses these diagrams to interpret the summands in Zeilberger’s KOH identity, a reformulation of O’Hara’s proof of the unimodality of the Gaussian polynomial. For $2$28, the KOH term is
$2$29
The paper constructs two natural classes of modular diagrams whose generating functions are these KOH terms. One class uses $2$30-modular diagrams; the other uses $2$31-modular diagrams built from data $2$32.
The $2$33 specialization is especially concrete. For $2$34 with $2$35, the paper states that
$2$36
is the generating function of MacMahon $2$37-modular) diagrams inside an $2$38 rectangle satisfying four conditions: there are $2$39 unmarked rows and $2$40 marked rows; the sums of lengths of marked and unmarked rows obey explicit upper bounds; all unmarked rows have length at least $2$41; and within marked rows, and within unmarked rows, the difference between longest and shortest is at most $2$42 (Zanello, 2011).
In this branch of the subject, two-modular diagrams are therefore not graph diagrams but labeled Ferrers-type diagrams. Their significance is that they provide a combinatorial model for symmetric unimodal polynomials arising from Gaussian coefficients and the KOH decomposition.
6. Related level-two and prime-two diagrammatics
Several further papers use the phrase only interpretively, but they reinforce the same pattern of context dependence. In "A new type of diagrams for modules" (Gekas, 2016), the phrase “Two-Modular Diagrams” does not appear verbatim. The paper instead introduces virtual categories and central tuned diagrams for finitely generated modules, with specific applications suggested to the modular representations of finite groups of Lie type. The relation is indirect: if “two-modular” is read as characteristic $2$43 or as a comparison between two modular settings, then central tuned diagrams provide a refined diagrammatic language for radical and socle series, virtual simples, and $2$44-classes.
In "Tautological modular forms of level two and degree two" (Cléry et al., 13 May 2026), the phrase is again interpretive rather than standard terminology. The paper studies vector-valued Siegel modular forms of degree $2$45 and level $2$46 via divisors on the projectivized Hodge bundle. The central diagrammatic structures are the moduli inclusions
$2$47
the six divisors $2$48 coming from Weierstrass points, and the maps
$2$49
The paper shows how all vector-valued Siegel modular forms of level $2$50 and degree $2$51 can be constructed from tautological modular forms, theta gradients, and invariant theory. In this setting “two-modular” means degree-$2$52, level-$2$53, rather than any combinatorial graph notion.
In "Strictly commutative realizations of diagrams over the Steenrod algebra and topological modular forms at the prime $2$54" (Lawson et al., 2012), the explanatory discussion presents a structured picture of “two-modular diagrams” at prime $2$55 and chromatic height $2$56. The central diagram is the strictly commutative square of $2$57-ring spectra
$2$58
lifting the classical diagram of modules over the mod-$2$59 Steenrod algebra
$2$60
Here the “two” refers simultaneously to the prime and to chromatic height. The paper proves that the generalized $2$61-like spectrum $2$62 fits into this strictly commutative diagram and satisfies
$2$63
Across these related usages, the same label points to different kinds of structure: characteristic $2$64, degree $2$65, level $2$66, height $2$67, or a pair of inputs. This suggests that any serious use of the expression requires immediate disambiguation by field, notation, and source (Gekas, 2016, Cléry et al., 13 May 2026, Lawson et al., 2012).