Wheel Classes in Kontsevich Graph Complex and Merkulov's Low-Valence Conjecture

Wheel Classes, Kontsevich Graph Complex, and Merkulov's Low-Valence Conjecture

Introduction

The Kontsevich graph complex $GC_d$ is a pivotal object in deformation quantization, moduli space computations, and the intricate relationship between graph homology and $\mathfrak{grt}_1$, the Grothendieck–Teichmüller Lie algebra. Merkulov conjectured that every homology class in $GC_d$ admits a representative comprised solely of graphs whose vertices are 3- or 4-valent. This low-valence conjecture, motivated by both combinatorial and homotopical considerations, had previously only been verified computationally up to genus ten and in particular cohomological degrees.

The work "Wheel Classes in Kontsevich Graph Complex and Merkulov's Low-Valence Conjecture" (2604.11327) presents a concrete, combinatorial realization of wheel class representatives with valence bounded above by four, for all wheel graphs $W_{2m+1}$. This resolves the conjecture for this distinguished set of classes that correspond, via Willwacher’s identification, to the foundational generators of $\mathfrak{grt}_1$ in degree-zero $GC_2$-cohomology.

Structure of the Graph Complex and the Low-Valence Subcomplex

The complex $GC_d$ is constructed from connected graphs admitting vertices of valence at least three, equipped with the edge-contraction differential. The Merkulov subcomplex, $GC_d^{\mathrm{Me}}$, is generated by linear combinations of graphs with all vertex valences in $\{3, 4\}$. The inclusion $i: GC_d^{\mathrm{Me}} \to GC_d$ is conjectured to be a quasi-isomorphism—a statement equivalent to the existence of low-valence representatives for every homology class.

Crucially, in even dimensions, orientations become sign data, but vertex labels and edge directions are irrelevant up to sign.

Problem: Wheel Classes and Their Valence Structure

Wheel graphs $\mathfrak{grt}_1$0, with a central $\mathfrak{grt}_1$1-valent hub vertex and a surrounding cycle, are canonical cocycles. However, for $\mathfrak{grt}_1$2, the hub vertex exceeds the permitted valence, and the wheel class falls outside $\mathfrak{grt}_1$3. The main challenge is to construct explicit chain-level representatives for wheel classes using only 3- and 4-valent vertices, and to exhibit an explicit homology between $\mathfrak{grt}_1$4 and a linear combination of low-valence graphs.

Construction: Families $\mathfrak{grt}_1$5 and $\mathfrak{grt}_1$6

The proof centers around two explicit recursively defined families of graphs:

• $\mathfrak{grt}_1$7: A family, indexed by binary sequences $\mathfrak{grt}_1$8 (sequences of 'left'/'right' choices), comprised of low-valence graphs. For $\mathfrak{grt}_1$9, $GC_d$0.
• $GC_d$1: Auxiliary chains whose differentials decompose the wheel graph's high-valence hub via edge contractions.

The construction proceeds iteratively, starting from a "seed" graph and performing, for each position in $GC_d$2, a local replacement increasing valence minimally. Upon completion, $GC_d$3 and $GC_d$4 are well-structured and, for maximal $GC_d$5, strictly 3- and 4-valent.

A key combinatorial property is the pairing between sequences and their reversed analogues, demonstrating symmetry and eventual pairwise cancellation of extraneous higher-valence terms in sums over $GC_d$6 as needed for homological purposes.

Differential Analysis and Main Theorem

The differential of $GC_d$7, considered over all sequences of a given length $GC_d$8, satisfies a telescopic property:

$GC_d$9

This recursion provides an inductive resolution of the wheel graph as a sum of low-valence graphs plus the boundary of an explicit chain comprised of the $W_{2m+1}$0. Summing up to $W_{2m+1}$1 produces the desired formula:

$W_{2m+1}$2

where $W_{2m+1}$3 is a sum over $W_{2m+1}$4 for all sequences of bounded length, weighted appropriately. Every summand on the right is a 3- and 4-valent graph.

Numerical Consequence

For $W_{2m+1}$5, wheel classes are homologous to explicit linear combinations—$W_{2m+1}$6 terms—of 3- and 4-valent graphs. This provides a highly constructive answer, directly usable in explicit (e.g., computer-assisted) computations.

Implications

Theoretical Implications

The results affirm the low-valence conjecture for an explicit, infinite, and algebraically significant family: the wheel classes. These classes generate the free Lie algebra aspects of $W_{2m+1}$7, which is central in the deformation quantization program and arises in broad mathematical physics and algebraic geometry contexts. The explicit chain-level representatives clarify the combinatorial structure underlying these deep algebraic objects.

Furthermore, this approach demonstrates the utility of recursive, orientation-aware combinatorics in homological algebra, suggesting that similar strategies may yield full resolution of the low-valence conjecture for all of $W_{2m+1}$8, or for other classes of interest. It also enhances understanding of the skeleton of the Grothendieck–Teichmüller group in graph-homological terms.

Practical Implications

Providing an explicit homology between higher-valence and low-valence representatives enables improved implementations for homology computations in graph complexes, particularly those arising in quantum field theory and deformation quantization. For computational approaches, low-valence graphs are preferable due to their tractable combinatorics and reduced automorphism groups.

Speculation on Future Developments

Given the explicit, recursive structure now available for wheel classes, a next logical step is extending these constructions to other generators and known cocycles in $W_{2m+1}$9. The approach may also inspire modifications or alternative filtrations of the graph complex, potentially yielding new quasi-isomorphisms or reduction algorithms. Resolving the conjecture in its entirety would have significant ramifications for the algebraic structure of graph complexes and their applications in topological and quantum theories.

Conclusion

This work establishes that the wheel classes in the even Kontsevich graph complex are homologous to explicit linear combinations of 3- and 4-valent graphs, thereby verifying Merkulov’s low-valence conjecture in this central case (2604.11327). The construction leverages novel combinatorial families and explicit differentials, providing practical tools and theoretical insights pertinent to deformation quantization, the structure of the Grothendieck–Teichmüller Lie algebra, and the broader study of graph homology.