Grassmannian trilogarithms

Details Grassmannian trilogarithms Grassmannian trilogarithms

2000-11-21

arxiv.org/abs/math/0011165v1

Mathematics

Algebraic Geometry

The paper will appear in Compositio Math

Scientific paper

Some time ago the first author suggested two different constructions of Grassmannian n-logarithms. One of them works for all n, but its motivic nature is hidden. The other is a motivic but so far available only for n=2,3,4. We derived some general results about the first construction of Grassmannian polylogarithms, and found an explicit relation between the two constructions of the Grassmannian trilogarithms.

Affiliated with

Also associated with

No associations

Rating

Grassmannian trilogarithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Grassmannian trilogarithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Grassmannian trilogarithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-590401