1 problem

0 votes0 replies0 views
The classical-polylogarithm conjecture for generalized polylogarithms of weight at most three
A generalized polylogarithm (GPL) is defined iteratively by … with $G(;x)=1$ and $G(\vec{0}_n;x)=\frac{1}{n!}\ln^n(x)$ . Its transcendentality is its weight, namely the number of it…
Conjectureopenfeynman-integrals generalized-polylogarithms symbolic-computationarXiv posted 2 days ago

The classical-polylogarithm conjecture for generalized polylogarithms of weight at most three