Web, when s 1, … , s k are positive integers and z a complex number in the unit disk. For k = 1, this is the classical polylogarithm Li s (z).These multiple polylogarithms can be defined also in terms of iterated Chen integrals and satisfy shuffle relations.Multiple polylogarithms in several variables are defined for s i ≥ 1 and z i < 1(1 ≤ i ≤ k) by Webple polylogarithms, the formal KZ equation and the Gauss hypergeometric equation. In Section 2, we consider the analytic continuation of the multiple polylogarithms of one variable to the universal covering space of P1−{0,1,∞} as an analytic function. In Section 3, we give an expression of the Gauss hypergeometric function

Functional relations for elliptic polylogarithms - arXiv

WebApr 4, 2024 · A bstract Elliptic multiple polylogarithms occur in Feynman integrals and in particular in scattering amplitudes. They can be characterized by their symbol, a tensor product in the so-called ... Webpolylogarithms can be taken to genus one easily: iterated integrals on genus one allow for a natural shuffle multiplication and an associated coaction or symbol map [31]. Given the existence of the symbol map for elliptic iterated integrals, it is a natural problem to investigate functional relations for elliptic polylogarithms. cyber security listed companies

[1902.03971] Holomorphic polylogarithms and Bloch complexes

WebIn physics, polylogarithms appear in several ways. One way they appear is when computing Feynman integrals. Polylogarithms also appear in integrable models. For example, sup … WebFeb 11, 2024 · Download PDF Abstract: 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 Goncharov's Bloch groups of a field F, and show that they fit into a complex lifting … cybersecurity literature review