The average signature of graph links
Abstract
We compute the average Tristram---Levine signature of any graph link with positive weights in a three sphere, generalizing the results of Kirby and Melvin. The main tools are the Neumann's algorithm for computing the equivariant signatures of graph links and the Reciprocity Law for Dedekind sums.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.