Grassmannian trilogarithms

Simple item page
dc.creatorGoncharov, A. B.
dc.creatorZhao, J.
dc.date2000-11-21
dc.date.accessioned2026-07-07T04:38:44Z
dc.date.available2026-07-07T04:38:44Z
dc.descriptionSome 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.
dc.descriptionThe paper will appear in Compositio Math
dc.identifierhttps://arxiv.org/abs/math/0011165
dc.identifierhttp://arxiv.org/abs/math/0011165
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/60399
dc.subjectAlgebraic Geometry
dc.titleGrassmannian trilogarithms
dc.typetext

Files

Collections

arXiv