2000 character limit reached
Wheel graph homology classes via Lie graph homology
Published 18 Feb 2021 in math.AT | (2102.09522v1)
Abstract: We give a new proof of the non-triviality of wheel graph homology classes using higher operations on Lie graph homology and a derived version of Koszul duality for modular operads.
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.