2000 character limit reached
A representation of Milnor's triple linking number by chord diagrams and doodle invariants
Published 5 Oct 2025 in math.GT | (2510.04362v1)
Abstract: From the work of X. S. Lin and Z. Wang, it follows that degree two knot invariant admits a decomposition into the sum of a Gauss diagram count and a term involving Arnold invariants. In this paper we establish an analogous description for Milnor's triple linking number - likewise of degree two - showing that it can be represented in terms of counts of certain chord diagrams together with doodle invariants.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.