Related papers: Classical Polylogarithms
These are extended abstracts from an series of lectures in 1997. The text has not been updated since then. We explain the construction of the motivic polylog as published in Annette Huber, J\"org Wildeshaus, Classical Motivic Polylogarithm…
Polylogarithms are those multiple polylogarithms that factor through a certain quotient of the de Rham fundamental group of the thrice punctured line known as the polylogarithmic quotient. Building on work of Dan-Cohen, Wewers, and Brown,…
It's well known that multiple polylogarithms give rise to good unipotent variations of mixed Hodge-Tate structures. In this paper we shall {\em explicitly} determine these structures related to multiple logarithms and some other multiple…
We discuss several topics related to polylogarithms with focus on dilogarithms. The topics are: a generating function with harmonic numbers coming from Ramanujan, extending the dilogarithm to complex numbers beyond the unit disk, and…
We construct algebraic cycles in Bloch's cubical cycle group which correspond to multiple polylogarithms with generic arguments. Moreover, we construct out of them a Hopf subalgebra in the Bloch-Kriz cycle Hopf algebra. In the process, we…
The purpose of this article is to describe explicitly the polylogarithm class in absolute Hodge cohomology of a product of multiplicative groups, in terms of the Bloch-Wigner-Ramakrishnan polylogarithm functions. We will use the logarithmic…
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.
Chow polylogarithms are some special functions arising in explicit description of the Beilinson regulator map. The most interesting functional equation for this function reflects its vanishing on the boundary in the Bloch's cycle complex.…
Classical polylogarithms give rise to a variation of mixed Hodge-Tate structures on the punctured projective line $S=\mathbb{P}^1\setminus \{0, 1, \infty\}$, which is an extension of the symmetric power of the Kummer variation by a trivial…
We introduce the concept of monodromy coordinates for representing solutions to large polynomial systems. Representing solutions this way provides a time-memory trade-off in a monodromy solving algorithm. We describe an algorithm, which…
Multiple polylogarithms are periods of variations of mixed Tate motives. Conjecturally, they deliver all such periods. We introduce deformations of multiple polylogarithms depending on a complex parameter h. We call them quantum…
The complex projective structures considered is this article are compact curves locally modeled on $\mathbb{CP}^1$. To such a geometric object, modulo marked isomorphism, the monodromy map associates an algebraic one: a representation of…
Borel's construction of the regulator gives an injective map from the algebraic $K$-groups of a number field to its Deligne-Beilinson cohomology groups. This has many interesting arithmetic and geometric consequences. The formula for the…
We construct polylogarithms on families of pointed Riemann surfaces of any genus which describe monodromies of meromorphic connections with simple poles. Furthermore, we show that the polylogaritms are computable as power series in…
A generalization of the classical Lipschitz summation formula is proposed. It involves new polylogarithmic rational functions constructed via the Fourier expansion of certain sequences of Bernoulli--type polynomials. Related families of…
We develop the theory of multiple polylogarithms from analytic, Hodge and motivic point of view. Define the category of mixed Tate motives over a ring of integers in a number field. Describe explicitly the multiple polylogarithm Hopf…
For an integer n>2 we define a polylogarithm, which is a holomorphic function on the universal abelian cover of C-{0,1} defined modulo (2 pi i)^n/(n-1)!. We use the formal properties of its functional relations to define groups lifting…
We study the de Rham fundamental group of the configuration space $E^{(n)}$ of $n+1$ marked points on an elliptic curve $E$, and define multiple elliptic polylogarithms. These are multivalued functions on $E^{(n)}$ with unipotent monodromy,…
Multiple polylogarithms appear in analytic calculations of higher order corrections in quantum field theory. In this article we study the numerical evaluation of multiple polylogarithms. We provide algorithms, which allow the evaluation for…
The main goal of these lectures is to introduce and review the Hamiltonian formalism for classical constrained systems and in particular gauge theories. Emphasis is put on the relation between local symmetries and constraints and on the…