The Johnson homomorphism, embedding calculus and graph complexes
Florian Naef, Thomas Willwacher

TL;DR
This paper provides an overview of how the Johnson homomorphism and related traces can be derived from graph complexes within the framework of embedding calculus, offering a new perspective for experts.
Contribution
It offers a different viewpoint on the Johnson homomorphism by connecting it with graph complexes and embedding calculus, complementing previous work.
Findings
Johnson homomorphism derived from graph complexes
Enomoto-Satoh trace linked to Goodwillie-Weiss calculus
Higher-loop-order generalizations explained
Abstract
We explain how the Johnson homomorphism and the Enomoto-Satoh trace, as well as higher-loop-order generalizations, can be obtained from graph complexes originating in the Goodwillie-Weiss calculus. This paper can be seen as an addendum to our earlier work. It contains little new mathematical content, but is intended to give an overview of a different viewpoint on the Johnson homomorphism, for experts working mainly in the latter area.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHomotopy and Cohomology in Algebraic Topology · Topological and Geometric Data Analysis · Advanced Graph Theory Research
