2009
DOI: 10.1090/pspum/080.2/2483947
|View full text |Cite
|
Sign up to set email alerts
|

Multiple polylogarithms, polygons, trees and algebraic cycles

Abstract: We construct, for a field

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
72
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 18 publications
(72 citation statements)
references
References 14 publications
0
72
0
Order By: Relevance
“…Here we review this operation and show how it can be graphically interpreted. The graphical notation we present in turn connects to the graphical notation in [Gon05] and [GGL09]. The first of the two subcategories of ∆ + is ∆ and the second is the category of intervals.…”
Section: Appendix B Coalgebras and Hopf Algebrasmentioning
confidence: 99%
“…Here we review this operation and show how it can be graphically interpreted. The graphical notation we present in turn connects to the graphical notation in [Gon05] and [GGL09]. The first of the two subcategories of ∆ + is ∆ and the second is the category of intervals.…”
Section: Appendix B Coalgebras and Hopf Algebrasmentioning
confidence: 99%
“…, z n ) in a similar fashion, but we need to introduce trees with two different kinds of external edges, and an accordingly modified forest cycling map gives us the associated algebraic cycles (cf. [3]). …”
Section: Discussionmentioning
confidence: 99%
“…For a proof, we refer to [3]; the main idea is that at each internal vertex we have at least one incoming and one outgoing edge, which implies that their respective coordinates in the associated cycle cover up for each other.…”
Section: Definition 43mentioning
confidence: 99%
See 2 more Smart Citations