Generalized finite polylogarithms
Marina Avitabile, Sandro Mattarei

TL;DR
This paper introduces a new family of generalized finite polylogarithms in characteristic p, extending previous work and exploring their properties and relations to other algebraic structures.
Contribution
The authors define a new parameterized generalization of finite polylogarithms and analyze their properties, extending prior inverse relationships and applications in non-associative algebra techniques.
Findings
Established relations between generalized polylogarithms and their powers.
Extended the inverse relationship to a broader class of polylogarithms.
Derived properties and structural insights of the new polynomials.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
