Generalized finite polylogarithms

Abstract

We introduce a generalization d(α)(X) of the finite polylogarithms d(0)(X)=d(X)=Σk=1p-1Xk/kd, in characteristic p, which depends on a parameter α. The special case 1(α)(X) 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 grading switching technique for non-associative algebras. Here we extend such generalization to d(α)(X) in a natural manner, and study some properties satisfied by those polynomials. In particular, we find how the polynomials d(α)(X) are related to the powers of 1(α)(X) and derive some consequences.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…