Search arXivSearch

arXiv · 0712.3987

Functional equations of the dilogarithm in motivic cohomology

Abstract

We prove relations between fractional linear cycles in Bloch's integral cubical higher Chow complex in codimension two of number fields, which correspond to functional equations of the dilogarithm. These relations suffice, as we shall demonstrate with a few examples, to write down enough relations in Bloch's integral higher Chow group CH^2(F,3) for certain number fields F to detect torsion cycles. Using the regulator map to Deligne cohomology, one can check the non-triviality of the torsion cycles thus obtained. Using this combination of methods, we obtain explicit higher Chow cycles generating the integral motivic cohomology groups of some number fields.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Oliver Petras. 2009-09-01. Functional equations of the dilogarithm in motivic cohomology. https://doi.org/10.1016/j.jnt.2009.04.009

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