Grassmannian trilogarithms
classification
🧮 math.AG
keywords
grassmannianconstructionsfirstmotivicsometrilogarithmsauthoravailable
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.