arXiv · math/0011165
Grassmannian trilogarithms
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
A. B. Goncharov, J. Zhao. 2000-11-21. Grassmannian trilogarithms. https://arxiv.org/abs/math/0011165
Cite the original work for its findings. Save a collection to share your selection of sources.