Polylogarithm for families of commutative group schemes

TL;DR

This paper extends the concept of polylogarithm classes to a broader class of commutative group schemes, providing a unified framework that simplifies previous approaches in sheaf theoretic and motivic contexts.

Contribution

It introduces a generalized definition of polylogarithm classes for commutative group schemes, unifying and simplifying prior specific cases.

Findings

Unified framework for polylogarithm classes in sheaf and motivic settings.

Simplification of existing definitions and cases.

Broader applicability to commutative group schemes.

Abstract

We generalize the definition of the polylogarithm classes to the case of commutative group schemes, both in the sheaf theoretic and the motivic setting. This generalizes and simplifies the existing cases.