2000 character limit reached
The combinatorial Hopf algebra of motivic dissection polylogarithms
Published 11 Jul 2013 in math.AG, math.CO, and math.NT | (1307.3177v3)
Abstract: We introduce a family of periods of mixed Tate motives called dissection polylogarithms, that are indexed by combinatorial objects called dissection diagrams. The motivic coproduct on the former is encoded by a combinatorial Hopf algebra structure on the latter. This generalizes Goncharov's formula for the motivic coproduct on (generic) iterated integrals. Our main tool is the study of the relative cohomology group corresponding to a bi-arrangement of hyperplanes.
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.