Generalized finite polylogarithms
From MaRDI portal
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.
Recommendations
Cites work
- A generalized truncated logarithm
- Artin-Hasse exponentials of derivations
- Congruences for central binomial sums and finite polylogarithms
- Exponential functions in prime characteristic
- From generating series to polynomial congruences
- Grading switching for modular non-associative algebras
- scientific article; zbMATH DE number 3713801 (Why is no real title available?)
- Laguerre polynomials of derivations
- On poly(ana)logs. I. (With an appendix by Maxim Kontsevich: The \(1\frac{1}{2}\)-logarithm)
Cited in
(6)
This page was built for publication: Generalized finite polylogarithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140594)