Generalized finite polylogarithms
arXiv:1809.01237 · doi:10.1017/S0017089520000026
Abstract
We introduce a generalization of the finite polylogarithms , in characteristic , which depends on a parameter . The special case was previously investigated by the authors as the inverse, in an appropriate sense, of a parametrized generalization of the truncated exponential which is instrumental in a {\em grading switching} technique for non-associative algebras. Here we extend such generalization to in a natural manner, and study some properties satisfied by those polynomials. In particular, we find how the polynomials are related to the powers of and derive some consequences.
18 pages