A simple construction of Grassmannian polylogarithms

By A. Goncharov. 2009

138 citations recorded by the source corpus.

Abstract The classical n -logarithm is a multivalued analytic function defined inductively: Li n ( z ) : = ∫ 0 z Li n − 1 ( t ) d log t , Li 1 ( z ) = − log ( 1 − z ) . In this paper we give a simple explicit construction of the Grassmannian n -logarithm, which is a multivalued analytic function on the quotient of the Grassmannian of n -dimensional subspaces in C 2 n in generic position to the coordinate hyperplanes by the natural action of the torus ( C ∗ ) 2 n . The classical n -logarithm appears at a certain one dimensional boundary stratum. We study Tate iterated integrals, which are homotopy invariant integrals of 1-forms d log f i where f i are rational functions. We give a simple explicit formula for the Tate iterated integral which describes the Grassmannian n -logarithm. Another example is the Tate iterated integrals for the multiple polylogarithms on the moduli spaces M 0 , n , calculated in Section 4.4 of Goncharov (2005) [13] using the combinatorics of plane trivalent trees decorated by the arguments of the multiple polylogarithms. Variations of mixed Hodge–Tate structures on X are described by a Hopf algebra H • ( X ) . We upgrade Tate iterated integrals on a (rational) complex variety X to elements of H • ( X ) . The coproducts of these elements are very interesting invariants of the iterated integrals. In general their calculation is a non-trivial problem. We show however, that working modulo the ideal of H • ( X ) generated by constant variations, there is a simple way to calculate the coproduct. It is a pleasure to dedicate this paper to Andrey Suslin, whose works Suslin (1984) [21] and Suslin (1991) [22] played an essential role in the development of the story.

Subfields: Algebra and Number Theory, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/15fdb081af8f7aaf1b1c3fbc045b27e4dece60c3

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

  1. Claude Duhr
  2. L. Dixon
  3. J. Henn
  4. Jeffrey Pennington
  5. Herbert Gangl
  6. John R. Rhodes
  7. S. Stieberger
  8. O. Schlotterer

In Discrete Mathematics and Combinatorics

  1. Claude Duhr
  2. L. Dixon
  3. Jeffrey Pennington
  4. N. Arkani-Hamed
  5. J. Trnka
  6. S. Stieberger
  7. F. Cachazo
  8. J. Bourjaily

In Geometry and Topology

  1. Claude Duhr
  2. L. Dixon
  3. N. Arkani-Hamed
  4. S. Stieberger
  5. Jeffrey Pennington
  6. O. Schlotterer
  7. Herbert Gangl
  8. J. Henn

Citations in the corpus