Search arXivSearch

arXiv · 0810.1064

Multiple polylogarithm values at roots of unity

Abstract

For any positive integer $N$ let $μ_N$ be the group of the $N$th roots of unity. In this note we shall study the $\Q$-linear relations among values of multiple polylogarithms evaluated at $\mmu_N$. We show that the standard relations considered by Racinet do not provide all the possible relations in the following cases: (i) level N=4, weight $w=3$ or 4, and (ii) $w=2$, $7<N<50$, and $N$ is a power of 2 or 3, or $N$ has at least two prime factors. We further find some (presumably all) of the missing relations in (i) by using the octahedral symmetry of $¶^1-(\{0,\infty\}\cup μ_4)$. We also prove some other results when $N=p$ or $N=p^2$ ($p$ prime $\ge 5$) by using the motivic fundamental group of $¶^1-(\{0,\infty\}\cupμ_N)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jianqiang Zhao. 2008-10-06. Multiple polylogarithm values at roots of unity. https://doi.org/10.1016/j.crma.2008.09.011

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT