Polyak-Viro type formula for the Milnor triple linking number of link diagrams with multiple-crossings
Yusaku Okuhara, Keiichi Sakai
TL;DR
This work develops a Polyak-Viro type formula for the Milnor triple linking number $_{123}$ that applies to diagrams with triple or higher crossings, extending the Brooks–Komendarczyk localization program. By explicitly computing the configuration-space integrals associated to the Y-graph and by using arrow/Gauss diagrams, the authors derive a concrete combinatorial formula for $$ in terms of diagram pairings $igraket{oldsymbol{}_k,G_D}$ and their primed counterparts, paralleling the Casson invariant's formula. The paper demonstrates the generalized Polyak-type formulas for both the Casson invariant and the Milnor triple linking number in the presence of multiple crossings, showing how triple-point configurations contribute via explicit half-sum terms while certain contributions vanish by symmetry. The approach provides a direct, computable link between diagrammatic data and topological invariants, with potential utility for Vassiliev theory and higher-dimensional embedding invariants.
Abstract
We obtain Polyak-Viro type formula for the Milnor triple linking number that can be applied to diagrams with triple or more multiple-crossings. The proof is based on the idea of Brooks and Komendarczyk, but is different from theirs in that we explicitly compute the value of configuration space integral associated to the "Y-graph," and is applicable to the original Brooks-Komendarczyk formula for the Casson knot invariant. The results for the Milnor triple linking number were firstly obtained in the first author's master thesis, in which the proof follows the same way as that in the paper of Brooks-Komendarczyk (2024).
