Higher genus polylogarithms on families of Riemann surfaces
Abstract: We construct polylogarithms on families of pointed Riemann surfaces of any genus which describe monodromies of meromorphic connections with simple poles. Furthermore, we show that the polylogaritms are computable as power series in deformation parameters and their logarithms associated with the families.
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.