A note on linear independence of polylogarithms over the rationals
From MaRDI portal
The paper contains a new lower bound for the dimension of the linear space over the rationals spanned by \(1\) and values of polylogarithms of a given rational number. As a special case the authors prove the following theorem. Let \(\alpha=\frac{p}{q}\) be a rational number with \(0<|\alpha|<1\) and \(q\leq50\). Let \(s\geq356\). Then \[ \dim_{\mathbb Q}\bigl(\mathbb Q+\mathbb Q\, Li_1(\alpha)+\dots+\mathbb Q\, Li_s(\alpha)\bigr)\geq3 \] where \(Li\) is the polylogarithmic function.
Recommendations
Cites work
- A refinement of Nesterenko's linear independence criterion with applications to zeta values
- Approximate formulas for some functions of prime numbers
- scientific article; zbMATH DE number 51575 (Why is no real title available?)
- scientific article; zbMATH DE number 3219699 (Why is no real title available?)
- Linear independence of linear forms in polylogarithms
- Linear independence of values of polylogarithms
- On the linear independence of the values of polylogarithmic functions
Cited in
(7)- Can polylogarithms at algebraic points be linearly independent?
- Linear independence of polylogarithms at algebraic points
- scientific article; zbMATH DE number 6889544 (Why is no real title available?)
- On linear independence of values of generalized polylogarithms
- AN APPLICATION OF NESTERENKO'S DIMENSION ESTIMATE TO p-ADIC q-SERIES
- On the linear independence of the values of polylogarithmic functions
- Multiple polylogarithm values at roots of unity
This page was built for publication: A note on linear independence of polylogarithms over the rationals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949181)
