Papers
Topics
Authors
Recent
Search
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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.